V. Rebillas Loredo, M. Albareda Sambola
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
Programado
Sesión GT04-1: Localización (GELOCA-1). Organizador: Antonio Manuel Rodríguez Chía
29 de mayo de 2018 15:20
Sala 3
