Exact solution for the Vehicle Routing Problem with Semi Soft Time Windows and its application

Procedia - Social and Behavioral Sciences

Volumn 2, Issue 3, 2010, Pages 5931-5943

  Qureshi, Ali Gul ^a   Taniguchi, Eiichi ^a   Yamada, Tadashi ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

City logistics; Column generation; Soft time windows; Vehicle routing

Indexed keywords

EID: 77956629130     PISSN: 18770428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1016/j.sbspro.2010.04.008     Document Type: Conference Paper

References (30)

1. Ando, N., & Taniguchi, E. (2006). Travel time reliability in vehicle routing and scheduling with time windows. Networks and Spatial Economics, 6, 293-311.
2. Alvarenga, G. B., Mateus, G. R., & Tomi, G. de. (2007). A genetic and set partitioning two-phased approach for the vehicle routing problem with time windows. Computers & Operations Research, 34, 1561-1584.
3. Balakrishnan, N. (1993). Simple heuristics for the vehicle routing problem with soft time windows. Journal of the Operational Research Society, 44, 279-287.
4. Braysy, O., & Gendreau, M. (2005a). Vehicle routing problem with time windows, part I: Route construction and local search algorithms. Transportation Science, 39, 104-118.
5. Braysy, O., & Gendreau, M. (2005b). Vehicle routing problem with time windows, part II: Metaheuristics. Transportation Science, 39, 119-139.
6. Calvete, H. I., Gale, C., Oliveros, M. J., & Valverde, B. S. (2007). A goal programming approach to vehicle routing problem with soft time windows. European Journal of Operational Research, 177, 1720-1733.
7. Chabrier, A. (2006). Vehicle routing problem with elementary shortest path based column generation. Computers & Operations Research, 33, 2972-2990.
8. Chipperfield, A., Fleming, P., Pohlhiem, H., & Fnoseca, C. (1994). User guide: Genetic algorithm toolbox for use with MATLAB. Department of Automatic Control and Systems Engineering, University of Sheffield. Available at: http://www.shef.ac.uk/uni/projects/gaipp/gatbx.html [accessed on November 10, 2004].
9. Desrochers, M., Desrosiers, J., & Solomon, M. (1992). A new optimisation algorithm for the vehicle routing problem with time windows. Operations Research, 40, 342-354.
10. Duin, van. J. H. R., Tavasszy, L. A., & Taniguchi, E. (2007). Real time simulation of auctioning and re-scheduling process in hybrid freight markets. Transportation Research Part B, 41, 1050-1066.
11. Dumas, Y., Somis, F., & Desrosiers, J. (1990). Optimising the schedule for a fixed vehicle path with convex inconvenience costs. Transportation Science, 24, 145-152.
12. Fagerholt, K. (2001). Ship scheduling with soft time windows: An optimisation based approach. European Journal of Operational Research, 131, 559-571.
13. Feillet, D., Dejax, P., Gendreau, M., & Gueguen, C. (2004). An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems. Networks, 216-229.
14. Gendreau, M., Guertin, F., Potvin, J., & Taillard, E. (1999). Parallel tabu search for real-time vehicle and dispatching. Transportation Science, 33, 381-390.
15. Hashimoto, H., Ibaraki, T., Imahori, S., & Yagiura, M. (2006). The vehicle routing problem with flexible time windows and travelling times. Discrete Applied Mathematics, 154, 2271-2290.
16. Ioachim, I., Gelinas, S., Soumis, F., & Desrosiers, J. (1998). A dynamic programming algorithm for the shortest path problem with time windows and linear node costs. Networks, 31, 193-204.
17. 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.
18. Kallehauge, B., Larsen, J., & Madsen, O. B. G. (2006). Lagrangian duality applied to the vehicle routing problem with time windows. Computers & Operations Research, 33, 1464-1487.
19. Larsen, J. (1999). Parallelization of the vehicle routing problem with time windows. PhD. Thesis No. 62, Department of Mathematical Modeling (IMM) at the Technical University of Denmark (DTU).
20. Qureshi, A. G., & Hanaoka, S. (2005). Analysis of the effects of cooperative delivery system in bangkok. In E. Taniguchi, and R. G. Thompson (Eds.), Recent advances in city logistics (pp. 59-73). Elsevier, Oxford.
21. Qureshi, A. G., Taniguchi, E., & Yamada, T. (2009). A hybrid genetic algorithm for VRPSTW using column generation. In E. Taniguchi, and R. G. Thompson (Eds.), Innovations in city logistics (pp. 153-170). Nova Publishers, New York.
22. Sexton, R. T., & Bodin, L. D. (1985). Optimising single vehicle many to many operations with desired delivery times: I. Scheduling. Transportation Science, 19, 378-410.
23. Solomon, M. M. (1987). Algorithms for the vehicle routing and scheduling problem with time windows constraints. Operations Research, 35, 254-265.
24. Tagmouti, M., Gendreau, M., & Potvin, J. Y. (2007). Arc routing problem with time-dependent service costs. European Journal of Operational Research, 181, 30-39.
25. Taillard, E., Badeau, P., Guertin, F., Gendreau, M., & Potvin, J. (1997). A tabu search heuristic for the vehicle routing problem with soft time windows. Transportation Science, 31, 170-186.
26. Taniguchi, E., Thompson, R. G., Yamada, T., & Duin, R. V. (2001). City logistics: Network modeling and intelligent transport systems. Pergamon, Oxford.
27. Taniguchi, E., & Heijden, R. E. C. M. van der. (2000). An evaluation methodology for city logistics. Transport Reviews, 20, 65-90.
28. Thompson, R. G., & Van Duin, J. H. R. (2003). Vehicle routing and scheduling. In E. Taniguchi, & R. G. Thompson (Eds.), Innovations in freight transportation (pp. 47-63). WIT Press, Southampton.
29. Yamada, T., Yoshimura, Y., & Mori, K. (2004). Road network reliability analysis using vehicle routing and scheduling procedures. In E. Taniguchi, & R. G Thompson (Eds.), Logistics systems for sustainable cities, proceedings of the 3rd international conference on city logistics (pp. 97-110). Elsevier, UK.
30. Yamada, T., Taniguchi, E., & Itoh, Y. (2001). Co-operative vehicle routing model with optimal location of logistics terminals. In E. Taniguchi, & R. G. Thompson (Eds.), City logistics II (pp. 139-153). Institute for City Logistics, Japan.