A two-index formulation for the MDVRP with Vehicle Interchanges
This work focuses on the Multi-Depot Vehicle Routing Problem with Vehicle Interchanges (MDVRPVI). In this problem, vehicle capacities and working time limits are imposed. To improve the use of these resources, pairs of routes can be combined at fixed locations, where two drivers can exchange their vehicles. So, even if each driver must return to his home depot at the end of the journey, vehicles can follow paths from one depot to another one. The objective is to minimize the total routing cost.
The main difficulty in formulating the MDVRPVI is the need to synchronize the pairs of interchanging routes. This forces to treat the problems as asymmetric, regardless the data. In this talk, we present a two-index flow formulation. Additionally to the well-known subtour elimination constraints, other exponential families of constraints need to be included to forbid pathological structures, such as customer-only paths connecting depots, crossing routes with more than two reference depots, etc.
Palabras clave / Keywords: multi-depot VRP interchange vehicles mathematical programming
Otros trabajos en la misma sesión
Últimas noticias
-
04/06/18
Certificados -
13/04/18
Resumen del programa y Programa detallado -
22/03/18
Descuentos en medios de trasporte para congresistas y acompañantes -
01/02/18
Ampliación del plazo de tarifa superreducida -
19/01/18
Ampliación de plazos -
15/01/18
Programación para el día 29 de mayo -
15/01/18
Conferenciantes plenarios -
12/01/18
Sede: Palacio de Congresos -
24/12/17
Sesión plenaria en memoria del Profesor Pedro Gil -
24/12/17
Corrección bases del Premio Ramiro Melendreras
