Reference : Large neighborhood search for multi-trip vehicle routing
E-prints/Working papers : First made available on ORBi
Business & economic sciences : Quantitative methods in economics & management
http://hdl.handle.net/2268/187309
Large neighborhood search for multi-trip vehicle routing
English
François, Véronique mailto [Université de Liège > HEC-Ecole de gestion : UER > UER Opérations : Supply Chain Management >]
Arda, Yasemin mailto [Université de Liège > HEC-Ecole de gestion : UER > UER Opérations : Supply Chain Management >]
Crama, Yves mailto [Université de Liège > HEC-Ecole de gestion : UER > Recherche opérationnelle et gestion de la production >]
Laporte, Gilbert [HEC Montréal > Département de sciences de la décision > > >]
30-Nov-2015
Version 30/11/2015
QuantOM
No
Belgium
[en] vehicle routing ; multiple trips ; large neighborhood search
[en] We consider two large neighborhood search approaches for the multi-trip vehicle routing problem, where each vehicle can perform several routes during the working shift to serve a set of customers. The problem specifically arises when customers are close to each other and/or when the demands are large.
A common approach in the literature consists in solving this problem by mixing vehicle routing heuristics with bin packing routines to assign routes to vehicles. We compare this approach with the use of specific operators designed to tackle the routing and the assignment aspects of the problem simultaneously. We provide several best known solutions for benchmark instances.
At the end of the work, we give insights about the proposed algorithm configurations by analyzing the behavior of several method components.
QuantOM
Researchers ; Students
http://hdl.handle.net/2268/187309

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
LNS for the MTVRP - WP 20151130.pdfAuthor preprint483.8 kBView/Open

Bookmark and Share SFX Query

All documents in ORBi are protected by a user license.