Reference : Exact and Heuristic Solution Methods for a VRP with Time Windows and Variable Service...
Scientific congresses and symposiums : Unpublished conference/Abstract
Business & economic sciences : Quantitative methods in economics & management
http://hdl.handle.net/2268/181793
Exact and Heuristic Solution Methods for a VRP with Time Windows and Variable Service Start Time
English
Michelini, Stefano 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 >]
Küçükaydin, Hande mailto [MEF University, Istanbul > > > >]
5-Feb-2015
Yes
International
ORBEL29 - 29th meeting of the Belgian Operational Research Society
February 5 - 6, 2015
[en] VRP ; Branch-and-Price ; metaheuristic
[en] We consider a VRP with time windows in which the total cost of a solution depends on the duration of the vehicle routes, and the starting time for each vehicle is a decision variable. We first develop a Branch-and-Price algorithm considering the pricing subproblem, an elementary shortest path problem with resource constraints (ESPPRC). We discuss research on this exact solution methodology, based on a bidirectional dynamic programming approach for the ESPPRC, and on the design of a matheuristic.
Researchers ; Professionals ; Students
http://hdl.handle.net/2268/181793

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
orbel29slides.pdfAuthor postprint1.04 MBView/Open

Bookmark and Share SFX Query

All documents in ORBi are protected by a user license.