{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T03:10:39Z","timestamp":1771038639206,"version":"3.50.1"},"reference-count":55,"publisher":"Emerald","issue":"1","license":[{"start":{"date-parts":[[2016,11,7]],"date-time":"2016-11-07T00:00:00Z","timestamp":1478476800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"DAAD-Deutscher Akademischer Austauschdienst"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Logist. Res."],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1007\/s12159-016-0150-y","type":"journal-article","created":{"date-parts":[[2016,11,6]],"date-time":"2016-11-06T20:17:27Z","timestamp":1478463447000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["A memetic algorithm with extended random path encoding for a closed-loop supply chain model with flexible delivery"],"prefix":"10.1108","volume":"9","author":[{"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":"140","published-online":{"date-parts":[[2016,11,7]]},"reference":[{"issue":"1","key":"150_CR1","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1504\/IJLSM.2007.012070","volume":"3","author":"L Meade","year":"2007","unstructured":"Meade L, Sarkis J, Presley A (2007) The theory and practice of reverse logistics. Int J Logist Syst Manag 3(1):56\u201384","journal-title":"Int J Logist Syst Manag"},{"issue":"8","key":"150_CR2","doi-asserted-by":"crossref","first-page":"890","DOI":"10.1002\/nav.20262","volume":"54","author":"H \u00dcster","year":"2007","unstructured":"\u00dcster H, Easwaran G, Akali E, etinkaya S (2007) Benders decomposition with alternative multiple cuts for a multi-product closed-loop supply chain network design model. Naval Res Logist (NRL) 54(8):890\u2013907","journal-title":"Naval Res Logist (NRL)"},{"issue":"3","key":"150_CR3","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1016\/j.omega.2010.07.002","volume":"39","author":"M Georgiadis","year":"2011","unstructured":"Georgiadis M, Tsiakis P, Longinidis P, Sofioglou M (2011) Optimal design of supply chain networks under uncertain transient demand variations. Omega 39(3):254\u2013272","journal-title":"Omega"},{"key":"150_CR4","doi-asserted-by":"crossref","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"},{"issue":"4","key":"150_CR5","first-page":"332","volume":"12","author":"B Beamon","year":"1999","unstructured":"Beamon B (1999) Designing the green supply chain. Logistics 12(4):332\u2013342","journal-title":"Logistics"},{"issue":"3","key":"150_CR6","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1016\/j.ejor.2014.07.012","volume":"240","author":"K Govindan","year":"2015","unstructured":"Govindan K, Soleimani H, Kannan D (2015) Reverse logistics and closed supply chain: a comprehensive review to explore the future. Eur J Oper Res 240(3):603\u2013626","journal-title":"Eur J Oper Res"},{"key":"150_CR7","doi-asserted-by":"crossref","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"},{"issue":"1","key":"150_CR8","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/S0360-8352(02)00076-1","volume":"43","author":"A Syarif","year":"2002","unstructured":"Syarif A, Yun YS, Gen M (2002) study on multi-stage logistic chain network: a apanning tree-based genetic algorithm approach. Comput Ind Eng 43(1):299\u2013314","journal-title":"Comput Ind Eng"},{"key":"150_CR9","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1016\/S0377-2217(99)00105-8","volume":"123","author":"S Tragantalerngsak","year":"2000","unstructured":"Tragantalerngsak S, Holt S, Ronnqvist J (2000) An exact method for two-echelon, single-source, capacitated facility location problem. Eur J Oper Res 123:473\u2013489","journal-title":"Eur J Oper Res"},{"key":"150_CR10","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/s00291-005-0029-9","volume":"28","author":"M Gen","year":"2006","unstructured":"Gen M, Altiparmak F, Lin L (2006) A genetic algorithm for two-stage transportation problem using priority-based encoding. Oper Res-Spektrum 28:337\u2013354","journal-title":"Oper Res-Spektrum"},{"issue":"15","key":"150_CR11","doi-asserted-by":"crossref","first-page":"4463","DOI":"10.1080\/00207540902906151","volume":"48","author":"JQF Neto","year":"2010","unstructured":"Neto JQF, Walther G, Bloemhof J, Nunen AEEV, Spengler T (2010) From closed-loop to sustainable supply cchain: the weee case. Int J Prod Res 48(15):4463\u20134481","journal-title":"Int J Prod Res"},{"issue":"1","key":"150_CR12","doi-asserted-by":"crossref","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"},{"issue":"4","key":"150_CR13","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/j.resconrec.2008.11.006","volume":"53","author":"SPA Mutha","year":"2009","unstructured":"Mutha SPA (2009) Perspectives in reverse logistics: a review. Conserv Recycl 53(4):175\u2013182","journal-title":"Conserv Recycl"},{"key":"150_CR14","doi-asserted-by":"crossref","unstructured":"Sarkis J, Darnal N, Nehman G, Priest J (1995) The role of supply chain management within the industrial ecosystem. In: The 1995 IEEE international symposium on electronics and the environment, Orlando, pp 229\u2013234","DOI":"10.1109\/ISEE.1995.514981"},{"key":"150_CR15","doi-asserted-by":"crossref","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: model and solution procedure. Eur J Oper Res 150:128\u2013149","journal-title":"Eur J Oper Res"},{"issue":"2","key":"150_CR16","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/j.cie.2006.02.010","volume":"51","author":"H Min","year":"2006","unstructured":"Min H, Ko CS, Ko HJ (2006) The spatial and temporal consolidation of returned pproduct in a closed-loop supply chain network. Comput Ind Eng 51(2):309\u2013320","journal-title":"Comput Ind Eng"},{"key":"150_CR17","doi-asserted-by":"crossref","first-page":"855","DOI":"10.1016\/S0360-8352(99)00168-0","volume":"36","author":"D Louwers","year":"1999","unstructured":"Louwers D, Kip B, Peters E, Souren F, Flapper S (1999) A facility location allocation model for reusing carpet materials. Comput Ind Eng 36:855\u2013869","journal-title":"Comput Ind Eng"},{"key":"150_CR18","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1080\/07408170490458580","volume":"36","author":"M Realff","year":"2004","unstructured":"Realff M, Ammons J, Newton D (2004) Robust reverse proproduct system design for carpet recycling. IIE Trans 36:767\u2013776","journal-title":"IIE Trans"},{"key":"150_CR19","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1287\/inte.33.6.57.25183","volume":"33","author":"F Schultmann","year":"2003","unstructured":"Schultmann F, Engels B, Rentz O (2003) Closed-loop supply cchain for spent batteries. Interfaces 33:57\u201371","journal-title":"Interfaces"},{"issue":"1","key":"150_CR20","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/j.resconrec.2009.06.004","volume":"54","author":"G Kannan","year":"2009","unstructured":"Kannan G, Pokharel S, Kumar P (2009) A hybrid approach using ism and fuzzy tosis for the selection of reverse logistics provider. Resour Conser Recycl 54(1):28\u201336","journal-title":"Resour Conser Recycl"},{"key":"150_CR21","doi-asserted-by":"crossref","first-page":"731","DOI":"10.1016\/j.tre.2007.04.002","volume":"44","author":"J Figueiredo","year":"2008","unstructured":"Figueiredo J, Mayerle S (2008) Designing minimum-cost recycling collection networks with required throughput. Transp Res Part E 44:731\u2013752","journal-title":"Transp Res Part E"},{"key":"150_CR22","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1016\/j.omega.2006.04.014","volume":"36","author":"R Pati","year":"2008","unstructured":"Pati R, Vrat P, Kumar P (2008) A goal programming model for paper recycling system. Omega 36:405\u2013417","journal-title":"Omega"},{"key":"150_CR23","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.resconrec.2015.05.014","volume":"101","author":"S Huysman","year":"2015","unstructured":"Huysman S, Debaveya S, Schaubroeck T, Meester SD, Ardente F, Mathieux F, Dewulf J (2015) The recyclability benefit rate of closed-loop and open-loop systems: a case study on plastic recycling in flanders. Resour Conserv Recycl 101:53\u201360","journal-title":"Resour Conserv Recycl"},{"issue":"1","key":"150_CR24","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/j.resconrec.2010.06.014","volume":"55","author":"L Shen","year":"2010","unstructured":"Shen L, Worrel E, Patel M (2010) Open-loop recycling: a lca case study of pet bottle-to-fibre recycling. Resour Conser Recycl 55(1):34\u201352","journal-title":"Resour Conser Recycl"},{"key":"150_CR25","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1016\/j.ejor.2001.12.001","volume":"160","author":"O Listes","year":"2005","unstructured":"Listes O, Dekker R (2005) A stochastic approach to a case study for product recovery network design. Eur J Oper Res 160:268\u2013287","journal-title":"Eur J Oper Res"},{"key":"150_CR26","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/s002910050095","volume":"21","author":"H Krikke","year":"1999","unstructured":"Krikke H, Harten V, Schuur A (1999) Reverse logistic network redesign for copiers. OR Spektrum 21:381\u2013409","journal-title":"OR Spektrum"},{"key":"150_CR27","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1016\/j.omega.2006.11.012","volume":"36","author":"S Srivastava","year":"2008","unstructured":"Srivastava S (2008) Network design for reverse logistics. Omega 36:535\u2013548","journal-title":"Omega"},{"key":"150_CR28","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1111\/j.1937-5956.2001.tb00076.x","volume":"10","author":"M Fleischmann","year":"2001","unstructured":"Fleischmann M, Beullens P, Bloemhof-ruwaard JM, Wassenhove L (2001) The impact of product recovery on logistics network design. Prod Oper Manag 10:156\u2013173","journal-title":"Prod Oper Manag"},{"key":"150_CR29","doi-asserted-by":"crossref","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":"Transp Res Part E"},{"key":"150_CR30","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/j.cor.2005.03.002","volume":"34","author":"Z Lu","year":"2007","unstructured":"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\u2013323","journal-title":"Comput Oper Res"},{"key":"150_CR31","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/j.jmsy.2010.05.001","volume":"28","author":"MS Pishvaee","year":"2009","unstructured":"Pishvaee MS, Jolai F, Razmi J (2009) A stochastic optimization model for integrated forward\/reverse logistics network design. J Manuf Syst 28:107\u2013114","journal-title":"J Manuf Syst"},{"key":"150_CR32","doi-asserted-by":"crossref","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":"150_CR33","doi-asserted-by":"crossref","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":"Eur J Oper Res"},{"key":"150_CR34","doi-asserted-by":"crossref","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":"150_CR35","doi-asserted-by":"crossref","first-page":"854","DOI":"10.1016\/j.cie.2008.09.037","volume":"56","author":"L Lin","year":"2009","unstructured":"Lin L, Gen M, Wang X (2009) Integrated multistage logistics network design by using hybrid evolutionary algorithm. Computers and Industrial Engineering 56:854\u2013873","journal-title":"Computers and Industrial Engineering"},{"key":"150_CR36","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.advengsoft.2010.11.001","volume":"42","author":"MS Pishvaee","year":"2011","unstructured":"Pishvaee MS, Rabbani M (2011) A graph theoretic-based heuheuris algorithm for responsive supply chain network design with direct and indirect shipment. Adv Eng Softw 42:57\u201363","journal-title":"Adv Eng Softw"},{"key":"150_CR37","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1016\/j.ejor.2004.09.018","volume":"171","author":"A Amiri","year":"2006","unstructured":"Amiri A (2006) Designing a distribution network in a supply chain system: formulated and efficient solution procedure. Eur J Oper Res 171:567\u2013576","journal-title":"Eur J Oper Res"},{"key":"150_CR38","doi-asserted-by":"crossref","unstructured":"Gottlieb J, Paulmann L (1998) Genetic algorithms for the fixed charge transportation problem. In: Inn IC(Ed), IEEE World Congress on evolutionary computation (I.\u00a0C. INN, ed.), pp 330\u2013335","DOI":"10.1109\/ICEC.1998.699754"},{"key":"150_CR39","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1016\/j.cie.2007.06.022","volume":"53","author":"JB Jo","year":"2007","unstructured":"Jo JB, Yinzhen L, Gen M (2007) Nonlinear fixed charge transportation problem by spanning tree-based genetic algorithm. Comput Ind Eng 53:290\u2013298","journal-title":"Comput Ind Eng"},{"key":"150_CR40","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1016\/j.ijpe.2007.01.017","volume":"113","author":"H Min","year":"2008","unstructured":"Min H, Ko H (2008) The dynamic design of a reverse logistics network from the perspective of third-party logistics service providers. Int J Prod Econ 113:176\u2013192","journal-title":"Int J Prod Econ"},{"key":"150_CR41","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1016\/j.cor.2009.06.001","volume":"37","author":"H Wang","year":"2010","unstructured":"Wang H, Hsu H (2010) A closed-loop logistic model with a spanning- tree based genetic algorithm. Comput Oper Res 37:376\u2013389","journal-title":"Comput Oper Res"},{"issue":"3","key":"150_CR42","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1109\/4235.661548","volume":"1","author":"B Dengiz","year":"1997","unstructured":"Dengiz B, Altiparmak F, Smith AE (1997) Local search genetic algorithm for optimal design of reliable networks. IEEE Trans Evol Comput 1(3):179\u2013188","journal-title":"IEEE Trans Evol Comput"},{"issue":"5","key":"150_CR43","doi-asserted-by":"crossref","first-page":"975","DOI":"10.1007\/BF01009452","volume":"34","author":"S Krikpatrick","year":"1984","unstructured":"Krikpatrick S (1984) Optimizing by simulated annealing: quantitative studies. J Stat Phys 34(5):975\u2013986","journal-title":"J Stat Phys"},{"issue":"1","key":"150_CR44","doi-asserted-by":"crossref","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":"Int J Adv Manuf Technol"},{"key":"150_CR45","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1016\/S0377-2217(02)00153-4","volume":"144","author":"V Jayaraman","year":"2003","unstructured":"Jayaraman V, Ross A (2003) A simulated annealing mathodology to distribution network design and management. Eur J Oper Res 144:629\u2013645","journal-title":"Eur J Oper Res"},{"key":"150_CR46","doi-asserted-by":"crossref","first-page":"1283","DOI":"10.1057\/palgrave.jors.2601645","volume":"54","author":"C Sung","year":"2003","unstructured":"Sung C, Song S (2003) Integrated service network design for a cross-docking supply chain network. J Oper Res Soc 54:1283\u20131295","journal-title":"J Oper Res Soc"},{"key":"150_CR47","first-page":"131","volume":"19","author":"P Moscato","year":"2003","unstructured":"Moscato P, Cotta C (2003) An introduction to memetic algorithms. Inteligencia Artificial, Revista Iberoamericana de Inteligencia Artificial 19:131\u2013148","journal-title":"Inteligencia Artificial, Revista Iberoamericana de Inteligencia Artificial"},{"key":"150_CR48","doi-asserted-by":"crossref","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"},{"key":"150_CR49","volume-title":"Direct representation and variation operators for the fixed charge transportation problem, in parallel problem solving from nature","author":"C Eckert","year":"2002","unstructured":"Eckert C, Gottlieb J (2002) Direct representation and variation operators for the fixed charge transportation problem, in parallel problem solving from nature. Springer, Berlin"},{"key":"150_CR50","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 7th IFAC conference on Management and Control of Production and Logistics, (Accepted)","DOI":"10.1016\/j.ifacol.2016.03.014"},{"key":"150_CR51","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1287\/ijoc.3.4.307","volume":"3","author":"Z Michalewicz","year":"1991","unstructured":"Michalewicz Z, Vignaux G, Hobbs M (1991) A non-standard genetic algorithm for the transportation problem. ORSA J Comput 3:307\u2013316","journal-title":"ORSA J Comput"},{"key":"150_CR52","volume-title":"Genetic algorithms and engineering design","author":"M Gen","year":"1997","unstructured":"Gen M, Cheng R (1997) Genetic algorithms and engineering design. Wiley, New york"},{"key":"150_CR53","volume-title":"Network model and optimization: multiobjective genetic algorithm approach","author":"M Gen","year":"2008","unstructured":"Gen M, Cheng R, Lin L (2008) Network model and optimization: multiobjective genetic algorithm approach. Springer, Berlin"},{"key":"150_CR54","unstructured":"Abuali F, Wainwright R, Schoenefeld D (1995) Determinant factorization: a new encoding scheme for spanning trees applied to the probabilistics minimum spanning tree problem. In Eshelman L (ed), Proceedings of the 6th international conference on genetic algorithms, pp 470\u2013477"},{"key":"150_CR55","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"}],"container-title":["Logistics Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12159-016-0150-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12159-016-0150-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12159-016-0150-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T20:32:51Z","timestamp":1757104371000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12159-016-0150-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,7]]},"references-count":55,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,12]]}},"alternative-id":["150"],"URL":"https:\/\/doi.org\/10.1007\/s12159-016-0150-y","relation":{},"ISSN":["1865-035X","1865-0368"],"issn-type":[{"value":"1865-035X","type":"print"},{"value":"1865-0368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,11,7]]},"article-number":"22"}}