{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:51:52Z","timestamp":1767340312293,"version":"3.37.3"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:00:00Z","timestamp":1630454400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,9,15]],"date-time":"2021-09-15T00:00:00Z","timestamp":1631664000000},"content-version":"vor","delay-in-days":14,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100007837","name":"Universit\u00e4t Bremen","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100007837","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN Oper. Res. Forum"],"published-print":{"date-parts":[[2021,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The distribution\/allocation problem is known as one of the most comprehensive strategic decision. In real-world cases, it is impossible to solve a distribution\/allocation problem in traditional ways with acceptable time. Hence researchers develop efficient non-traditional techniques for the large-term operation of the whole supply chain. These techniques provide near optimal solutions particularly for large-scale test problems. This paper presents an integrated supply chain model which is flexible in the delivery path. As the solution methodology, we apply a memetic algorithm with a neighborhood search mechanism and novelty in population presentation method called \u201cextended random path direct encoding method.\u201d To illustrate the performance of the proposed memetic algorithm, LINGO optimization software serves as comparison basis for small size problems. In large-size cases that we are dealing with in real world, a classical genetic algorithm as the second metaheuristic algorithm is considered to compare the results and show the efficiency of the memetic algorithm.<\/jats:p>","DOI":"10.1007\/s43069-021-00087-8","type":"journal-article","created":{"date-parts":[[2021,11,18]],"date-time":"2021-11-18T13:02:48Z","timestamp":1637240568000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Comparison between Memetic Algorithm and Genetic Algorithm for an Integrated Logistics Network with Flexible Delivery Path"],"prefix":"10.1007","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5810-1002","authenticated-orcid":false,"given":"Elham","family":"Behmanesh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00fcrgen","family":"Pannek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,15]]},"reference":[{"key":"87_CR1","doi-asserted-by":"crossref","unstructured":"Neto JQF, Walther G, Bloemhof J, Nunen JAEEV, Spengler T (2009) From closed-loop to sustainable supply chains: the weee case. Int J Prod Res 48(15):4463\u20134481","DOI":"10.1080\/00207540902906151"},{"key":"87_CR2","doi-asserted-by":"publisher","first-page":"1223","DOI":"10.1016\/j.ejor.2007.08.002","volume":"191","author":"N Aras","year":"2008","unstructured":"Aras N, Aksen D, Tanugur A (2008) Locating collection centers for incentive dependent returns under a pick-up policy with capacitated vehicles. Eur J Oper Res 191:1223\u20131240","journal-title":"Eruropean Journal of Operational Research"},{"issue":"1","key":"87_CR3","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.ejor.2011.12.045","volume":"220","author":"SA Alumur","year":"2012","unstructured":"Alumur SA, Nickel S, da Gamad FS, Verter V (2012) Multi-period reverse logistics network design. Eur J Oper Res 220(1):67\u201378","journal-title":"Eur J Oper Res"},{"key":"87_CR4","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1287\/inte.30.3.226.11666","volume":"30","author":"I Maslennikova","year":"2000","unstructured":"Maslennikova I, Foley D (2000) Xerox\u2018s approach to sustainability. Interfaces 30:226\u2013233","journal-title":"Interfaces"},{"key":"87_CR5","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1016\/j.tre.2006.11.003","volume":"44","author":"D Lee","year":"2007","unstructured":"Lee D, Dong M (2007) A heuristic approach to logistics network design for end-of lease computer pproduct recovery. Transp Res Part E 44:455\u2013474","journal-title":"Transprtation Research Part E"},{"key":"87_CR6","doi-asserted-by":"publisher","first-page":"1100","DOI":"10.1016\/j.cor.2009.09.018","volume":"37","author":"MS Pishvaee","year":"2010","unstructured":"Pishvaee MS, Farahani RZ, Dullaert W (2010) A memetic algorithm for bi-objective integrated forward\/reverse logistics network design. Comput Oper Res 37:1100\u20131112","journal-title":"Comput Oper Res"},{"key":"87_CR7","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/j.ejor.2009.06.011","volume":"203","author":"W Kilibi","year":"2010","unstructured":"Kilibi W, Martel A, Guitouni A (2010) The design of robust value-creating supply chain networks: a critical review. Eur J Oper Res 203:283\u2013293","journal-title":"Eruropean Journal of Operational Research"},{"key":"87_CR8","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/j.cie.2006.07.011","volume":"51","author":"F Altiparmak","year":"2006","unstructured":"Altiparmak F, Gen M, Lin L, Paksoy T (2006) A genetic algorithm approach for multi-objective potimization of supply chain networks. Comput Ind Eng 51:197\u2013216","journal-title":"Comput Ind Eng"},{"key":"87_CR9","doi-asserted-by":"publisher","first-page":"2617","DOI":"10.1016\/j.cor.2006.12.020","volume":"35","author":"F Du","year":"2008","unstructured":"Du F, Evans G (2008) A bi-objective reverse logistics network analysis for post-sale service. Comput Oper Res 35:2617\u20132634","journal-title":"Comput Oper Res"},{"key":"87_CR10","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1007\/s00170-003-2025-z","volume":"26","author":"W Yeh","year":"2005","unstructured":"Yeh W (2005) A hybrid heuristic algorithm for the multistage supply chain network problem. Int J Adv Manuf Technol 26:675\u2013685","journal-title":"Int J Adv Manuf Technol"},{"key":"87_CR11","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/S0377-2217(02)00497-6","volume":"150","author":"V Jayaraman","year":"2003","unstructured":"Jayaraman V, Patterson R, Rolland E (2003) The design of reverse distribution networks: mmodel and solution pprocedure. Eur J Oper Res 150:128\u2013149","journal-title":"Eur J Oper Res"},{"issue":"1","key":"87_CR12","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/s00170-009-2194-5","volume":"47","author":"MS Pishvaee","year":"2010","unstructured":"Pishvaee MS, Kianfar K, Karimi B (2010) Reverse logistics network design simulated annealing. Int J Adv Manuf Technol 47(1):269\u2013281","journal-title":"The international Journal of Advanced Manufacturing Technology"},{"key":"87_CR13","doi-asserted-by":"crossref","unstructured":"Yadegari E, Zandieh M, Najmi H (2015) A hybrid spanning tree-based genetic\/simulated annealing algorithm for a closed-loop logistics network design problem. Int J Appl Decis Sci 8","DOI":"10.1504\/IJADS.2015.074612"},{"key":"87_CR14","doi-asserted-by":"crossref","unstructured":"Yadegari E, Ekhtiari M, Zandieh M, Alem-Tabriz A (2014) An artificial immune algorithm for a closed-loop supply chain network design problem with different delivery paths. Int J Strateg Decis Sci 5(3)","DOI":"10.4018\/ijsds.2014070102"},{"key":"87_CR15","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/j.ejor.2008.05.007","volume":"196","author":"M Melo","year":"2009","unstructured":"Melo M, Nickel S, da Gama FS (2009) Facility location and supply chain management: a review. Eur J Oper Res 196:401\u2013412","journal-title":"Eur J Oper Res"},{"issue":"22","key":"87_CR16","first-page":"1","volume":"9","author":"E Behmanesh","year":"2016","unstructured":"Behmanesh E, Pannek J (2016) A memetic algorithm with extended random path encoding for a closed-loop supply chain model with flexible delivery. J Logist Res 9(22):1\u201312","journal-title":"Journal of Logistics Research"},{"key":"87_CR17","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1016\/j.cie.2008.09.016","volume":"56","author":"Y Yun","year":"2009","unstructured":"Yun Y, Moon C, Kim D (2009) Hybrid genetic algorithm with adaptive local search scheme for solving multistage-based supply chain problems. Comput Ind Eng 56:821\u2013838","journal-title":"Comput Ind Eng"},{"issue":"2","key":"87_CR18","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1016\/j.cor.2007.10.011","volume":"36","author":"RT Moghadam","year":"2009","unstructured":"Moghadam RT, Safaei N, Sassani F (2009) A memetic algorithm for the flexible flow line scheduling problem with processor blocing. Comput Oper Res 36(2):402\u2013414","journal-title":"Computer and Operations Research"},{"key":"87_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.5772\/7789","volume":"9","author":"C Lin","year":"2012","unstructured":"Lin C, Chen K, Chuang W (2012) Motion planning using a memetic evolution algorithm for swarm robots. Int J Adv Rob Syst 9:1\u20139","journal-title":"Int J Adv Rob Syst"},{"key":"87_CR20","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1016\/j.cor.2005.03.004","volume":"34","author":"HJ Ko","year":"2007","unstructured":"Ko HJ, Evans GW (2007) A genetic-based heuristic for the dynamic integrated forward\/reverse logistics network for 3pls. Comput Oper Res 34:346\u2013366","journal-title":"Comput Oper Res"},{"key":"87_CR21","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.jclepro.2017.01.001","volume":"144","author":"Y Wang","year":"2017","unstructured":"Wang Y, Ma X, Li Z, Liu Y, Xu M, Wang Y (2017) Profit distribution in collaborative multiple centers vehicle routing problem. J Clean Prod 144:203\u2013219","journal-title":"J Clean Prod"},{"key":"87_CR22","first-page":"102","volume":"143","author":"Y Wang","year":"2020","unstructured":"Wang Y, Peng S, Zhou X, Mahmoudi M, Zhen L (2020) Green logistics location routing problem with eco packages. Transp Res Part E: Logist Transp Rev 143:102\u2013118","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"key":"87_CR23","first-page":"120","volume":"258","author":"Y Wang","year":"2020","unstructured":"Wang Y, Yuan Y, Guan X, Xu M, Wang L, Wang H, Liu Y (2020) Collaborative two-echelon multicenter vehicle routing optimization based on state-space-time network representation. J Clean Prod 258:120\u2013590","journal-title":"J Clean Prod"},{"key":"87_CR24","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.comnet.2020.107327","volume":"177","author":"X Fu","year":"2020","unstructured":"Fu X, Pace P, Aloi G, Yang L, Fortino G (2020) Topology optimization against cascading failures on wireless sensor networks using a memetic algorithm. Comput Netw 177:107\u2013327","journal-title":"Comput Netw"},{"key":"87_CR25","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.jnca.2019.04.005","volume":"137","author":"X Fu","year":"2019","unstructured":"Fu X, Yao H, Postolache O, Yang Y (2019) Message forwarding for wsn-assisted opportunistic network in disaster scenarios. J Netw Comput Appl 137:11\u201324","journal-title":"J Netw Comput Appl"},{"key":"87_CR26","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.ins.2019.04.004","volume":"491","author":"X Fu","year":"2019","unstructured":"Fu X, Yao H, Yang Y (2019) Exploring the invulnerability of wireless sensor networks against cascading failures. Inf Sci 491:107\u2013327","journal-title":"Inf Sci"},{"key":"87_CR27","first-page":"34","volume":"1","author":"P Grag","year":"2009","unstructured":"Grag P (2009) A comparison between memetic algorithm and genetic algorithm for the cryptanalysis of simplified data encryption standard algorithm. Int J Netw Secur Appl 1:34\u201342","journal-title":"International Journal of Network Security and Its Applications"},{"key":"87_CR28","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1016\/j.cie.2018.12.054","volume":"128","author":"E Yadegari","year":"2019","unstructured":"Yadegari E, Alem-Tabriz A, Zandieh M (2019) A memetic algorithm with a novel neighborhood search and modified solution representation for closed-loop supply chain network design. Comput Ind Eng 128:418\u2013436","journal-title":"Comput Ind Eng"},{"key":"87_CR29","doi-asserted-by":"crossref","unstructured":"Syarif A, Yun YS, Gen M (2002) study on multi-stage logistic chain network: a spanning tree-based genetic algorithm approach. Comput Ind Eng 43(1):299\u2013314","DOI":"10.1016\/S0360-8352(02)00076-1"},{"key":"87_CR30","first-page":"827","volume":"14","author":"A Afkar","year":"2012","unstructured":"Afkar A, Kaleibar MM, Payani A (2012) Geometry optimization of double wishbone suspension system via genetic algorithm for handling improvement. J Vibroengineering 14:827\u2013883","journal-title":"Journal of Vibroengineerin"},{"key":"87_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1139\/tcsme-2011-0001","volume":"35","author":"MJ Richard","year":"2011","unstructured":"Richard MJ, Bouazara M, Khadir L, Ca GQ (2011) Structural optimization algorithm for vehicle suspensions. Trans Can Soc Mech Eng 35:1\u201317","journal-title":"Trans Can Soc Mech Eng"},{"issue":"3","key":"87_CR32","first-page":"378","volume":"8","author":"F Yaman","year":"2010","unstructured":"Yaman F, Yilmaz AE (2010) Impacts of genetic algorithm parameters on the solution performance for the uniform circular antenna array pattern synthesis problem. J Appl Res Technol 8(3):378\u2013439","journal-title":"Journal of Applied Research and Technoloy"},{"issue":"2","key":"87_CR33","doi-asserted-by":"publisher","first-page":"202","DOI":"10.22201\/icat.16656423.2011.9.02.452","volume":"9","author":"A Vargas-Martinez","year":"2011","unstructured":"Vargas-Martinez A, Garza-Castanon LE (2011) Combining artificial intelligence and advanced techniques in fault-tolerant contro. J Appl Res Technol 9(2):202\u2013222","journal-title":"Journal of Applied Research and Technology"},{"key":"87_CR34","volume-title":"Genetic algorithms and engineering optimization","author":"M Gen","year":"2000","unstructured":"Gen M, Cheng R (2000) Genetic algorithms and engineering optimization. Wiley, New York"},{"key":"87_CR35","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1016\/S0965-9978(01)00007-2","volume":"32","author":"M Gen","year":"2001","unstructured":"Gen M, Cheng R, Oren SS (2001) Network design techniques using adapted genetic algorithms. Adv Eng Softw 32:731\u2013744","journal-title":"Advanced in engineering software"},{"issue":"2","key":"87_CR36","first-page":"181","volume":"17","author":"M Hendriks","year":"1999","unstructured":"Hendriks M, Voeten B, Kroep L (1999) Human resource allocation in a multi-project r and d environment. International J Prod Mgmt 17(2):181\u2013188","journal-title":"International Journal of Production Management"},{"key":"87_CR37","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.compind.2004.06.006","volume":"56","author":"K Kim","year":"2005","unstructured":"Kim K, Yun Y, Yoon J, Gen M, Yamazaki G (2005) Hybrid genetic algorithm with adaptive abilities for resource-constrained multiple project scheduling. Comput Ind 56:143\u2013160","journal-title":"Computation in Industry"},{"key":"87_CR38","doi-asserted-by":"crossref","unstructured":"Behmanesh E, Pannek J (2016) Modeling and random path-based direct encoding for a closed loop supply chain model with flexible delivery paths, in the seventh IFAC conference on Management and Control of Production and Logistics, p. submitted","DOI":"10.1007\/s12159-016-0150-y"},{"key":"87_CR39","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1016\/S1665-6423(13)71534-7","volume":"11","author":"YC Lin","year":"2013","unstructured":"Lin YC (2013) Mixed-integer constrained optimoptimization on memetic algprithm. J Appl Res Technol 11:242\u2013250","journal-title":"Journal of applied research and technology"},{"key":"87_CR40","doi-asserted-by":"crossref","unstructured":"Hart WE, Krasnogor N, Smit JE (2005) Recent Advances in Memetic Algorithms. Springer-Verlag","DOI":"10.1007\/3-540-32363-5"},{"issue":"2","key":"87_CR41","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1109\/TEVC.2003.810752","volume":"7","author":"H Ishibuchi","year":"2003","unstructured":"Ishibuchi H, Yoshida T, Mura T (2003) Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling. IEEE Trans Evol Comput 7(2):204\u2013223","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"87_CR42","first-page":"62","volume":"37","author":"M Tang","year":"2007","unstructured":"Tang M, Yao X (2007) A memetic algorithm for vlsi floorplanning. IEEE Transp Syst 37(1):62\u201369","journal-title":"IEEE Trannportation system"},{"issue":"2","key":"87_CR43","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1109\/TEVC.2010.2051446","volume":"15","author":"Y Mei","year":"2011","unstructured":"Mei Y, Tang K, Yao X (2011) Decomposition-based memetic algorithm for multiobjective capacitated arc routing problem. IEEE Trans Evol Comput 15(2):151\u2013165","journal-title":"IEEE Trans Evol Comput"},{"issue":"6","key":"87_CR44","first-page":"1982","volume":"46","author":"Y Ahn","year":"2010","unstructured":"Ahn Y, Park J, Lee C, Kim J (2010) Novel memetic algorithm implemented with ga (genetic algorithm) and mads (mesh adaptive direct search) for optimal design of electromagnetic system. IEEE Transp 46(6):1982\u20131985","journal-title":"IEEE transportation"},{"issue":"5","key":"87_CR45","first-page":"626","volume":"42","author":"B Li","year":"2012","unstructured":"Li B, Zhou Z, Zou W, Li D (2012) Quantum memetic evolutionary algorithm-based low-complexity signal detection for underwater acoustic sensor networks. IEEE Trans Evol Comput 42(5):626\u2013640","journal-title":"IEEE Trans Evol Comput"},{"key":"87_CR46","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/j.ijpe.2004.05.026","volume":"98","author":"M Gen","year":"2005","unstructured":"Gen M, Kumar A, Kim JR (2005) Recent network design techniques using evolutionary algorithms\u201d. Int J Prod 98:251\u2013261","journal-title":"International journal of production"}],"container-title":["Operations Research Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-021-00087-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s43069-021-00087-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-021-00087-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,18]],"date-time":"2021-11-18T13:34:10Z","timestamp":1637242450000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s43069-021-00087-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9]]},"references-count":46,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["87"],"URL":"https:\/\/doi.org\/10.1007\/s43069-021-00087-8","relation":{},"ISSN":["2662-2556"],"issn-type":[{"type":"electronic","value":"2662-2556"}],"subject":[],"published":{"date-parts":[[2021,9]]},"assertion":[{"value":"28 October 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 July 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 September 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that there is no conflict of interest regarding the publication of this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}],"article-number":"47"}}