Skip to main content
SpringerLink
Log in

Solving reverse logistics vehicle routing problems with time windows

  • ORIGINAL ARTICLE
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

A vehicle routing problem with simultaneous pick-up and delivery in closed-loop logistics network optimization is studied in this paper. Since, in practice, material pick-up and delivery are only allowed to take place on certain time periods, we consider the reverse logistics vehicle routing problem with time windows. A mixed integer programming model is proposed to formulate the considered problem. A heuristic solution approach for solving the model is developed due to the NP-hard nature of solving the model. The heuristic solution is then used as an initial solution of a simulated annealing procedure for improved solutions. The proposed heuristic method and the simulated annealing procedure yield very promising solutions in much less computational time when compared with optimal solutions generated by exact solution procedures. Numerical examples are presented to illustrate the developed model and solution methods.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  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

    Chapter  Google Scholar 

  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

    Article  MATH  Google Scholar 

  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

    Article  Google Scholar 

  4. Bräysy O, Gendreau M (2005) Vehicle routing problem with time windows, Part II: metaheuristics. Transp Sci 39:119–139

    Article  Google Scholar 

  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

    Google Scholar 

  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

    Article  MATH  Google Scholar 

  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

    Article  MathSciNet  MATH  Google Scholar 

  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

    Article  MATH  Google Scholar 

  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

    Article  Google Scholar 

  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

    Article  MathSciNet  MATH  Google Scholar 

  16. Lenstra J, Kan A (1981) Complexity of vehicle routing and scheduling problems. Networks 11:221–227

    Article  Google Scholar 

  17. Li H, Lim A (2003) Local search with annealing-like restarts to solve the VRPTW. Eur J Oper Res 150:115–127

    Article  MathSciNet  MATH  Google Scholar 

  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

    Article  Google Scholar 

  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

    Article  Google Scholar 

  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

    MATH  Google Scholar 

  24. Solomon M (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper Res 35:254–265

    Article  MathSciNet  MATH  Google Scholar 

  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

    Article  MATH  Google Scholar 

  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

    Article  MathSciNet  MATH  Google Scholar 

  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

    Article  MathSciNet  MATH  Google Scholar 

  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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mechanical and Industrial Engineering, Concordia University, 1455 de Maisonneuve West, Montreal, QC, Canada, H3G 1M8

    Sally Kassem & Mingyuan Chen

Authors
  1. Sally Kassem
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mingyuan Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mingyuan Chen.

Electronic supplementary material

Below is the link to the electronic supplementary material.

ESM 1

(DOC 27 kb)

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kassem, S., Chen, M. Solving reverse logistics vehicle routing problems with time windows. Int J Adv Manuf Technol 68, 57–68 (2013). https://doi.org/10.1007/s00170-012-4708-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-012-4708-9

Keywords

Search

Navigation