A Branch&Cut algorithm for the Multi-Trip Vehicle Routing Problem with Time Windows

Abstract : The Vehicle Routing Problem with Time Windows (VRPTW) deals with the determination of the trips of a homogeneous fleet of capacitated vehicles based at a central depot to deliver a set of customers, while complying delivery time intervals imposed by these latter. The MultiTrip VRP with Time Windows (MTVRPTW) goes one step further by allowing vehicles to perform not one but a sequence of trips, called a journey, under a maximum overall shift length constraint. Moreover, the time to load a vehicle is service-dependent, i.e. proportional to the total service time of the subsequent trip. Hence, the MTVRPTW consists in finding a set of back-to-depot delivery trips and assigning them to vehicles so that the total travelled distance is minimized and : Ieach customer is visited exactly once and service starts within the associated time window ; Ivehicle capacity is respected ; Itrips assigned to one vehicle do not overlap in time and do not exceed a maximum duration.
Document type :
Conference papers
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01629463
Contributor : Diego Cattaruzza <>
Submitted on : Monday, November 6, 2017 - 2:51:27 PM
Last modification on : Tuesday, April 9, 2019 - 1:32:06 AM

Identifiers

  • HAL Id : hal-01629463, version 1

Citation

Diego Cattaruzza, Paolo Gianessi. A Branch&Cut algorithm for the Multi-Trip Vehicle Routing Problem with Time Windows. IFORS 2017 - 21st Conference of the International Federation of Operational Research Societies, Jul 2017, Quebec City, Canada. pp.1-2. ⟨hal-01629463⟩

Share

Metrics

Record views

466