{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T14:28:04Z","timestamp":1770906484608,"version":"3.50.1"},"reference-count":39,"publisher":"EDP Sciences","issue":"3","license":[{"start":{"date-parts":[[2021,6,17]],"date-time":"2021-06-17T00:00:00Z","timestamp":1623888000000},"content-version":"vor","delay-in-days":47,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2021,4,20]]},"published-print":{"date-parts":[[2021,5]]},"abstract":"<jats:p>Designing the supply chain network is one of the significant areas in e-commerce business management. This concept plays a crucial role in e-commerce systems. For example, location-inventory-pricing-routing of an e-commerce supply chain is considered a crucial issue in this field. This field established many severe challenges in the modern world, like maintaining the supply chain for returned items, preserving customers\u2019 trust and satisfaction, and developing an applicable supply chain with cost considerations. The research proposes a multi-objective mixed integer nonlinear programming model to design a closed-loop supply chain network based on the e-commerce context. The proposed model incorporates two objectives that optimize the business\u2019s total profits and the customers\u2019 satisfaction. Then, numerous numerical examples are generated and solved using the epsilon constraint method in GAMS optimization software. The validation of the given model has been tested for the large problems via a hybrid two-level non-dominated sort genetic algorithm. Finally, some sensitivity analysis has been performed to provide some managerial insights.<\/jats:p>","DOI":"10.1051\/ro\/2021068","type":"journal-article","created":{"date-parts":[[2021,4,22]],"date-time":"2021-04-22T07:58:18Z","timestamp":1619078298000},"page":"1643-1674","source":"Crossref","is-referenced-by-count":20,"title":["A hybrid NSGA-II algorithm for the closed-loop supply chain network design in e-commerce"],"prefix":"10.1051","volume":"55","author":[{"given":"Shayan","family":"Shafiee Moghadam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0175-2979","authenticated-orcid":false,"given":"Amir","family":"Aghsami","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masoud","family":"Rabbani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2021,6,17]]},"reference":[{"key":"R1","unstructured":"AIMMS B., AIMMS Modeling Guide-Integer Programming Tricks. In: Pinedo Michael. Scheduling: theory, algorithms, and systems. Haarlem, The Netherlands: AIMMS BV. Springer. Retrieved from https:\/\/download.aimms.com\/aimms\/download\/manuals\/AIMMS3OM_IntegerProgrammingTricks.pdf (2016)."},{"key":"R2","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/j.eswa.2018.03.029","volume":"104","author":"Alamdar","year":"2018","journal-title":"Expert Syst. Appl."},{"key":"R3","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1016\/j.ejor.2020.11.016","volume":"292","author":"Audet","year":"2020","journal-title":"Eur. J. Oper. Res."},{"key":"R4","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.eswa.2017.09.041","volume":"92","author":"Babbar","year":"2018","journal-title":"Expert Syst. Appl."},{"key":"R5","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1109\/TEVC.2013.2281535","volume":"18","author":"Deb","year":"2013","journal-title":"IEEE Trans. Evol. Comput."},{"key":"R6","doi-asserted-by":"crossref","unstructured":"Deb K., Agrawal S., Pratap A., Meyarivan T. and Fast A., A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimization: NSGA-II. Int.Conf. Parallel Prob. Solving Nat. (pp. 849\u2013858). Springer: Berlin, Heidelberg (2000).","DOI":"10.1007\/3-540-45356-3_83"},{"key":"R7","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"Deb","year":"2002","journal-title":"IEEE Trans. Evol. Comput."},{"key":"R8","first-page":"12","volume":"2016","author":"Deng","year":"2016","journal-title":"Discrete Dyn. Nat. Soc."},{"key":"R9","doi-asserted-by":"crossref","first-page":"963","DOI":"10.1051\/ro\/2019018","volume":"53","author":"Fakhrzad","year":"2019","journal-title":"RAIRO-Operations Research"},{"key":"R10","doi-asserted-by":"crossref","first-page":"1441","DOI":"10.24200\/sci.2016.3909","volume":"23","author":"Forouzanfar","year":"2016","journal-title":"Sci. Iranica."},{"key":"R11","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1016\/j.eswa.2018.09.027","volume":"116","author":"Ghahremani-Nahr","year":"2019","journal-title":"Expert Syst. Appl."},{"key":"R12","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/j.jmsy.2014.06.009","volume":"36","author":"Ghodratnama","year":"2015","journal-title":"J. Manuf. Syst."},{"key":"R13","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/j.cie.2019.01.035","volume":"129","author":"Giri","year":"2019","journal-title":"Comput. Ind. Eng."},{"key":"R14","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1016\/j.ejor.2014.07.012","volume":"240","author":"Govindan","year":"2015","journal-title":"Eur. J. Oper. Res."},{"key":"R15","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/j.trd.2017.03.008","volume":"52","author":"Heydari","year":"2017","journal-title":"Transp. Res. D: Transp. Environ."},{"key":"R16","unstructured":"Hosseini S., TechShamim. Retrieved from: https:\/\/medium.com\/techshamim\/e-commerce-business-market-trends-2020-f5429ac6d29e (2019)."},{"key":"R17","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1016\/j.ijpe.2016.06.024","volume":"183","author":"Iassinovskaia","year":"2017","journal-title":"Int. J. Prod. Econ."},{"key":"R18","doi-asserted-by":"crossref","first-page":"2252","DOI":"10.1016\/j.jclepro.2016.11.051","volume":"142","author":"Jafari","year":"2017","journal-title":"J. Cleaner Prod."},{"key":"R19","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1051\/ro\/2012016","volume":"3","author":"Liu","year":"2012","journal-title":"RAIRO-Operations Research-Recherche Op\u00e9rationnelle"},{"key":"R20","first-page":"372","volume":"2015","author":"Liu","year":"2015","journal-title":"Discrete Dyn. Nat. Soc."},{"key":"R21","doi-asserted-by":"crossref","first-page":"113068","DOI":"10.1016\/j.eswa.2019.113068","volume":"144","author":"Mamaghani","year":"2020","journal-title":"Exp. Syst. Appl."},{"key":"R22","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/s00158-003-0368-6","volume":"26","author":"Marler","year":"2004","journal-title":"Structural and multidisciplinary optimization"},{"key":"R23","doi-asserted-by":"crossref","first-page":"118452","DOI":"10.1016\/j.jclepro.2019.118452","volume":"242","author":"Mohtashami","year":"2020","journal-title":"J. Cleaner Prod."},{"key":"R24","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/j.tre.2013.11.001","volume":"61","author":"\u00d6zceylan","year":"2014","journal-title":"Transp. Res. E: Logistics Transp. Rev."},{"key":"R25","doi-asserted-by":"crossref","first-page":"1100","DOI":"10.1016\/j.cor.2009.09.018","volume":"6","author":"Pishvaee","year":"2010","journal-title":"Comput. Oper. Res."},{"key":"R26","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1016\/j.apm.2010.07.013","volume":"35","author":"Pishvaee","year":"2011","journal-title":"Appl. Math. Model."},{"key":"R27","doi-asserted-by":"crossref","first-page":"825","DOI":"10.1007\/s00170-012-4369-8","volume":"66","author":"Ramezani","year":"2013","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"R28","doi-asserted-by":"crossref","first-page":"1505","DOI":"10.1007\/s00170-013-5352-8","volume":"70","author":"Sadjadi","year":"2014","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"R29","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1287\/mnsc.1030.0186","volume":"50","author":"Savaskan","year":"2004","journal-title":"Manage. Sci."},{"key":"R30","doi-asserted-by":"crossref","first-page":"1179","DOI":"10.1111\/j.1752-1688.2006.tb05605.x","volume":"42","author":"Shiau","year":"2006","journal-title":"JAWRA J. Am. Water Resour. Assoc."},{"key":"R31","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1162\/evco.1994.2.3.221","volume":"2","author":"Srinivas","year":"1994","journal-title":"Evol. Comput."},{"key":"R32","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S0167-9236(97)00028-6","volume":"21","author":"Strader","year":"1997","journal-title":"Decis. Support Syst."},{"key":"R33","first-page":"346","volume":"31","author":"Tavakkoli-Moghaddam","year":"2018","journal-title":"Int. J. Eng."},{"key":"R34","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1016\/j.future.2018.06.008","volume":"88","author":"Yi","year":"2018","journal-title":"Future Gener. Comput. Syst."},{"key":"R35","doi-asserted-by":"crossref","unstructured":"Yuan Y., Xu H. and Wang B., An improved NSGA-III procedure for evolutionary many-objective optimization. In: Proceedings of the 2014 annual conference on genetic and evolutionary computation (2014) 661\u2013668.","DOI":"10.1145\/2576768.2598342"},{"key":"R36","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1016\/j.tre.2016.02.011","volume":"89","author":"Zhalechian","year":"2016","journal-title":"Transp. Res. E: Logistics and Transp. Rev."},{"key":"R37","doi-asserted-by":"crossref","first-page":"5485","DOI":"10.1080\/00207543.2017.1322731","volume":"55","author":"Zhang","year":"2017","journal-title":"Int. J. Prod. Research."},{"key":"R38","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/j.swevo.2011.03.001","volume":"1","author":"Zhou","year":"2011","journal-title":"Swarm Evol. Comput."},{"key":"R39","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1016\/j.jclepro.2016.05.091","volume":"133","author":"Zohal","year":"2016","journal-title":"J. Cleaner Prod."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2021068\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,17]],"date-time":"2021-06-17T08:28:12Z","timestamp":1623918492000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2021068"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5]]},"references-count":39,"journal-issue":{"issue":"3"},"alternative-id":["ro200482"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2021068","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5]]}}}