An exact solution approach for vehicle routing and scheduling problems with soft time windows

Transportation Research Part E: Logistics and Transportation Review

Volumn 45, Issue 6, 2009, Pages 960-977

  Qureshi, A G ^a   Taniguchi, E ^a   Yamada, T ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

City logistics; Column generation; Vehicle routing with soft time windows

Indexed keywords

BENCHMARKING; DECOMPOSITION METHODS; GRAPH THEORY; LINEAR PROGRAMMING; VEHICLES;

CITY LOGISTICS; COLUMN GENERATION; EXACT SOLUTION; LATE ARRIVAL; SOFT TIME WINDOWS; SOLUTION APPROACH; VEHICLE ROUTING AND SCHEDULING; VEHICLE ROUTING PROBLEMS; VEHICLE ROUTING WITH SOFT TIME WINDOW; VEHICLE SCHEDULING PROBLEM;

VEHICLE ROUTING;

DECOMPOSITION ANALYSIS; LOGISTICS; MODELING; OPTIMIZATION;

EID: 69249232196     PISSN: 13665545     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tre.2009.04.007     Document Type: Article

References (42)

1. Ahuja R., Magnanti T., and Orlin J. Network Flows: Theory, Algorithms, and Applications (1993), Prentice Hall, New Jersey
2. Alvarenga G.B., Mateus G.R., and de Tomi G. A genetic and set partitioning two-phased approach for the vehicle routing problem with time windows. Computers & Operations Research 34 (2007) 1561-1584
3. Alvarenga, G.B., Mateus, G.R., 2004. A two-phase genetic and set partitioning approach for the vehicle routing problem with time windows. In: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (HIS'04), IEEE.
4. Ando N., and Taniguchi E. Travel time reliability in vehicle routing and scheduling with time windows. Networks and Spatial Economics 6 (2006) 293-311
5. Balakrishnan N. Simple heuristics for the vehicle routing problem with soft time windows. Journal of the Operational Research Society 44 (1993) 279-287
6. Braysy O., and Gendreau M. Vehicle routing problem with time windows, part I: route construction and local search algorithms. Transportation Science 39 (2005) 104-118
7. Braysy O., and Gendreau M. Vehicle routing problem with time windows, part I: metaheuristics. Transportation Science 39 (2005) 119-139
8. Calvete H.I., Gale C., Oliveros M.J., and Valverde B.S. A goal programming approach to vehicle routing problem with soft time windows. European Journal of Operational Research 177 (2007) 1720-1733
9. Chabrier A. Vehicle routing problem with elementary shortest path based column generation. Computers & Operations Research 33 (2006) 2972-2990
10. Cordeau J.F., Desaulniers G., Desrosiers J., Solomon M.M., and Soumis F. VRP with time windows. In: Toth P., and Vigo D. (Eds). The Vehicle Routing Problem. Siam Monographs on Discrete Mathematics and Applications (2002), SIAM, Philadelphia 157-193
11. Desaulniers G. Managing large fixed costs in vehicle routing and crew scheduling problems solved by column generation. Computers and Operations Research 34 (2007) 1221-1239
12. Desrochers M., and Soumis F. A generalized permanent labeling algorithm for shortest path problem with time windows. INFOR 26 (1998) 191-212
13. Desrochers M., Desrosiers J., and Solomon M. A new optimization algorithm for the vehicle routing problem with time windows. Operations Research 40 (1992) 342-354
14. Dror M. Note on the complexity of the shortest path models for column generation in VRPTW. Operations Research 42 (1994) 977-978
15. Duin Tavasszy van.J.H.R., Tavasszy L.A., and Taniguchi E. Real time simulation of auctioning and re-scheduling process in hybrid freight markets. Transportation Research Part B 41 (2007) 1050-1066
16. Dumas Y., Somis F., and Desrosiers J. Optimizing the schedule for a fixed vehicle path with convex inconvenience costs. Transportation Science 24 (1990) 145-152
17. Fagerholt K. Ship scheduling with soft time windows: an optimisation based approach. European Journal of Operational Research 131 (2001) 559-571
18. Feillet D., Dejax P., Gendreau M., and Gueguen C. An exact algorithm for the elementary shortest path problem with resource constraints: application to some vehicle routing problems. Networks 216 (2004) 229
19. Fisher M.L., Jornsten K.O., and Madsen O.B.G. Vehicle routing with time windows-two optimization algorithms. Operations Research 45 (1997) 488-498
20. Fisher M. Vehicle routing. In: Ball M.O., Magnanti T.L., Monma C.L., and Nemhauser G.L. (Eds). Network Routing: Handbooks in Operations Research and Management Science vol. 8 (1995), North-Holland, Amsterdam 1-33
21. Gelinas S., Desrochers M., Desrosiers J., and Solomon M.M. A new branching strategy for time constrained routing problems with application to backhauling. Annals of Operations Research 61 (1995) 91-109
22. Gendreau M., Guertin F., Potvin J., and Taillard E. Parallel tabu search for real-time vehicle and dispatching. Transportation Science 33 (1999) 381-390
23. Hashimoto H., Ibaraki T., Imahori S., and Yagiura M. The vehicle routing problem with flexible time windows and traveling times. Discrete Applied Mathematics 154 (2006) 2271-2290
24. Ioachim I., Gelinas S., Soumis F., and Desrosiers J. A dynamic programming algorithm for the shortest path problem with time windows and linear node costs. Networks 31 (1998) 193-204
25. Irnich S., and Desaulniers G. Shortest path problems with resource constraints. In: Desaulniers G., Desrosiers J., and Solomon M.M. (Eds). Column Generation (2005), Springer, New York 33-65
26. Irnich, S., Villeneuve, D., 2003. The shortest path problem with k-cycle elimination (k ≥ 3): improving a branch and price algorithm for the VRPTW. Technical Report G-2003-55, GERAD.
27. Kallehauge B., Larsen J., and Madsen O.B.G. Lagrangian duality applied to the vehicle routing problem with time windows. Computers & Operations Research 33 (2006) 1464-1487
28. Kohl N., Desrosiers J., Madsen O.B.G., Solomon M.M., and Soumis F. 2-Path cuts for the vehicle routing problem with time windows. Transportation Science 33 (1999) 101-116
29. Kohl N., and Madsen O.B.G. An optimization algorithm for the vehicle routing problem with time windows based on Lagrangian relaxation. Operations Research 45 (1997) 395-406
30. Kolen A.W.J., Rinnooy Kan A.H.G., and Trienekens H.W.J.M. Vehicle routing with time windows. Operations Research 35 (1987) 266-273
31. Larsen, J., 1999. Parallelization of the vehicle routing problem with time windows. Ph.D. Thesis No. 62, Department of Mathematical Modeling (IMM) at the Technical University of Denmark (DTU).
32. Ortuzar J.deD., and Willumsen L.G. Modeling Transport (1995), John Willy & Sons, England
33. Qureshi A.G., Taniguchi E., and Yamada T. Effects of relaxing time windows on vehicle routing and scheduling. Infrastructure Planning Review 24 (2007) 927-936
34. Qureshi A., and Hanaoka S. Analysis of the effects of cooperative delivery system in Bangkok. In: Taniguchi E., and Thompson R.G. (Eds). Recent Advances in City Logistics Proceedings of the 4th International Conference on City Logistics, Langkawi, Malaysia, 2005 (2005), Elsevier, Oxford 59-73
35. Righini G., and Salani M. Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints. Discrete Optimization 3 (2006) 255-273
36. Sexton R.T., and Bodin L.D. Optimizing single vehicle many to many operations with desired delivery times: I. Scheduling. Transportation Science 19 (1985) 378-410
37. Solomon M.M. Algorithms for the vehicle routing and scheduling problem with time windows constraints. Operations Research 35 (1987) 254-265
38. Tagmouti M., Gendreau M., and Potvin J.Y. Arc routing problem with time-dependent service costs. European Journal of Operational Research 181 (2007) 30-39
39. Taillard E., Badeau P., Guertin F., Gendreau M., and Potvin J. A tabu search heuristic for the vehicle routing problem with soft time windows. Transportation Science 31 (1997) 170-186
40. Taniguchi E., and Thompson R.G. Modeling city logistics. Transportation Research Record 1790 (2002) 45-51
41. Taniguchi E., Thompson R.G., Yamada T., and Duin R.V. City Logistics; Network Modeling and Intelligent Transport Systems (2001), Pergamon, Oxford
42. Vanderbeck, F., 1994. Decomposition and column generation for integer programs. Ph.D. Thesis, Faculte des Sciences Appliqees, University Catholique de Louvain Louvain-la-Neuve.