{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T20:22:51Z","timestamp":1777753371470,"version":"3.51.4"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,9,18]],"date-time":"2018-09-18T00:00:00Z","timestamp":1537228800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,9,18]],"date-time":"2018-09-18T00:00:00Z","timestamp":1537228800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1007\/s12351-018-0425-y","type":"journal-article","created":{"date-parts":[[2018,9,18]],"date-time":"2018-09-18T14:42:40Z","timestamp":1537281760000},"page":"2497-2517","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["A graph theory-based algorithm for a multi-echelon multi-period responsive supply chain network design with lateral-transshipments"],"prefix":"10.1007","volume":"20","author":[{"given":"Masoud","family":"Rabbani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali","family":"Sabbaghnia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mahdi","family":"Mobini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jafar","family":"Razmi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,18]]},"reference":[{"key":"425_CR1","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.jclepro.2016.07.045","volume":"137","author":"S Agrawal","year":"2016","unstructured":"Agrawal S et al (2016) Disposition decisions in reverse logistics: graph theory and matrix approach. J Clean Prod 137:93\u2013104","journal-title":"J Clean Prod"},{"key":"425_CR2","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1016\/j.cie.2007.05.012","volume":"56","author":"F Altiparmak","year":"2009","unstructured":"Altiparmak F et al (2009) A steady-state genetic algorithm for multi-product supply chain network design. Comput Ind Eng 56:521\u2013537","journal-title":"Comput Ind Eng"},{"key":"425_CR3","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.1016\/j.cor.2012.11.005","volume":"40","author":"H Badri","year":"2013","unstructured":"Badri H et al (2013) Integrated strategic and tactical planning in a supply chain network design with a heuristic solution method. Comput Oper Res 40:1143\u20131154","journal-title":"Comput Oper Res"},{"key":"425_CR4","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.eswa.2015.10.036","volume":"47","author":"N Chibeles-Martins","year":"2016","unstructured":"Chibeles-Martins N et al (2016) A multi-objective meta-heuristic approach for the design and planning of green supply chains\u2014MBSA. Expert Syst Appl 47:71\u201384","journal-title":"Expert Syst Appl"},{"key":"425_CR5","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-8349-9320-5_22","volume-title":"Supply chain management. Strategy, planning & operation, Das summa summarum des management","author":"S Chopra","year":"2007","unstructured":"Chopra S, Meindl P (2007) Supply chain management. Strategy, planning & operation, Das summa summarum des management. Springer, Berlin, pp 265\u2013275"},{"key":"425_CR6","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.jclepro.2015.02.063","volume":"110","author":"S Coskun","year":"2016","unstructured":"Coskun S et al (2016) A model proposal for green supply chain network design based on consumer segmentation. J Clean Prod 110:149\u2013157","journal-title":"J Clean Prod"},{"key":"425_CR7","doi-asserted-by":"publisher","first-page":"746","DOI":"10.1016\/j.cie.2017.07.017","volume":"113","author":"Farias E da Silveira","year":"2017","unstructured":"da Silveira Farias E et al (2017) Simple heuristic for the strategic supply chain design of large-scale networks: a Brazilian case study. Comput Ind Eng 113:746\u2013756","journal-title":"Comput Ind Eng"},{"key":"425_CR8","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1016\/j.ejor.2013.12.032","volume":"235","author":"K Devika","year":"2014","unstructured":"Devika K et al (2014) Designing a sustainable closed-loop supply chain network based on triple bottom line approach: a comparison of metaheuristics hybridization techniques. Eur J Oper Res 235:594\u2013615","journal-title":"Eur J Oper Res"},{"key":"425_CR9","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.omega.2015.01.006","volume":"54","author":"M Eskandarpour","year":"2015","unstructured":"Eskandarpour M et al (2015) Sustainable supply chain network design: an optimization-oriented review. Omega 54:11\u201332","journal-title":"Omega"},{"key":"425_CR10","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.cor.2016.11.012","volume":"80","author":"M Eskandarpour","year":"2017","unstructured":"Eskandarpour M et al (2017) A large neighborhood search heuristic for supply chain network design. Comput Oper Res 80:23\u201337","journal-title":"Comput Oper Res"},{"key":"425_CR11","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.omega.2013.08.006","volume":"45","author":"RZ Farahani","year":"2014","unstructured":"Farahani RZ et al (2014) Competitive supply chain network design: an overview of classifications, models, solution techniques and applications. Omega 45:92\u2013118","journal-title":"Omega"},{"key":"425_CR12","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1016\/j.indcrop.2016.09.027","volume":"94","author":"H Ghaderi","year":"2016","unstructured":"Ghaderi H et al (2016) Biomass supply chain network design: an optimization-oriented review and analysis. Ind Crops Prod 94:972\u20131000","journal-title":"Ind Crops Prod"},{"key":"425_CR13","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.ijpe.2013.12.028","volume":"152","author":"K Govindan","year":"2014","unstructured":"Govindan K et al (2014) Two-echelon multiple-vehicle location\u2013routing problem with time windows for optimization of sustainable supply chain network of perishable food. Int J Prod Econ 152:9\u201328","journal-title":"Int J Prod Econ"},{"key":"425_CR14","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1016\/j.cor.2014.12.014","volume":"62","author":"K Govindan","year":"2015","unstructured":"Govindan K et al (2015) Bi-objective integrating sustainable order allocation and sustainable supply chain network strategic design with stochastic demand using a novel robust hybrid multi-objective metaheuristic. Comput Oper Res 62:112\u2013130","journal-title":"Comput Oper Res"},{"key":"425_CR15","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1287\/mnsc.47.4.579.9826","volume":"47","author":"J Grahovac","year":"2001","unstructured":"Grahovac J, Chakravarty A (2001) Sharing and lateral transshipment of inventory in a supply chain with expensive low-demand items. Manage Sci 47:579\u2013594","journal-title":"Manage Sci"},{"key":"425_CR16","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.tre.2015.12.009","volume":"87","author":"A Hasani","year":"2016","unstructured":"Hasani A, Khosrojerdi A (2016) Robust global supply chain network design under disruption and uncertainty considering resilience strategies: a parallel memetic algorithm for a real-life case study. Transp Res Part E Logist Transp Rev 87:20\u201352","journal-title":"Transp Res Part E Logist Transp Rev"},{"key":"425_CR17","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.cor.2015.07.005","volume":"65","author":"O Kaya","year":"2016","unstructured":"Kaya O, Urek B (2016) A mixed integer nonlinear programming model and heuristic solutions for location, inventory and pricing decisions in a closed loop supply chain. Comput Oper Res 65:93\u2013103","journal-title":"Comput Oper Res"},{"key":"425_CR18","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/j.ejor.2009.06.011","volume":"203","author":"W Klibi","year":"2010","unstructured":"Klibi W et al (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":"425_CR19","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/0377-2217(83)90181-9","volume":"12","author":"J Krarup","year":"1983","unstructured":"Krarup J, Pruzan PM (1983) The simple plant location problem: survey and synthesis. Eur J Oper Res 12:36\u201381","journal-title":"Eur J Oper Res"},{"key":"425_CR20","doi-asserted-by":"publisher","first-page":"3094","DOI":"10.1016\/j.eswa.2009.09.020","volume":"37","author":"YH Lee","year":"2010","unstructured":"Lee YH, Kwon SG (2010) The hybrid planning algorithm for the distribution center operation using tabu search and decomposed optimization. Expert Syst Appl 37:3094\u20133103","journal-title":"Expert Syst Appl"},{"key":"425_CR21","doi-asserted-by":"publisher","first-page":"2538","DOI":"10.1016\/j.matpr.2015.07.199","volume":"2","author":"S Malik","year":"2015","unstructured":"Malik S et al (2015) Selection of locations of collection centers for reverse logistics using GTMA. Mater Today Proc 2:2538\u20132547","journal-title":"Mater Today Proc"},{"key":"425_CR22","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1016\/j.tre.2014.10.008","volume":"72","author":"I Mallidis","year":"2014","unstructured":"Mallidis I et al (2014) Design and planning for green global supply chains under periodic review replenishment policies. Transp Res Part E Logist Transp Rev 72:210\u2013235","journal-title":"Transp Res Part E Logist Transp Rev"},{"key":"425_CR23","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1287\/ijoc.3.4.307","volume":"3","author":"Z Michalewicz","year":"1991","unstructured":"Michalewicz Z et al (1991) A nonstandard genetic algorithm for the nonlinear transportation problem. ORSA J Comput 3:307\u2013316","journal-title":"ORSA J Comput"},{"key":"425_CR24","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1016\/j.proeng.2012.09.536","volume":"48","author":"V Modrak","year":"2012","unstructured":"Modrak V, Marton D (2012) Modelling and complexity assessment of assembly supply chain systems. Procedia Eng 48:428\u2013435","journal-title":"Procedia Eng"},{"key":"425_CR25","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1016\/j.ejor.2014.10.015","volume":"242","author":"F Olsson","year":"2015","unstructured":"Olsson F (2015) Emergency lateral transshipments in a two-location inventory system with positive transshipment leadtimes. Eur J Oper Res 242:424\u2013433","journal-title":"Eur J Oper Res"},{"key":"425_CR26","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.ejor.2010.05.048","volume":"210","author":"C Paterson","year":"2011","unstructured":"Paterson C et al (2011) Inventory models with lateral transshipments: a review. Eur J Oper Res 210:125\u2013136","journal-title":"Eur J Oper Res"},{"key":"425_CR27","doi-asserted-by":"publisher","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 heuristic algorithm for responsive supply chain network design with direct and indirect shipment. Adv Eng Softw 42:57\u201363","journal-title":"Adv Eng Softw"},{"key":"425_CR28","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1016\/j.ijpe.2013.04.003","volume":"144","author":"S Sabharwal","year":"2013","unstructured":"Sabharwal S, Garg S (2013) Determining cost effectiveness index of remanufacturing: a graph theoretic approach. Int J Prod Econ 144:521\u2013532","journal-title":"Int J Prod Econ"},{"key":"425_CR29","volume-title":"Bipartite graphs and problem solving","author":"J Salvatore","year":"2007","unstructured":"Salvatore J (2007) Bipartite graphs and problem solving. University of Chicago, Chicago"},{"key":"425_CR30","doi-asserted-by":"publisher","first-page":"1194","DOI":"10.1016\/j.jclepro.2016.09.103","volume":"141","author":"VK Sharma","year":"2017","unstructured":"Sharma VK et al (2017) Green supply chain management related performance indicators in agro industry: a review. J Clean Prod 141:1194\u20131208","journal-title":"J Clean Prod"},{"key":"425_CR31","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.advengsoft.2012.03.003","volume":"49","author":"J Shi","year":"2012","unstructured":"Shi J et al (2012) A Lagrangian based solution algorithm for a build-to-order supply chain network design problem. Adv Eng Softw 49:21\u201328","journal-title":"Adv Eng Softw"},{"key":"425_CR32","volume-title":"Designing and managing the supply chain: concepts, strategies, and cases","author":"D Simchi-Levi","year":"1999","unstructured":"Simchi-Levi D et al (1999) Designing and managing the supply chain: concepts, strategies, and cases. McGraw-Hill, New York"},{"key":"425_CR33","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.cie.2014.04.019","volume":"74","author":"U Soni","year":"2014","unstructured":"Soni U et al (2014) Measuring supply chain resilience using a deterministic modeling approach. Comput Ind Eng 74:11\u201325","journal-title":"Comput Ind Eng"},{"key":"425_CR34","doi-asserted-by":"publisher","first-page":"1789","DOI":"10.1016\/j.compchemeng.2004.02.028","volume":"28","author":"V Venkatasubramanian","year":"2004","unstructured":"Venkatasubramanian V et al (2004) Spontaneous emergence of complex optimal networks through evolutionary adaptation. Comput Chem Eng 28:1789\u20131798","journal-title":"Comput Chem Eng"},{"key":"425_CR35","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/j.ijpe.2009.10.007","volume":"126","author":"SM Wagner","year":"2010","unstructured":"Wagner SM, Neshat N (2010) Assessing the vulnerability of supply chains using graph theory. Int J Prod Econ 126:121\u2013129","journal-title":"Int J Prod Econ"},{"key":"425_CR36","first-page":"89","volume-title":"Graph-based framework for evaluating the feasibility of transition to maintainomics, information granularity, big data, and computational intelligence","author":"B Xing","year":"2015","unstructured":"Xing B (2015) Graph-based framework for evaluating the feasibility of transition to maintainomics, information granularity, big data, and computational intelligence. Springer, Berlin, pp 89\u2013119"},{"issue":"1\u20132","key":"425_CR37","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/s10479-017-2410-x","volume":"254","author":"X Zhang","year":"2017","unstructured":"Zhang X et al (2017) Physarum solver: a bio-inspired method for sustainable supply chain network design problem. Ann Oper Res 254(1\u20132):533\u2013552","journal-title":"Ann Oper Res"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-018-0425-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12351-018-0425-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-018-0425-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,9]],"date-time":"2020-10-09T18:41:04Z","timestamp":1602268864000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12351-018-0425-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,18]]},"references-count":37,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["425"],"URL":"https:\/\/doi.org\/10.1007\/s12351-018-0425-y","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,9,18]]},"assertion":[{"value":"16 June 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 November 2017","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 September 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 September 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}