[en] We consider a VRP with time windows in which the total cost of a solu- tion depends on the total duration of the vehicle routes, and the starting time for each vehicle is a decision variable. We first develop a Branch- and-Price (BP) algorithm considering the related pricing subproblem, an elementary shortest path problem with resource constraints (ESP- PRC). We discuss past, present and planned research on this exact so- lution methodology, based on a bidirectional dynamic programming approach for the ESPPRC, and on the design of a matheuristic.
Disciplines :
Quantitative methods in economics & management
Author, co-author :
Michelini, Stefano ; Université de Liège > HEC-Ecole de gestion : UER > UER Opérations : Supply Chain Management
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
Küçükaydin, Hande; MEF University, Istanbul
Language :
English
Title :
Exact and Heuristic Solution Methods for a VRP with Time Windows and Variable Service Start Time
Publication date :
10 June 2015
Event name :
VeRoLog 2015 - Annual Workshop of the EURO Working Group on Vehicle Routing and Logistics optimization
