The Vehicle Routing Problem with Time Windows, Limited Number of Vehicles and Exact Operation Synchronization (m-VRPTWEOS)

Marcus Poggi de Aragão 1 Fabian Castilla 1 Ruslan Sadykov 2 François Vanderbeck 2
2 Realopt - Reformulations based algorithms for Combinatorial Optimization
LaBRI - Laboratoire Bordelais de Recherche en Informatique, IMB - Institut de Mathématiques de Bordeaux, Inria Bordeaux - Sud-Ouest
Abstract : This work introduces the m-VRPTWEOS. It arises in real life applications in ports and mines operations. Each customer may demand different types of vehicles to perform a task collaboratively. Vehicles are allowed to wait at the locations but demanded vehicles must start operating at the same time. The objective is to route the available vehicles in a way that maximizes the (weighted) number of served customers and minimizes the total distance traveled. Models and algorithms are presented. They are implemented on top of BaPCod. Tests are run on classes of proposed benchmark instances.
Type de document :
Communication dans un congrès
26th European Conference on Operational Research, Jul 2013, Rome, Italy. 2013
Liste complète des métadonnées

https://hal.inria.fr/hal-00857924
Contributeur : Ruslan Sadykov <>
Soumis le : mercredi 4 septembre 2013 - 11:37:47
Dernière modification le : jeudi 11 janvier 2018 - 06:22:12

Identifiants

  • HAL Id : hal-00857924, version 1

Collections

Citation

Marcus Poggi de Aragão, Fabian Castilla, Ruslan Sadykov, François Vanderbeck. The Vehicle Routing Problem with Time Windows, Limited Number of Vehicles and Exact Operation Synchronization (m-VRPTWEOS). 26th European Conference on Operational Research, Jul 2013, Rome, Italy. 2013. 〈hal-00857924〉

Partager

Métriques

Consultations de la notice

338