{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T14:54:37Z","timestamp":1775141677559,"version":"3.50.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,5,19]],"date-time":"2020-05-19T00:00:00Z","timestamp":1589846400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,5,19]],"date-time":"2020-05-19T00:00:00Z","timestamp":1589846400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61273210"],"award-info":[{"award-number":["61273210"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010225","name":"National Outstanding Youth Foundation of China","doi-asserted-by":"publisher","award":["61802428"],"award-info":[{"award-number":["61802428"]}],"id":[{"id":"10.13039\/501100010225","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012165","name":"Key Technologies Research and Development Program","doi-asserted-by":"publisher","award":["2018YFC0806900"],"award-info":[{"award-number":["2018YFC0806900"]}],"id":[{"id":"10.13039\/501100012165","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012165","name":"Key Technologies Research and Development Program","doi-asserted-by":"publisher","award":["2016YFC0800606"],"award-info":[{"award-number":["2016YFC0800606"]}],"id":[{"id":"10.13039\/501100012165","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012165","name":"Key Technologies Research and Development Program","doi-asserted-by":"publisher","award":["2016YFC0800310"],"award-info":[{"award-number":["2016YFC0800310"]}],"id":[{"id":"10.13039\/501100012165","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004608","name":"Natural Science Foundation of Jiangsu Province","doi-asserted-by":"crossref","award":["BK20161469"],"award-info":[{"award-number":["BK20161469"]}],"id":[{"id":"10.13039\/501100004608","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Primary Research&Development Plan of Jiangsu Province","award":["BE2016904"],"award-info":[{"award-number":["BE2016904"]}]},{"name":"Primary Research&Development Plan of Jiangsu Province","award":["BE2017616"],"award-info":[{"award-number":["BE2017616"]}]},{"name":"Primary Research&Development Plan of Jiangsu Province","award":["BE2018754"],"award-info":[{"award-number":["BE2018754"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1007\/s12351-020-00570-w","type":"journal-article","created":{"date-parts":[[2020,5,19]],"date-time":"2020-05-19T11:01:16Z","timestamp":1589886076000},"page":"1103-1126","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Heuristic column generation for designing an express circular packaging distribution network"],"prefix":"10.1007","volume":"22","author":[{"given":"RuiYang","family":"Li","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9010-9373","authenticated-orcid":false,"given":"Ming","family":"He","sequence":"additional","affiliation":[]},{"given":"HongYue","family":"He","sequence":"additional","affiliation":[]},{"given":"QiaoYu","family":"Deng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,5,19]]},"reference":[{"key":"570_CR1","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1016\/j.jmsy.2015.02.006","volume":"37","author":"A Alshamsi","year":"2015","unstructured":"Alshamsi A, Diabat A (2015) A reverse logistics network design. J Manuf Syst 37:589\u2013598","journal-title":"J Manuf Syst"},{"issue":"1","key":"570_CR2","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, Saldanha-da-Gama F, Verter V (2012) Multi-period reverse logistics network design. Eur J Oper Res 220(1):67\u201378","journal-title":"Eur J Oper Res"},{"key":"570_CR3","unstructured":"Ammons JC, Realff MJ, Newton D (1997) Reverse production system design and operation for carpet recycling. Georgia Institute of Technology, Atlanta. Technical Report"},{"key":"570_CR4","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/j.resconrec.2015.07.006","volume":"104","author":"B Ayvaz","year":"2015","unstructured":"Ayvaz B, Bolat B, Aydin N (2015) Stochastic reverse logistics network design for waste of electrical and electronic equipment. Resour Conserv Recycl 104:391\u2013404","journal-title":"Resour Conserv Recycl"},{"issue":"3","key":"570_CR5","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1016\/j.ejor.2006.02.019","volume":"178","author":"N Azi","year":"2007","unstructured":"Azi N, Gendreau M, Potvin JY (2007) An exact algorithm for a single-vehicle routing problem with time windows and multiple routes. Eur J Oper Res 178(3):755\u2013766","journal-title":"Eur J Oper Res"},{"key":"570_CR6","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.trb.2015.06.002","volume":"79","author":"R Bai","year":"2015","unstructured":"Bai R, Xue N, Chen J, Roberts GW (2015) A set-covering model for a bidirectional multi-shift full truckload vehicle routing problem. Transp Res B Methodol 79:134\u2013148","journal-title":"Transp Res B Methodol"},{"issue":"6","key":"570_CR7","doi-asserted-by":"publisher","first-page":"954","DOI":"10.1016\/j.cor.2010.10.011","volume":"38","author":"SR Balseiro","year":"2011","unstructured":"Balseiro SR, Loiseau I, Ramonet J (2011) An ant colony algorithm hybridized with insertion heuristics for the time dependent vehicle routing problem with time windows. Comput Oper Res 38(6):954\u2013966","journal-title":"Comput Oper Res"},{"issue":"1","key":"570_CR8","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1287\/opre.33.1.49","volume":"33","author":"JE Beasley","year":"1985","unstructured":"Beasley JE (1985) An exact two-dimensional non-guillotine cutting tree search procedure. Oper Res 33(1):49\u201364","journal-title":"Oper Res"},{"key":"570_CR9","doi-asserted-by":"publisher","DOI":"10.1515\/9781400831050","volume-title":"Robust optimization","author":"A Ben-Tal","year":"2009","unstructured":"Ben-Tal A, El Ghaoui L, Nemirovski A (2009) Robust optimization, vol 28. Princeton University Press, Princeton"},{"issue":"1","key":"570_CR10","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1287\/opre.1030.0065","volume":"52","author":"D Bertsimas","year":"2004","unstructured":"Bertsimas D, Sim M (2004) The price of robustness. Oper Res 52(1):35\u201353","journal-title":"Oper Res"},{"issue":"1","key":"570_CR11","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s00291-005-0003-6","volume":"28","author":"IL Blanc","year":"2006","unstructured":"Blanc IL, van Krieken M, Krikke H, Fleuren H (2006) Vehicle routing concepts in the closed-loop container network of ARN\u2014a case study. OR Spectrum 28(1):53\u201371","journal-title":"OR Spectrum"},{"issue":"1","key":"570_CR12","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/j.ejor.2018.05.055","volume":"272","author":"T Capelle","year":"2019","unstructured":"Capelle T, Cort\u00e9s CE, Gendreau M, Rey PA, Rousseau LM (2019) A column generation approach for location-routing problems with pickup and delivery. Eur J Oper Res 272(1):121\u2013131","journal-title":"Eur J Oper Res"},{"issue":"8","key":"570_CR13","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1016\/S0305-0548(00)00009-5","volume":"28","author":"Y Chan","year":"2001","unstructured":"Chan Y, Carter WB, Burnes MD (2001) A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands. Comput Oper Res 28(8):803\u2013826","journal-title":"Comput Oper Res"},{"issue":"3","key":"570_CR14","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/s12351-015-0213-x","volume":"16","author":"C Fang","year":"2016","unstructured":"Fang C, Liu X, Pei J, Fan W, Pardalos PM (2016) Optimal production planning in a hybrid manufacturing and recovering system based on the internet of things with closed loop supply chains. Oper Res Int J 16(3):543\u2013577","journal-title":"Oper Res Int J"},{"issue":"3","key":"570_CR15","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1002\/net.20033","volume":"44","author":"D Feillet","year":"2004","unstructured":"Feillet D, Dejax P, Gendreau M, Gueguen C (2004) An exact algorithm for the elementary shortest path problem with resource constraints: application to some vehicle routing problems. Networks 44(3):216\u2013229","journal-title":"Networks"},{"issue":"1","key":"570_CR16","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1111\/itor.12091","volume":"22","author":"WJ Guerrero","year":"2015","unstructured":"Guerrero WJ, Prodhon C, Velasco N, Amaya CA (2015) A relax-and-price heuristic for the inventory-location-routing problem. Int Trans Oper Res 22(1):129\u2013148","journal-title":"Int Trans Oper Res"},{"key":"570_CR17","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1016\/j.cie.2017.02.002","volume":"106","author":"J Guo","year":"2017","unstructured":"Guo J, Wang X, Fan S, Gen M (2017) Forward and reverse logistics network and route planning under the environment of low-carbon emissions: a case study of Shanghai fresh food E-commerce enterprises. Comput Ind Eng 106:351\u2013360","journal-title":"Comput Ind Eng"},{"key":"570_CR18","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/j.apm.2017.09.053","volume":"54","author":"ST John","year":"2018","unstructured":"John ST, Sridharan R, Kumar PN, Krishnamoorthy M (2018) Multi-period reverse logistics network design for used refrigerators. Appl Math Model 54:311\u2013331","journal-title":"Appl Math Model"},{"issue":"2","key":"570_CR19","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1016\/j.ijpe.2016.04.026","volume":"183","author":"VNSA Kumar","year":"2017","unstructured":"Kumar VNSA, Kumar V, Brady M, Simpson M (2017) Resolving forward-reverse logistics multi-period model: an artificial immune system algorithm based approach. Int J Prod Econ 183(2):458\u2013469","journal-title":"Int J Prod Econ"},{"issue":"1","key":"570_CR20","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1287\/trsc.2014.0582","volume":"50","author":"L Lozano","year":"2015","unstructured":"Lozano L, Duque D, Medaglia AL (2015) An exact algorithm for the elementary shortest path problem with resource constraints. Transp Sci 50(1):348\u2013357","journal-title":"Transp Sci"},{"key":"570_CR21","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/j.asoc.2017.10.027","volume":"68","author":"H Ma","year":"2017","unstructured":"Ma H, Li X (2017) Closed-loop supply chain network design for hazardous products with uncertain demands and returns. Appl Soft Comput 68:889\u2013899","journal-title":"Appl Soft Comput"},{"key":"570_CR22","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.tre.2015.07.005","volume":"82","author":"Q Meng","year":"2015","unstructured":"Meng Q, Hei X, Wang S, Mao H (2015a) Carrying capacity procurement of rail and shipping services for automobile delivery with uncertain demand. Transp Res E Logist Transp Rev 82:38\u201354","journal-title":"Transp Res E Logist Transp Rev"},{"key":"570_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.trb.2014.11.008","volume":"72","author":"Q Meng","year":"2015","unstructured":"Meng Q, Wang S, Lee CY (2015b) A tailored branch-and-price approach for a joint tramp ship routing and bunkering problem. Transp Res B Methodol 72:1\u201319","journal-title":"Transp Res B Methodol"},{"issue":"5","key":"570_CR24","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1016\/0305-0483(89)90044-3","volume":"17","author":"H Min","year":"1989","unstructured":"Min H (1989) A bicriterion reverse distribution model for product recall. Omega-Int J Manag Sci 17(5):483\u2013490","journal-title":"Omega-Int J Manag Sci"},{"issue":"1","key":"570_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tre.2003.12.001","volume":"41","author":"A Nagurney","year":"2005","unstructured":"Nagurney A, Toyasaki F (2005) Reverse supply chain management and electronic waste recycling: a multitiered network equilibrium framework for e-cycling. Transp Res E Logist Transp Rev 41(1):1\u201328","journal-title":"Transp Res E Logist Transp Rev"},{"issue":"3","key":"570_CR26","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/j.omega.2006.04.014","volume":"36","author":"RK Pati","year":"2008","unstructured":"Pati RK, Vrat P, Kumar P (2008) A goal programming model for paper recycling system. Omega-Int J Manag Sci 36(3):405\u2013417","journal-title":"Omega-Int J Manag Sci"},{"issue":"3","key":"570_CR27","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1002\/net.20212","volume":"51","author":"G Righini","year":"2008","unstructured":"Righini G, Salani M (2008) New dynamic programming algorithms for the resource constrained elementary shortest path problem. Networks 51(3):155\u2013170","journal-title":"Networks"},{"key":"570_CR28","unstructured":"Salomon M, Thierry M, van Nunen J, Van Wassenhove L (1996) Distribution logistics and return flow optimization. Management Report Series, 254"},{"key":"570_CR29","doi-asserted-by":"crossref","unstructured":"Schleiffer R, Wollenweber J, Sebastian HJ, Golm F, Kapoustina N (2004) Application of genetic algorithms for the design of large-scale reverse logistic networks in Europe\u2019s automotive industry. In: Proceedings of the 37th annual Hawaii international conference on system sciences, 2004. IEEE","DOI":"10.1109\/HICSS.2004.1265246"},{"key":"570_CR30","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.trb.2020.02.011","volume":"135","author":"W Shan","year":"2020","unstructured":"Shan W, Peng Z, Liu J, Yao B, Yu B (2020) An exact algorithm for inland container transportation network design. Transp Res B Methodol 135:41\u201382","journal-title":"Transp Res B Methodol"},{"key":"570_CR31","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.resconrec.2017.09.011","volume":"128","author":"J Trochu","year":"2018","unstructured":"Trochu J, Chaabane A, Ouhimmou M (2018) Reverse logistics network redesign under uncertainty for wood waste in the CRD industry. Resour Conserv Recycl 128:32\u201347","journal-title":"Resour Conserv Recycl"},{"key":"570_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.resconrec.2011.09.013","volume":"57","author":"M Vidovic","year":"2011","unstructured":"Vidovic M, Dimitrijevic B, Ratkovic B, Simic V (2011) A novel covering approach to positioning ELV collection points. Resour Conserv Recycl 57:1\u20139","journal-title":"Resour Conserv Recycl"},{"issue":"1","key":"570_CR33","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s12351-015-0218-5","volume":"17","author":"EE Zachariadis","year":"2017","unstructured":"Zachariadis EE, Tarantilis CD, Kiranoudis CT (2017) Vehicle routing strategies for pick-up and delivery service under two dimensional loading constraints. Oper Res Int Journal 17(1):115\u2013143","journal-title":"Oper Res Int Journal"},{"issue":"2","key":"570_CR34","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1016\/j.ejor.2013.07.005","volume":"235","author":"E Zehendner","year":"2014","unstructured":"Zehendner E, Feillet D (2014) Benefits of a truck appointment system on the service quality of inland transport modes at a multimodal container terminal. Eur J Oper Res 235(2):461\u2013469","journal-title":"Eur J Oper Res"},{"issue":"1","key":"570_CR35","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.ejor.2017.07.063","volume":"265","author":"L Zhen","year":"2018","unstructured":"Zhen L, Wang K, Wang S, Qu X (2018) Tug scheduling for hinterland barge transport: a branch-and-price approach. Eur J Oper Res 265(1):119\u2013132","journal-title":"Eur J Oper Res"},{"issue":"2","key":"570_CR36","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/s12351-016-0273-6","volume":"18","author":"Y Zheng","year":"2018","unstructured":"Zheng Y, Shu T, Wang S, Chen S, Lai KK, Gan L (2018) Analysis of product return rate and price competition in two supply chains. Oper Res Int J 18(2):469\u2013496","journal-title":"Oper Res Int J"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-020-00570-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12351-020-00570-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-020-00570-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,16]],"date-time":"2022-03-16T05:04:29Z","timestamp":1647407069000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12351-020-00570-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,19]]},"references-count":36,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["570"],"URL":"https:\/\/doi.org\/10.1007\/s12351-020-00570-w","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,5,19]]},"assertion":[{"value":"4 June 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 April 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 May 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 May 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}