{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T08:12:59Z","timestamp":1758874379071,"version":"3.37.3"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,11,4]],"date-time":"2020-11-04T00:00:00Z","timestamp":1604448000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,11,4]],"date-time":"2020-11-04T00:00:00Z","timestamp":1604448000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Evol. Intel."],"published-print":{"date-parts":[[2022,3]]},"DOI":"10.1007\/s12065-020-00516-3","type":"journal-article","created":{"date-parts":[[2020,11,4]],"date-time":"2020-11-04T14:02:50Z","timestamp":1604498570000},"page":"397-406","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Dynamic kidney paired exchange using modified multiverse optimization"],"prefix":"10.1007","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0705-7830","authenticated-orcid":false,"given":"Mouna","family":"Chellal","sequence":"first","affiliation":[]},{"given":"JianXin","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Ilyas","family":"Benmessahel","sequence":"additional","affiliation":[]},{"given":"Abdelaziz","family":"Galoul","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,11,4]]},"reference":[{"key":"516_CR1","doi-asserted-by":"crossref","unstructured":"Abraham DJ, Avrim B, Tuomas S (2007) Clearing algorithms for barter exchange markets: enabling nationwide kidney exchanges. In: Proceedings of the 8th ACM conference on electronic commerce. ACM, pp 295\u2013304","DOI":"10.1145\/1250910.1250954"},{"issue":"11","key":"516_CR2","doi-asserted-by":"publisher","first-page":"4026","DOI":"10.1257\/aer.20180771","volume":"109","author":"N Agarwal","year":"2019","unstructured":"Agarwal N, Ashlagi I, Azevedo E, Featherstone CR, Karaduman \u00d6 (2019) Market failure in kidney exchange. Am Econ Rev 109(11):4026\u201370","journal-title":"Am Econ Rev"},{"key":"516_CR3","doi-asserted-by":"crossref","unstructured":"Akbarpour M, Li S, Oveis GS (2014) Dynamic matching market design. arXiv:1402.3643","DOI":"10.2139\/ssrn.2394319"},{"key":"516_CR4","doi-asserted-by":"crossref","unstructured":"Anderson R, Ashlagi I, Gamarnik D, Kanoria Y (2015) A dynamic model of barter exchange. In: Proceedings of the twenty-sixth annual ACM-SIAM symposium on discrete algorithms. Society for Industrial and Applied Mathematics, pp 1925\u20131933","DOI":"10.1137\/1.9781611973730.129"},{"issue":"3","key":"516_CR5","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1073\/pnas.1421853112","volume":"112","author":"R Anderson","year":"2015","unstructured":"Anderson R, Ashlagi I, Gamarnik D, Roth AE (2015) Finding long chains in kidney exchange using the traveling salesman problem. Proc Natl Acad Sci 112(3):663\u2013668","journal-title":"Proc Natl Acad Sci"},{"key":"516_CR6","unstructured":"Andersson T (2015) Pairwise kidney exchange with blood-group incompatibility. Lund University Department of Economics working paper"},{"issue":"8","key":"516_CR7","doi-asserted-by":"publisher","first-page":"2315","DOI":"10.1007\/s10489-017-1085-y","volume":"48","author":"I Benmessahel","year":"2018","unstructured":"Benmessahel I, Xie K, Chellal M (2018) A new evolutionary neural networks based on intrusion detection systems using multiverse optimization. Appl Intell 48(8):2315\u20132327","journal-title":"Appl Intell"},{"key":"516_CR8","unstructured":"Burnapp L (2014) National living donor kidney sharing schemes. HTA Independent Assessor Conference.\u00a0https:\/\/www.hta.gov.uk\/sites\/default\/files\/Lisa_Burnapp_-_The_national_picture_-_2014_IA_Conference.pdf"},{"key":"516_CR9","doi-asserted-by":"crossref","unstructured":"Dababneh D, Truc Doan LT, Amer Y, My Tran DT (2019) A proposed genetic algorithm approach for the kidney exchange problem. In: 2019 International conference on system science and engineering (ICSSE). pp 383\u2013390","DOI":"10.1109\/ICSSE.2019.8823123"},{"key":"516_CR10","doi-asserted-by":"crossref","unstructured":"Dickerson P John, MF David, PB, Sandholm T, Trimble J (2016) Position-indexed formulations for kidney exchange. In: Proceedings of the 2016 ACM conference on economics and computation. ACM, pp 25\u201342","DOI":"10.1145\/2940716.2940759"},{"key":"516_CR11","unstructured":"Dickerson JP, Procaccia A, Sandholm T (2012) Dynamic matching via weighted myopia with application to kidney exchange. In: Twenty-sixth AAAI conference on artificial intelligence"},{"key":"516_CR12","doi-asserted-by":"crossref","unstructured":"Dickerson PJ, Sandholm T (2015) Futurematch: combining human value judgments and machine learning to match in dynamic environments. In: Twenty-ninth AAAI conference on artificial intelligence","DOI":"10.1097\/00007890-201407151-02249"},{"key":"516_CR13","unstructured":"Ellison B (2014) A systematic review of kidney paired donation. Applying lessons from historic and contemporary case studies to improve the us model"},{"key":"516_CR14","volume-title":"A genetic algorithm for kidney transplantation matching","author":"S Goezinne","year":"2016","unstructured":"Goezinne S, Bekker R, Glorie K (2016) A genetic algorithm for kidney transplantation matching. Business Analytics Master program at VU University, Amsterdam"},{"issue":"5","key":"516_CR15","doi-asserted-by":"publisher","first-page":"e0196707","DOI":"10.1371\/journal.pone.0196707","volume":"13","author":"E Hamouda","year":"2018","unstructured":"Hamouda E, El-Metwally S, Tarek M (2018) Ant lion optimization algorithm for kidney exchanges. PLoS ONE 13(5):e0196707","journal-title":"PLoS ONE"},{"key":"516_CR16","doi-asserted-by":"publisher","first-page":"32805","DOI":"10.1109\/ACCESS.2019.2903345","volume":"7","author":"H Jia","year":"2019","unstructured":"Jia H, Peng X, Song W, Lang C, Xing Z, Sun K (2019) Multiverse optimization algorithm based on l\u00e9vy flight improvement for multithreshold color image segmentation. IEEE Access 7:32805\u201332844","journal-title":"IEEE Access"},{"key":"516_CR17","unstructured":"Kahng A (2016) Timing objectives in dynamic kidney exchange. Ph.D thesis"},{"issue":"6","key":"516_CR18","first-page":"789","volume":"57","author":"OJ Kwon","year":"1999","unstructured":"Kwon OJ, Kwak JY, Lee KS, Kang CM, Park HY (1999) Exchange-donor program in renal transplantation: a single center experience. J Korean Surg Soc 57(6):789\u2013796","journal-title":"J Korean Surg Soc"},{"key":"516_CR19","unstructured":"Li J, Liu Y, Huang L, Tang P (2014) Egalitarian pairwise kidney exchange: fast algorithms vialinear programming and parametric flow. In: Proceedings of the 2014 international conference on autonomous agents and multi-agent systems. International Foundation for Autonomous Agents and Multiagent Systems, pp 445\u2013452"},{"key":"516_CR20","doi-asserted-by":"crossref","unstructured":"Lucan M (2007) Five years of single-center experience with paired kidney exchange transplantation. In: Transplantation proceedings, vol 39. Elsevier, pp 1371\u20131375","DOI":"10.1016\/j.transproceed.2007.02.081"},{"issue":"1","key":"516_CR21","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s10878-015-9932-4","volume":"33","author":"V Mak-Hau","year":"2017","unstructured":"Mak-Hau V (2017) On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches. J Combin Optim 33(1):35\u201359","journal-title":"J Combin Optim"},{"issue":"1","key":"516_CR22","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/s40472-013-0002-5","volume":"1","author":"S Malik","year":"2014","unstructured":"Malik S, Cole E (2014) State of the art practices and policies in kidney paired donation. Curr Transplant Rep 1(1):10\u201317","journal-title":"Curr Transplant Rep"},{"key":"516_CR23","doi-asserted-by":"crossref","unstructured":"Manlove FD, O\u2019Malley G (2012) Paired and altruistic kidney donation in the UK: algorithms and experimentation. In: International symposium on experimental algorithms. Springer, pp 271\u2013282","DOI":"10.1007\/978-3-642-30850-5_24"},{"key":"516_CR24","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/2670129","volume":"19","author":"DF Manlove","year":"2015","unstructured":"Manlove DF, Gregg O\u2019malley. (2015) Paired and altruistic kidney donation in the UK: algorithms and experimentation. J Exp Algorithmics 19:2\u20136","journal-title":"J Exp Algorithmics"},{"issue":"2","key":"516_CR25","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/s00521-015-1870-7","volume":"27","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili S, Mirjalili SM, Hatamlou A (2016) Multi-verse optimizer: a nature-inspired algorithm for global optimization. Neural Comput Appl 27(2):495\u2013513","journal-title":"Neural Comput Appl"},{"issue":"2","key":"516_CR26","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1257\/000282805774669989","volume":"95","author":"AE Roth","year":"2005","unstructured":"Roth AE, S\u00f6nmez T et al (2005) A kidney exchange clearinghouse in New England. Am Econ Rev 95(2):376\u2013380","journal-title":"Am Econ Rev"},{"issue":"2","key":"516_CR27","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1162\/0033553041382157","volume":"119","author":"AE Roth","year":"2004","unstructured":"Roth AE, S\u00f6nmez T, \u00dcnver MU (2004) Kidney exchange. Q J Econ 119(2):457\u2013488","journal-title":"Q J Econ"},{"issue":"2","key":"516_CR28","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.jet.2005.04.004","volume":"125","author":"AE Roth","year":"2005","unstructured":"Roth AE, S\u00f6nmez T, Utku \u00dcnver M (2005) Pairwise kidney exchange. J Econ Theory 125(2):151\u2013188","journal-title":"J Econ Theory"},{"issue":"3","key":"516_CR29","doi-asserted-by":"publisher","first-page":"828","DOI":"10.1257\/aer.97.3.828","volume":"97","author":"AE Roth","year":"2007","unstructured":"Roth AE, S\u00f6nmez T, \u00dcnver MU (2007) Efficient kidney exchange: coincidence of wants in markets with compatibility-based preferences. Am Econ Rev 97(3):828\u2013851","journal-title":"Am Econ Rev"},{"key":"516_CR30","unstructured":"Sakthivel S, Manimaran S (2013) An optimized kidney transplantation based on genetic algorithm. Int J Adv Res 3(4)"},{"key":"516_CR31","unstructured":"Singla S (2018) Combinatorial optimization under uncertainty: probing and stopping-time algorithms. Ph.D. thesis, Carnegie Mellon University"},{"key":"516_CR32","unstructured":"S\u00f6nmez T, Utku UM, Bumin YM (2017) Incentivized kidney exchange. Technical report, working paper"},{"key":"516_CR33","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1016\/S0041-1345(00)02802-5","volume":"1","author":"PG Thiel","year":"2001","unstructured":"Thiel PG, Vogelbach LG, Gasser T, Lehmann K, Voegele T, Kiss A, Kirste G (2001) Crossover renal transplantation: hurdles to be cleared!. Transplant Proc 1:811\u2013816","journal-title":"Transplant Proc"},{"issue":"1","key":"516_CR34","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1111\/j.1467-937X.2009.00575.x","volume":"77","author":"MU \u00dcnver","year":"2010","unstructured":"\u00dcnver MU (2010) Dynamic kidney exchange. Rev Econ Stud 77(1):372\u2013414","journal-title":"Rev Econ Stud"}],"container-title":["Evolutionary Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-020-00516-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12065-020-00516-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-020-00516-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,4]],"date-time":"2022-03-04T03:27:25Z","timestamp":1646364445000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12065-020-00516-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,4]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["516"],"URL":"https:\/\/doi.org\/10.1007\/s12065-020-00516-3","relation":{},"ISSN":["1864-5909","1864-5917"],"issn-type":[{"type":"print","value":"1864-5909"},{"type":"electronic","value":"1864-5917"}],"subject":[],"published":{"date-parts":[[2020,11,4]]},"assertion":[{"value":"15 January 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 August 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 October 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 November 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"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"}}]}}