In a Two-Level Reverse Distribution Network, products are returned from customers to manufacturers through collection and refurbishing sites. The costs of the reverse chain often overtake the costs of the forward chain by many times. With some known algorithms for the problem as reference, we propose a hybrid memetic algorithm that uses linear programming and a heuristic for defining routes. Moreover, we describe heuristics for deciding locations, algorithms to define routes for the products, and problem-specific genetic operators. Memetic algorithms have returned the best results for all instances.
This is a preview of subscription content, access via your institution.
Buy single article
Instant access to the full article PDF.
Tax calculation will be finalised during checkout.
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
Tax calculation will be finalised during checkout.
All results, solutions, instances, and figures are available online at http://www.alandefreitas.com/downloads/problem-instances.php.
Min, H.: A bicriterion reverse distribution model for product recall. Omega 17(5), 483–490 (1989)
Chandran, R., Lancioni, R.A.: Product recall: a challenge for the 1980s. Int. J. Phys. Distrib. Logist. Manag. 11(8), 46–55, 483–490 (1981)
Jayaraman, V., Patterson, R.A., Rolland, E.: The design of reverse distribution networks: models and solution procedures. Eur. J. Oper. Res. 150(1), 128–149 (2003)
Davis, P., Ray, T.: A branch-bound algorithm for the capacitated facilities location problem. Nav. Res. Logist. Quart. 16(3), 331–343 (1969)
Fleischmann, M., Bloemhof-Ruwaard, J.M., Dekker, R., van der Laan, E., van Nunen, J.A., Wassenhove, L.N.V.: Quantitative models for reverse logistics: a review. Eur. J. Oper. Res. 103(1), 1–17 (1997)
Hu, T.L., Sheu, J.B., Huang, K.H.: A reverse logistics cost minimization model for the treatment of hazardous wastes. Transp. Res. Part E Logist. Transp. Rev. 38(6), 457–473 (2002)
Sheu, J.B., Chou, Y.H., Hu, C.C.: An integrated logistics operational model for green-supply chain management. Transp. Res. Part E Logist. Transp. Rev. 41(4), 287–313 (2005)
Montané, F.A.T., Galvão, R.D.: A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service. Comp. Oper. Res. 33(3), 595–619 (2006)
Ko, H.J., Evans, G.W.: A genetic algorithm-based heuristic for the dynamic integrated forward/reverse logistics network for 3pls. Comp. Oper. Res. 34(2), 346–366 (2007)
Alshamrani, A., Mathur, K., Ballou, R.H.: Reverse logistics: simultaneous design of delivery routes and returns strategies. Comp. Oper. Res. 34(2), 595–619 (2007)
Lu, Z., Bostel, N.: A facility location model for logistics systems including reverse flows: the case of remanufacturing activities. Comp. Oper. Res. 34(2), 299–323 (2007)
Spengler, T., Püchert, H., Penkuhn, T., Rentz, O.: Environmental integrated production and recycling management. Eur. J. Oper. Res. 97(2), 308–326 (1997)
Bautista, J., Pereira, J.: Modeling the problem of locating collection areas for urban waste management. An application to the metropolitan area of Barcelona. Omega 34(6), 617–629 (2006)
Barros, A., Dekker, R., Scholten, V.: A two-level network for recycling sand: a case study. Eur. J. Oper. Res. 110(2), 199–214 (1998)
Horvath, P.A., Autry, C.W., Wilcox, W.E.: Liquidity implications of reverse logistics for retailers: a markov chain approach. J. Retail. 81(3), 191–203 (2005)
Freitas, A., Silva, V., Guimarães, F., Campelo, F.: Genetic algorithms applied to reverse distribution networks. In: Snášel, V., Abraham, A., Corchado, E.S. (eds.) Soft computing models in industrial and environmental applications. Advances in intelligent systems and computing, vol. 188, pp. 317–326. Springer, Berlin/Heidelberg (2013)
Rosing, K., ReVelle, C.: Heuristic concentration: two stage solution construction. Eur. J. Oper. Res. 97(1), 75–86 (1997)
Freitas, A.R., Guimarães, F.G.: Originality and diversity in the artificial evolution of melodies. In: Proceedings of the 13th annual conference on genetic and evolutionary computation, GECCO ’11. ACM, New York, pp. 419–426 (2011)
Whitacre, J.M.: Adaptation and self-organization in evolutionary algorithms. CoRR abs/0907.0516 (2009)
Kreinovich, V., Quintana, C., Fuentes, O.: Genetic algorithms: what fitness scaling is optimal? Cybern. Syst. 24(1), 9–26 (1993)
Runarsson, T.P., Yao, X.: Stochastic ranking for constrained evolutionary optimization. IEEE Trans. Evol. Comput. 4, 284–294 (2000)
Hsu, J.: Multiple comparisons: theory and methods. Chapman and Hall, London (1996)
This work has been supported by the Brazilian agencies CAPES, CNPq (Grants 472446/2010-0 and 305506/2010-2), and FAPEMIG (Grant APQ-04611-10); and by the Marie Curie International Research Staff Exchange Scheme Fellowship within the 7th European Community Framework Programme.
About this article
Cite this article
Freitas, A.R.R., Silva, V.M.R., Campelo, F. et al. Optimizing two-level reverse distribution networks with hybrid memetic algorithms. Optim Lett 8, 753–762 (2014). https://doi.org/10.1007/s11590-013-0615-8
- Evolutionary computation
- Memetic algorithms
- Reverse distribution networks