[en] In vehicle routing problems with multiple trips (VRPM), each vehicle is allowed to perform more than one trip during its working period. Classical solution techniques for this problem use existing VRP heuristics to create trips, together with bin packing methods aimed at assigning these trips to the available vehicles. In this work, specific local search operators for the VRPM are proposed. Heuristics using these operators are compared with classical solution techniques mentioned above.
Research Center/Unit :
QuantOM
Disciplines :
Production, distribution & supply chain management
Author, co-author :
Arda, Yasemin ; Université de Liège > HEC-Ecole de gestion : UER > UER Opérations : Supply Chain Management
Crama, Yves ; Université de Liège > HEC-Ecole de gestion : UER > Recherche opérationnelle et gestion de la production
François, Véronique ; Université de Liège > HEC-Ecole de gestion : UER > UER Opérations : Supply Chain Management
Laporte, Gilbert; HEC Montréal
Language :
English
Title :
Specific Multi-trip Operators for Vehicle Routing Problems
Publication date :
17 July 2014
Event name :
IFORS 2014 - 20th Conference of the International Federation of Operational Research Societies
Event organizer :
International Federation of Operational Research Societies
