Title :

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

Author(s) :

Cattaruzza, Diego [Auteur]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Integrated Optimization with Complex Structure [INOCS]
Gianessi, Paolo [Auteur]
Institut Henri Fayol [FAYOL-ENSMSE]
École des Mines de Saint-Étienne [Mines Saint-Étienne MSE]
Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes [LIMOS]
Département Génie mathématique et industriel [FAYOL-ENSMSE]

Conference title :

IFORS 2017 - 21st Conference of the International Federation of Operational Research Societies

City :

Quebec City

Country :

Canada

Start date of the conference :

2017-07-17

English keyword(s) :

Exact Methods
Branch&Cut
Time Windows
Multi-Trip VRP

HAL domain(s) :

Computer Science [cs]/Operations Research [math.OC]

English abstract : [en]

The Vehicle Routing Problem with Time Windows (VRPTW) deals with the determinationof the trips of a homogeneous fleet of capacitated vehicles based at a central depot to deliver aset of customers, while complying delivery ...
Show more >The Vehicle Routing Problem with Time Windows (VRPTW) deals with the determinationof the trips of a homogeneous fleet of capacitated vehicles based at a central depot to deliver aset of customers, while complying delivery time intervals imposed by these latter. The MultiTripVRP with Time Windows (MTVRPTW) goes one step further by allowing vehicles toperform not one but a sequence of trips, called a journey, under a maximum overall shift lengthconstraint. Moreover, the time to load a vehicle is service-dependent, i.e. proportional to thetotal service time of the subsequent trip. Hence, the MTVRPTW consists in finding a set ofback-to-depot delivery trips and assigning them to vehicles so that the total travelled distanceis 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.Show less >

Language :

Anglais

Peer reviewed article :

Oui

Audience :

Internationale

Popular science :

Non

Collections :

• Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189

Source :

Harvested from HAL