Skip to main content

Advertisement

SpringerLink
Log in

Reverse logistics network design: a water flow-like algorithm approach

  • Application Article
  • Published:
OPSEARCH Aims and scope Submit manuscript

Abstract

This study investigates the reverse logistics network design problem, including collection/inspection, recovery and disposal centers that a mixed integer linear programming model is considered. In this network, returned products from customer zones are collected in collection/inspection centers and after quality inspection, and also after separation, recoverable products are shipped to recovery centers and scrapped ones are transported to disposal centers. NP-hardness of this problem is proved in many papers, so a novel meta-heuristic solution method aiming minimization of total costs comprised fixed opening cost of collection/inspection, recovery and disposal centers and transportation cost of products between opened centers using priority based encoding presentation is proposed. Comparison of outputs from this proposed algorithm and a modified genetic algorithm shows the excellence of this new solution method. Finally, some directions for future research are proposed.

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

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

References

  1. Kannan, G., Sasikumar, P., Devika, K.: A genetic algorithm approach for solving a closed loop supply chain model: a case of battery recycling. Appl. Math. Model. 34, 655–670 (2010)

  2. Min, H., Ko, H.J., Ko, C.S.: A genetic algorithm approach to developing the multi-echelon reverse logistics network for product returns. Omega 34, 56–69 (2006)

  3. Pokharel, S., Mutha, A.: Perspective in reverse logistic: a review. Resourse, Conser. Recycling 53, 175–182 (2009)

    Article  Google Scholar 

  4. Govindan, K., Soleimani, H., Kannan, D.: Reverse logistics and close-loop-supply-chain: a comprehensive review. Eur. J. Oper. Res. 240, 603–626 (2015)

  5. Agrawal, S., Singh, K.R., Murtaza, Q.: A literature review and perspectives in reverse logistics. Resourse, Conser. Recycling 97, 76–92 (2015)

    Article  Google Scholar 

  6. Du, F., Evans, G.: A bi-objective reverse logistics network analysis for post-sale Service. Comput. Oper. Res. 35, 2617–2634 (2008)

    Article  Google Scholar 

  7. Xu, J., Liu, Q., Wang, R.: A class of multi-objective supply chain networks optimal model under random fuzzy environment and its application to the industry of Chinese liquor. Inf. Sci. 178, 2022–2043 (2008)

  8. Wang, H.F., Hsu, H.W.: A closed-loop logistic model with a spanning-tree based genetic algorithm. Computers & operations research. Comput. Oper. Res. 37, 376–389 (2010)

    Article  Google Scholar 

  9. Hoai An, L., Phuc, N., Tao, P.: A continuous DC programming approach to the strategic supply chain design problem from qualified partner set. Eur. J. Oper. Res. 183, 1001–1012 (2007)

    Article  Google Scholar 

  10. Altiparmak, F., Gen, M., Lin, L., Paksoy, T.: A genetic algorithm approach for multi- objective optimization of supply chain networks. Comput. Ind. Eng. 51, 197–216 (2006)

    Article  Google Scholar 

  11. Ko, H.J., Evans, G.W.: A genetic algorithm-based heuristic for the dynamic integrated forward/reverse logistics network for 3PLs. Comput. Oper. Res. 34, 346–366 (2007)

    Article  Google Scholar 

  12. Pishvaee, M., Farahani, R., Dullaert, W.: A memetic algorithm for bi-objective integrated forward/reverse logistics network design. Comput. Oper. Res. 37, 1100–1112 (2010)

    Article  Google Scholar 

  13. Lee, D.H., Dong, M.: Dynamic network design for reverse logistics operations under uncertainty. Transp. Res. E 45, 61–71 (2009)

    Article  Google Scholar 

  14. Yang, T., Wen, Y.F., Wang, F.F.: Evaluation of supply chain information-sharing strategies using a hybrid taguchi and multiple criteria decision making method. Int. J. Prod. Econ. 134(2), 458–466 (2011)

  15. Davis, P.S., Ray, T.L.: A branch-and-bound algorithm for the capacitated facilities location problem. Nav. Res. Logist. 16, 331–44 (1969)

    Article  Google Scholar 

  16. Wu, T.H., Chung, S.H., Chang, C.C.: A water flow-like algorithm for manufacturing cell formation problems. Eur. J. Oper. Res. 205, 346–360 (2010)

  17. Yang, F.C., Wang, Y.P.: Water flow-like algorithm for object grouping problems. J. Chin. Inst. Ind. Eng. 24(6), 475–488 (2007)

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

    Google Scholar 

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

    Article  Google Scholar 

  20. Pishvaee, M., Kianfar, K., Karimi, B.: Reverse logistics network design using simulated annealing. Int. J. Adv. Manuf. Technol. (2009). doi:10.1007/s00170-009-2194-5

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Management, Management and Accounting Faculty, Shahid Beheshti University, G.C., Tehran, Iran

    Abdolhay Chensebli

  2. Department of Industrial Engineering, Mazandaran University of Science and Technology, Babol, Iran

    M. Zandieh

Authors
  1. M. Zandieh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Abdolhay Chensebli
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. Zandieh.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zandieh, M., Chensebli, A. Reverse logistics network design: a water flow-like algorithm approach. OPSEARCH 53, 667–692 (2016). https://doi.org/10.1007/s12597-016-0250-0

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12597-016-0250-0

Keywords

Search

Navigation