Transportation Planning/Vehicle Scheduling (TP/VS)

Management for Professionals

Volumn Part F385, Issue , 2012, Pages 249-285

  Grunow, Martin ^a   Stefánsdóttir, Bryndís ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Distribution Center; Penalty Cost; Soft Constraint; Travel Salesman Problem; Vehicle Route Problem

Indexed keywords

EID: 85163639061     PISSN: 21928096     EISSN: 2192810X     Source Type: Book Series    
DOI: 10.1007/978-3-642-24215-1_10     Document Type: Chapter

References (34)

1. Alvarez-Valdes, R.; Parreno, F.; Tamarit, J. M. (2005) A tabu search algorithm for the pallet loading problem, Or Spectrum, vol. 27, 43-61
2. Ambrosino, D.; Sciomachen, A. (2007) A food distribution network problem: a case study, IMA Journal of Management Mathematics, vol. 18, no. 1, 33-53
3. Bodin, L.; Golden, B. (1981) Classification in vehicle routing and scheduling, Networks, vol. 11, no. 2, 97-108
4. Bräysy, O.; Dullaert, W.; Gendreau, M. (2004) Evolutionary algorithms for the vehicle routing problem with time windows, Journal of Heuristics, vol. 10, no. 6, 587-611
5. Bräysy, O.; Gendreau, M. (2005a) Vehicle routing problem with time windows, Part I: Route construction and local search algorithms, Transportation Science, vol. 39, no. 1, 104-118
6. Bräysy, O.; Gendreau, M. (2005b) Vehicle routing problem with time windows, Part II: Metaheuristics, Transportation Science, vol. 39, no. 1, 119-139
7. CAPE Systems (2011) Homepage, URL http://www.capesystems.com/, date: April, 2011
8. Clarke, G.; Wright, J. V. (1964) Scheduling of vehicles from a central depot to a number of delivery points, Operations Research, vol. 12, no. 4, 568-581
9. Coffman, E. G.; Garey, M. R.; Johnson, D. S. (1997) Approximation algorithms for bin packing: a survey, in: D. Hochbaum (Ed.) Approximation Algorithms for NP-hard Problems, chap. 2, PWS Publishing, 46-93
10. Cordeau, J.-F.; Desaulniers, G.; Desrosiers, J.; Solomon, M. M.; Soumis, F. (2002) VRP with time windows, in: P. Toth; D. Vigo (Eds.) The Vehicle Routing Problem, chap. 7, SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, 157-193
11. Dantzig, G. B.; Ramser, J. H. (1959) The truck dispatching problem, Management Science, vol. 6, no. 1, 80-91
12. Dantzig, G. B.; Wolfe, P. (1960) Decomposition principle for linear programs, Operations Research, vol. 8, no. 1, 101-111
13. Desrochers, M.; Lenstra, J. K.; Savelsbergh, M. W. P. (1990) A classification scheme for vehicle routing and scheduling problems, European Journal of Operational Research, vol. 46, no. 3, 322-332
14. Desrosiers, J.; Dumas, Y.; Solomon, M. M.; Soumis, F. (1995) Time constrained routing and scheduling, in: M. O. Ball; T. L. Magnanti; C. L. Monma; G. L. Nemhauser (Eds.) Handbooks in Operations Research and Management Science, 8: Network Routing, chap. 2, Elsevier Science, Amsterdam, 35-139
15. Dickersbach, J. T. (2006) Supply Chain Management with APO, Springer, Berlin, 2nd ed.
16. Dyckhoff, H. (1990) A typology of cutting and packing problems, European Journal of Operational Research, vol. 44, no. 2, 145-159
17. Fleischmann, B.; Gietz, M.; Gnutzmann, S. (2004) Time-varying travel times in vehicle routing, Transportation Science, vol. 38, no. 2, 160-173
18. Gottlieb, J. (2006) Solving real-world vehicle scheduling and routing problems, URL http://www.winfo.tu-bs.de/projekte/snlm07/gottlieb.pdf
19. Gottlieb, J.; Eckert, C. (2005) Solving real-world vehicle scheduling and routing problems, International Scientific Annual Conference Operations Research, Bremen, Germany
20. Homberger, J.; Gehring, H. (1999) Two evolutionary metaheuristics for the vehicle routing problem with time windows, Information Systems and Operational Research, vol. 37, 297-318
21. Jabali, O.; Van Woensel, T.; de Kok, A. G.; Lecluyse, C.; Peremans, H. (2009) Time-dependent vehicle routing subject to time delay perturbations, IIE Transactions, accepted April 2009
22. Jünger, M.; Reinelt, G.; Rinaldi, G. (1995) The traveling salesman problem, in: M. O. Ball; T. L. Magnanti; C. L. Monma; G. L. Nemhauser (Eds.) Handbooks in Operations Research and Management Science, 7: Network models, chap. 4, Elsevier Science, Amsterdam, 225-330
23. Knolmayer, G.; Mertens, P.; Zeier, A. (2002) Supply Chain Management Based on SAP Systems - Order Management in Manufacturing Companies, Springer, Berlin, 1st ed.
24. Laporte, G.; Osman, I. H. (1995) Routing problems: A bibliography, Annals of Operations Research, vol. 61, no. 1, 227-262
25. Pallet Manager (2011) Homepage, URL http://www.packyourpallet.com/, date: April, 2011
26. Privé, J.; Renaud, J.; Boctor, F.; Laporte, G. (2006) Solving a vehiclerouting problem arising in soft-drink distribution, Journal of the Operational Research Society, vol. 57, no. 9, 1045-1052
27. Quick Pallet Maker (2011) Homepage, URL http://www.koona.com/, date: April, 2011
28. Ram, B. (1992) The pallet loading problem: A survey, International Journal of Production Economics, vol. 28, no. 2, 217-225
29. Schneeweiss, C. (2003) Distributed decision making - a unified approach, European Journal of Operational Research, vol. 150, no. 2, 237-252
30. Toth, P.; Vigo, D. (2002a) An overview of vehicle routing problems, in: P. Toth; D. Vigo (Eds.) The Vehicle Routing Problem, chap. 1, SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, 1-26
31. Toth, P.; Vigo, D. (Eds.) (2002b) The Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications, Philadelphia
32. Van Woensel, T.; Kerbache, L.; Peremans, H.; Vandaele, N. (2008) Vehicle routing with dynamic travel times: A queueing approach, European Journal of Operational Research, vol. 186, no. 3, 990-1007
33. Wäscher, G.; Hausner, H.; Schumann, H. (2007) An improved typology of cutting and packing problems, European Journal of Operational Research, vol. 183, no. 3, 1109-1130
34. Zeng, L.; Ong, H. L.; Ng, K. M.; Liu, S. B. (2008) Two composite methods for soft drink distribution problem, Advances in Engineering Software, vol. 39, no. 5, 438-443