Reference : An adaptive large neighborhood search for a vehicle routing problem with multiple tri...
Scientific congresses and symposiums : Unpublished conference/Abstract
Business & economic sciences : Production, distribution & supply chain management
http://hdl.handle.net/2268/143679
An adaptive large neighborhood search for a vehicle routing problem with multiple trips and driver shifts
English
Arda, Yasemin mailto [Université de Liège - ULiège > HEC-Ecole de gestion : UER > UER Opérations : Supply Chain Management >]
Crama, Yves mailto [Université de Liège - ULiège > HEC-Ecole de gestion : UER > Recherche opérationnelle et gestion de la production >]
François, Véronique mailto [Université de Liège - ULiège > HEC-Ecole de gestion : UER > UER Opérations : Supply Chain Management >]
13-Feb-2013
No
No
International
14e conférence ROADEF de la Société Française de Recherche Opérationnelle et Aide à la Décision
13-14-15 février 2013
Université de Technologie de Troyes
Troyes
France
[en] vehicle routing ; multiple trips ; driver shifts ; large neighborhood search ; variable neighborhood search
[en] This study analyzes a rich vehicle routing problem with multiple trips and driver shifts. The considered problem features are inspired from the practical case of a Belgian distribution company. Along with the multi-trip component, characteristics of this particular problem include time windows, pickup and delivery customers, and site-vehicle dependencies. Internal and external fleets are considered with different cost structures and driver shifts constraints. An adpative large neighborhood search is used to treat the problem.
Center for Quantitative Methods and Operations Management
START-POCAT
Researchers
http://hdl.handle.net/2268/143679

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
VRPMDS summary.pdfAuthor preprint180.74 kBView/Open

Additional material(s):

File Commentary Size Access
Restricted access
VRPMDS.pdf1.34 MBRequest copy

Bookmark and Share SFX Query

All documents in ORBi are protected by a user license.