Solving reverse logistics vehicle routing problems with time windows

International Journal of Advanced Manufacturing Technology

Volumn 68, Issue 1-4, 2013, Pages 57-68

  Kassem, Sally ^a   Chen, Mingyuan ^a  

^a Gina Cody School of Engineering and Computer Science   (Canada)

Author keywords

Heuristic method; Reverse logistics; Simulated annealing; Simultaneous pick up and delivery; Time windows; Vehicle routing

Indexed keywords

INTEGER PROGRAMMING; NUMERICAL METHODS; PICKUPS; SIMULATED ANNEALING; VEHICLE ROUTING; VEHICLES;

COMPUTATIONAL TIME; HEURISTIC SOLUTIONS; LOGISTICS NETWORK; MIXED INTEGER PROGRAMMING MODEL; PICKUP AND DELIVERY; REVERSE LOGISTICS; TIME WINDOWS; VEHICLE ROUTING PROBLEMS;

HEURISTIC METHODS;

EID: 84888344145     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-012-4708-9     Document Type: Article

References (28)

1. Angelelli E, Mansini R (2002) The vehicle routing problem with time windows and simultaneous pick-up and delivery. In: Klose A, Speranza MG, Van Wassenhove LN (eds) Quantitative approaches to distribution logistics and supply chain management. Springer, Berlin, pp 249-267
2. Bianchessi N, Righini G (2007) Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery. Comput Oper Res 34:578-594
3. Bräysy O, Gendreau M (2005) Vehicle routing problem with time windows, part I: route construction and local search algorithms. Transp Sci 39:104-118
4. Bräysy O, Gendreau M (2005) Vehicle routing problem with time windows, Part II: metaheuristics. Transp Sci 39:119-139
5. Casco D, Golden B, Wasil E (1988) Vehicle routing with backhauls: models, algorithms, and case studies. In: Golden BL, Assad AA (eds) Vehicle routing: methods and studies. Elsevier, Amsterdam, pp 127-147
6. Cao E, Lai M (2007) An improved differential evolution algorithm for the vehicle routing problem with simultaneous delivery and pick-up service. Third International Conference on Natural Computation (ICNC 2007)
7. Cao E, Lai M (2007) Vehicle routing problem with simultaneous delivery and pick-up with time windows. International Conference on Transportation Engineering 2007 (ICTE 2007), pp 160-166
8. Chen JF, Wu TH (2006) Vehicle routing problem with simultaneous deliveries and pickups. J Oper Res Soc 57:579-587
9. Chen P, Huang H, Dong X (2007) An ant colony system based heuristic algorithm for the vehicle routing problem with simultaneous delivery and pickup. Second IEEE Conference on Industrial Electronics and Applications, pp 136-141
10. Dethloff J (2001) Vehicle routing and reverse logistics: the vehicle routing problem with simultaneous delivery and pick-up. OR-Spektrum 23:79-96
11. Dethloff J (2002) Relation between vehicle routing problems: an insertion heuristic for the vehicle routing problem with simultaneous delivery and pick-up applied to the vehicle routing problem with backhauls. J Oper Res Soc 53:115-118
12. Ganesh K, Narendran TT (2008) TASTE: a two-phase heuristic to solve a routing problem with simultaneous delivery and pick-up. Int J Adv Manuf Technol 37:1221-1231
13. Haijun M, Fei Q U, Xuhong L (2007) Integration of forward and reverse logistics at the vehicle routing level. International Conference on Transportation Engineering 2007 (ICTE 2007), pp 3518-3523
14. Jiang W, Zhang Y, Xie J (2009) A particle swarm optimization algorithm with crossover for vehicle routing problem with time windows. IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2009-Proceedings, pp 103-106
15. Kallehauge B (2008) Formulations and exact algorithms for the vehicle routing problem with time windows. Comput Oper Res 35:2307-2330
16. Lenstra J, Kan A (1981) Complexity of vehicle routing and scheduling problems. Networks 11:221-227
17. Li H, Lim A (2003) Local search with annealing-like restarts to solve the VRPTW. Eur J Oper Res 150:115-127
18. Lin SW, Ying K C, Lee Z J, Chen HS (2006) Vehicle routing problems with time windows using simulated annealing. IEEE International Conference on Systems, Man, and Cybernetics, pp 645-650
19. Min H (1989) The multiple vehicle routing problem with simultaneous delivery and pickup points. Transp Res-A 23:377-386
20. Ming-Yao Q, Li-Xin M, Le Z, Hua-Yu X (2008) A new tabu search heuristic algorithm for the vehicle routing problem with time windows. International Conference on Management Science and Engineering (ICMSE), pp 1648-1653
21. Mingyong L, Erbao C (2010) An improved differential evolution algorithm for vehicle routing problem with simultaneous pickups and deliveries and time window. Eng Appl Artif Intell 23:188-195
22. de Oliveira H, Vasconcelos G, Alvarenga G, Mesquita R, de Souza M (2007) A robust method for the vrptw with multi-start simulated annealing and statistical analysis. Proceedings of the 2007 IEEE Symposium on Computational Intelligence in Scheduling (CI-Sched 2007), pp 198-205
23. Salhi S, Nagy G (1999) A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling. J Oper Res Soc 50:1034-1042
24. Solomon M (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper Res 35:254-265
25. Taillard E, Badeau P, Gendreau M, Guertin F, Potvin J (1997) A tabu search heuristic for the vehicle routing problem with soft time windows. Transp Sci 31:170-186
26. Tang F, Galvao R (2006) A tabu search algorithm for the vehicle routing problems with simultaneous pick-up and delivery service. Comput Oper Res 33:595-619
27. Wassan N, Wassan A, Nagy G (2008) A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries. J Comb Optim 15:368-386
28. Wenfeng W, Zuntong W, Fei Q (2008) An improved genetic algorithm for vehicle routing problem with time-window. Proc Intern Sym Com Sci Comput Technol ISCSCT V1:189-194