Vehicle Scheduling and Routing with Drivers' Working Hours

References

• Antes J., Derigs U. A new parallel tour construction algorithm for the vehicle routing problem with time windows. (1995) . Technical report, Department of Information Systems and Operations Research, University of Cologne, Cologne, GermanyGoogle Scholar
• Bräysy O., Gendreau M. Vehicle routing problem with time windows, Part I: Route construction and local search algorithms. Transportation Sci. (2005a) 39(1):104–118Link, Google Scholar
• Bräysy O., Gendreau M. Vehicle routing problem with time windows, Part II: Metaheuristics. Transportation Sci. (2005b) 39(1):119–139Link, Google Scholar
• Campbell A., Savelsbergh M. Efficient insertion heuristics for vehicle routing and scheduling problems. Transportation Sci. (2004) 38(3):369–378Link, Google Scholar
• Cordeau J.-F., Desaulniers G., Desrosiers J., Solomon M. M., Soumis F., Toth P., Vigo D. VRP with time windows. The Vehicle Routing Problem (2002) (SIAM Monographs on Discrete Mathematics and Applications, Philadelphia) 157–193Crossref, Google Scholar
• European Union (2006) . Regulation (EC) No. 561/2006 of the European Parliament and of the Council of 15 March 2006 on the harmonisation of certain social legislation relating to road transport and amending Council Regulations (EEC) 3821/85 and (EC) 2135/98 and repealing Council Regulation (EEC) 3820/85. Official Journal of the European Union L 102, 11.04.2006Google Scholar
• Goel A., Gruhn V. A general vehicle routing problem. Eur. J. Oper. Res. (2007) . ePub ahead of print February 16, http://dx.doi.org/10.1016/j.ejor.2006.12.065Google Scholar
• Kilby P., Prosser P., Shaw P. A comparison of traditional and constraint-based heuristic methods on vehicle routing problems with side constraints. Constraints (2000) 5:389–414Crossref, Google Scholar
• Powell W. B., Snow W., Cheung R. K. Adaptive labeling algorithms for the dynamic assignment problem. Transportation Sci. (2000) 34(1):50–66Link, Google Scholar
• Savelsbergh M. W. P., Sol M. DRIVE: Dynamic routing of independent vehicles. Oper. Res. (1998) 46:474–490Link, Google Scholar
• Schrimpf G., Schneider J., Stamm-Wilbrandt H., Dueck G. Record breaking optimization results using the ruin and recreate principle. J. Comput. Phys. (2000) 159:139–171Crossref, Google Scholar
• Shaw P. A new local search algorithm providing high quality solutions to vehicle routing problems. (1997) . Technical report, APES group, Department of Computer Sciences, University of Strathclyde, Glasgow, ScotlandGoogle Scholar
• Solomon M. M. Algorithms for the vehicle routing and scheduling problem with time window constraints. Oper. Res. (1987) 35:254–265Link, Google Scholar
• Toth P., Vigo D.The Vehicle Routing Problem (2002) (SIAM Monographs on Discrete Mathematics and Applications, Philadelphia) Crossref, Google Scholar
• Xu H., Chen Z.-L., Rajagopal S., Arunapuram S. Solving a practical pickup and delivery problem. Transportation Sci. (2003) 37(3):347–364Link, Google Scholar