Skip to main content
SpringerLink
Log in

Reverse logistics network design using simulated annealing

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

Abstract

Reverse logistics is becoming more important in overall industry area because of the environmental and business factors. Planning and implementing a suitable reverse logistics network could bring more profit, customer satisfaction, and a nice social picture for companies. But, most of logistics networks are not equipped to handle the return products in reverse channels. This paper proposes a mixed integer linear programming model to minimize the transportation and fixed opening costs in a multistage reverse logistics network. Since such network design problems belong to the class of NP-hard problems, we apply a simulated annealing (SA) algorithm with special neighborhood search mechanisms to find the near optimal solution. We also compare the associated numerical results through exact solutions in a set of problems to present the high-quality performance of the applied SA algorithm.

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.

Institutional subscriptions

Similar content being viewed by others

References

  1. Aras N, Aksen D, Tanugur AG (2008) Locating collection centers for incentive-dependent returns under a pickup policy with capacitated vehicles. Eur J Operat Res 191:1223–1240

    Article  MATH  Google Scholar 

  2. Aarts E, Lenstra JK (1997) Local search in combinatorial optimization. Wiley, New York

    MATH  Google Scholar 

  3. Arts E, Korst J (1989) Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing. Wiley, Chichester

    Google Scholar 

  4. Davis PS, Ray TL (1969) A branch-and-bound algorithm for the capacitated facilities location problem. Nav Res Logist 16:331–344

    MATH  Google Scholar 

  5. Du F, Evans GW (2008) A biobjective reverse logistics network analysis for post-sale service. Comput Oper Res 35:2617–2634

    MATH  Google Scholar 

  6. Fleischmann M, Beullens P, Bloemhof-ruwaard JM, Wassenhohve V (2001) The impact of product recovery on logistics network design. Prod Oper Manag 10:156–173

    Google Scholar 

  7. Gen M, Cheng R (2000) Genetic algorithms and engineering optimization. Wiley, New York

    Google Scholar 

  8. Gen M, Altiparmak F, Lin L (2006) A genetic algorithm for two-stage transportation problem using priority-based encoding. OR Spectrum 28:337–354

    Article  MATH  MathSciNet  Google Scholar 

  9. Jayaraman V, Guige VDR Jr, Srivastava R (1999) A closed-loop logistics model for remanufacturing. J Oper Res Soc 50:497–508

    Article  MATH  Google Scholar 

  10. Jayaraman V, Ross A (2003) A simulated annealing methodology to distribution network design and management. Eur J Oper Res 144:629–645

    Article  MATH  MathSciNet  Google Scholar 

  11. Jayaraman V, Patterson RA, Rolland E (2003) The design of reverse distribution networks: models and solution procedures. Eur J Oper Res 150:128–149

    Article  MATH  MathSciNet  Google Scholar 

  12. Krikke HR, Van Harten A, Schuur PC (1999) Reverse logistic network redesign for copiers. OR Spektrum 21:381–409

    MATH  Google Scholar 

  13. Kirkpatrick S, Gelatt CD Jr, Vecchi MP (1983) Optimization by simulated annealing. Science 220:671–680

    Article  MathSciNet  Google Scholar 

  14. Laha D, Chakraborty UK (2007) An efficient stochastic hybrid heuristic for flowshop scheduling. Eng Appl Artif Intell 20:851–856

    Article  Google Scholar 

  15. Laha D, Chakraborty UK (2008) An efficient hybrid heuristic for makespan minimization in permutation flow shop scheduling. Int J Adv Manuf Technol. doi:10.1007/s00170-008-1845-2

  16. Listes O, Dekker R (2005) A stochastic approach to a case study for product recovery network design. Eur J Oper Res 160:268–287

    Article  MATH  Google Scholar 

  17. Lu Z, Bostel N (2007) A facility location model for logistics systems including reverse flows: the case of remanufacturing activities. Comput Oper Res 34:299–323

    Article  MATH  MathSciNet  Google Scholar 

  18. Meade L, Sarkis J, Presley A (2007) The theory and practice of reverse logistics. Int J Logist Syst Manag 3:56–84

    Article  Google Scholar 

  19. Meepetchdee Y, Shah N (2007) Logistical network design with robustness and complexity considerations. Int J Phys Distrib Logist Manag 37:201–222

    Article  Google Scholar 

  20. Michalewicz Z, Vignaux GA, Hobbs M (1991) A non-standard genetic algorithm for the transportation problem. ORSA J Comput 3:307–316

    MATH  Google Scholar 

  21. Min H, Ko CS, Ko HJ (2006) The spatial and temporal consolidation of returned products in a closed-loop supply chain network. Comput Ind Eng 51:309–320

    Article  Google Scholar 

  22. Pirlot M (1992) General local search heuristics in combinatorial optimization: a tutorial. Belg J Oper Res, Stat Comput Sci 32:7–68

    MATH  Google Scholar 

  23. Üster H, Easwaran G, Akçali E, Çetinkaya S (2007) Benders decomposition with alternative multiple cuts for a multi-product closed-loop supply chain network design model. Nav Res Logist 54:890–907

    Article  MATH  Google Scholar 

  24. Wojanowski R, Verter V, Boyaci T (2007) Retail–collection network design under deposit–refund. Comput Oper Res 34:324–345

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, Amirkabir University of Technology, Tehran, Iran

    Mir Saman Pishvaee, Kamran Kianfar & Behrooz Karimi

Authors
  1. Mir Saman Pishvaee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kamran Kianfar
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Behrooz Karimi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Behrooz Karimi.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pishvaee, M.S., Kianfar, K. & Karimi, B. Reverse logistics network design using simulated annealing. Int J Adv Manuf Technol 47, 269–281 (2010). https://doi.org/10.1007/s00170-009-2194-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-009-2194-5

Keywords

Search

Navigation