A comparative study of labeling algorithms within the branch-and-price framework for vehicle routing with time windows
- 13 Downloads
This is a summary of the author’s Ph.D. thesis supervised by Yasemin Arda and defended on September 13, 2018 at the University of Liège, Belgium. The thesis is written in English and is available from the author upon request at firstname.lastname@example.org and from http://hdl.handle.net/2268/227844. Funding for the thesis was provided by the Interuniversity Attraction Poles Programme of the Belgian Science Policy Office (Grant P7/36), as part of the COMEX Project (Combinatorial Optimization, Metaheuristics and Exact Methods).
The vehicle routing problem with time windows (VRPTW) is a well-known extension of the vehicle routing problem, one of the oldest and most studied problems in combinatorial optimization. The VRPTW consists in finding an optimal set of routes for a fleet of vehicles based in a single depot in order to service a set of customers. Each customer is associated with a time window, which specifies the earliest and the latest possible service start times. Time windows are...