Capítulo de Libro
Autoría
A. Aguirre
;
M. Coccola
;
M. Zamarripa
;
C.A. Méndez
;
A. Espuña
Fecha
2011
Editorial y Lugar de Edición
elsevier
Libro
Computer-Aided Chemical Engineering, 29
(pp. 634-637)
elsevier
elsevier
ISBN
978-0-444-53711-9
Resumen
Información suministrada por el agente en
SIGEVA
The Vehicle Routing Problem with Stochastic Demands (VRPSD) has attracted the attention of the research community in the last years. This challenging problem incorporates the inherent random behavior of demands into the traditional vehicle routing problem. This work presents a robust two-stage MILP-based formulation to deal with the VRPSD problem. The main goal of the proposed method is to generate more reliable and cost-effective solutions by simultaneously considering a set of possible scener...
The Vehicle Routing Problem with Stochastic Demands (VRPSD) has attracted the attention of the research community in the last years. This challenging problem incorporates the inherent random behavior of demands into the traditional vehicle routing problem. This work presents a robust two-stage MILP-based formulation to deal with the VRPSD problem. The main goal of the proposed method is to generate more reliable and cost-effective solutions by simultaneously considering a set of possible sceneries in the decision-making process.
Ver más
Ver menos
Palabras Clave
MILP modelsStochastic OptimizationVehicle routing Problems