Reference : Neighborhood search approaches for a multi-trip vehicle routing problem with time windows
Scientific congresses and symposiums : Unpublished conference/Abstract
Business & economic sciences : Production, distribution & supply chain management
http://hdl.handle.net/2268/219276
Neighborhood search approaches for a multi-trip vehicle routing problem with time windows
English
François, Véronique mailto [Université de Liège - ULiège > HEC Liège : UER > UER Opérations : Supply Chain Management >]
Arda, Yasemin mailto [Université de Liège - ULiège > HEC Liège : UER > UER Opérations : Supply Chain Management >]
Crama, Yves mailto [Université de Liège - ULiège > HEC Liège : UER > Recherche opérationnelle et gestion de la production >]
10-Jul-2017
No
No
International
VeRoLog 2017, Annual Workshop of the EURO Working Group on Vehicle Routing and Logistics optimization
10-12 July 2017
Amsterdam
The Netherlands
[en] We consider a multi-trip vehicle routing problem with time windows where each vehicle can perform several routes to serve the customers. Besides imposing a time window at the depot, we also assume that the working time of each vehicle may not exceed a maximum duration. The pursued objective is the minimization of the total working time. In this context, starting early to ensure the satisfaction of time window constraints has a negative impact on the objective function and on the maximum allowed working time constraint. Thus, vehicle start times are explicit decision variables. We compare two large neighborhood search approaches. The first one combines vehicle routing heuristics with bin packing techniques aimed at assigning routes to vehicles. The second one makes use of specific multi-trip operators designed to tackle simultaneously the routing and the assignment aspects of the problem. We show that the proposed multi-trip operators are more suitable for constrained instances with tight time windows. An automatic configuration tool is used to find high quality results. Moreover, it allows us to gain knowledge about the behavior of algorithmic components. We also question the impact of commonly employed heuristic components.
CÉCI
Researchers ; Professionals ; Students
http://hdl.handle.net/2268/219276

There is no file associated with this reference.

Bookmark and Share SFX Query

All documents in ORBi are protected by a user license.