{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:28:55Z","timestamp":1740144535451,"version":"3.37.3"},"reference-count":57,"publisher":"EDP Sciences","issue":"5","license":[{"start":{"date-parts":[[2022,10,19]],"date-time":"2022-10-19T00:00:00Z","timestamp":1666137600000},"content-version":"vor","delay-in-days":48,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2022,9,24]]},"published-print":{"date-parts":[[2022,9]]},"abstract":"<jats:p>This paper presents a multi-objective mixed-integer non-linear programming model for a congested multiple-server discrete facility location problem with uniformly distributed demands along the network edges. Regarding the capacity of each facility and the maximum waiting time threshold, the developed model aims to determine the number and locations of established facilities along with their corresponding number of assigned servers such that the traveling distance, the waiting time, the total cost, and the number of lost sales (uncovered customers) are minimized simultaneously. Also, this paper proposes modified versions of some of the existing heuristics and metaheuristic algorithms currently used to solve NP-hard location problems. Here, the memetic algorithm along with its modified version called the stochastic memetic algorithm, as well as the modified add and modified drop heuristics are used as the solution methods. Computational results and comparisons demonstrate that although the results obtained from the developed stochastic memetic algorithm are slightly better, the applied memetic algorithm could be considered as the most efficient approach in finding reasonable solutions with less required CPU times.<\/jats:p>","DOI":"10.1051\/ro\/2022167","type":"journal-article","created":{"date-parts":[[2022,9,26]],"date-time":"2022-09-26T18:56:48Z","timestamp":1664218608000},"page":"3561-3579","source":"Crossref","is-referenced-by-count":3,"title":["A congested capacitated location problem with continuous network demand"],"prefix":"10.1051","volume":"56","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3314-2051","authenticated-orcid":false,"given":"Mahmoud","family":"Golabi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3316-1252","authenticated-orcid":false,"given":"Seyed Mahdi","family":"Shavarani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lhassane","family":"Idoumghar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2022,10,19]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1016\/j.cie.2011.09.018","volume":"62","author":"Arabani","year":"2012","journal-title":"Comput. Ind. Eng."},{"key":"R2","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1016\/j.ejor.2003.10.031","volume":"162","author":"Klose","year":"2005","journal-title":"Eur. J. Oper. Res."},{"key":"R3","doi-asserted-by":"crossref","unstructured":"Liu Y., Yuan Y., Shen J. and Gao W., Emergency response facility location in transportation networks: a literature review. J. Traffic Transp. Eng. (2021).","DOI":"10.1016\/j.jtte.2021.03.001"},{"key":"R4","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.omega.2015.02.006","volume":"55","author":"Bieniek","year":"2015","journal-title":"Omega"},{"key":"R5","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1080\/07408170500216480","volume":"38","author":"Snyder","year":"2006","journal-title":"IIE Trans."},{"key":"R6","doi-asserted-by":"crossref","first-page":"1113","DOI":"10.1051\/ro\/2021036","volume":"55","author":"Gao","year":"2021","journal-title":"RAIRO: OR"},{"key":"R7","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1016\/j.tre.2011.12.004","volume":"48","author":"Li","year":"2012","journal-title":"Transp. Res. Part E Logist. Transp. Rev."},{"key":"R8","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/j.tre.2015.07.006","volume":"82","author":"An","year":"2015","journal-title":"Transp. Res. Part E Logist. Transp. Rev."},{"key":"R9","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1016\/j.cor.2014.09.004","volume":"62","author":"Halper","year":"2015","journal-title":"Comput. Oper. Res."},{"key":"R10","doi-asserted-by":"crossref","first-page":"246","DOI":"10.3390\/jrfm13100246","volume":"13","author":"Ilkhanizadeh","year":"2020","journal-title":"J. Risk Financ. Manag."},{"key":"R11","doi-asserted-by":"crossref","first-page":"3141","DOI":"10.1007\/s00170-017-1363-1","volume":"95","author":"Shavarani","year":"2018","journal-title":"J. Adv. Manuf. Technol."},{"key":"R12","doi-asserted-by":"crossref","first-page":"4593","DOI":"10.1016\/j.eswa.2013.01.065","volume":"40","author":"Torrent-Fontbona","year":"2013","journal-title":"Expert Syst. Appl."},{"key":"R13","doi-asserted-by":"crossref","first-page":"107220","DOI":"10.1016\/j.cie.2021.107220","volume":"156","author":"Zamani","year":"2021","journal-title":"Comput. Ind. Eng."},{"key":"R14","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1007\/s12597-014-0190-5","volume":"52","author":"Basu","year":"2015","journal-title":"Opsearch"},{"key":"R15","first-page":"2487","volume":"9","author":"Ulukan","year":"2015","journal-title":"Int. J. Ind. Manuf. Eng."},{"key":"R16","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/j.cor.2014.09.001","volume":"62","author":"Dinler","year":"2015","journal-title":"Comput. Oper. Res."},{"key":"R17","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1051\/ro\/2020024","volume":"55","author":"Al-Mudahka","year":"2021","journal-title":"RAIRO: OR"},{"key":"R18","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/j.tcs.2021.02.026","volume":"865","author":"Hasanzadeh","year":"2021","journal-title":"Theor. Comput. Sci."},{"key":"R19","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1111\/itor.12088","volume":"22","author":"Beheshtifar","year":"2015","journal-title":"Int. Trans. Oper. Res."},{"key":"R20","doi-asserted-by":"crossref","first-page":"1245","DOI":"10.1051\/ro\/2018026","volume":"52","author":"Eydi","year":"2018","journal-title":"RAIRO: OR"},{"key":"R21","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1016\/j.cie.2011.08.020","volume":"62","author":"Farahani","year":"2012","journal-title":"Comput. Ind. Eng."},{"key":"R22","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1016\/j.ejor.2014.10.011","volume":"242","author":"Aardal","year":"2015","journal-title":"Eur. J. Oper. Res."},{"key":"R23","unstructured":"Yan Y., An Improved Ant Colony Optimization Algorithm with Local Search for the Capacitated Facility Location Problem. Ph.D. thesis, New Mexico State University (2021)."},{"key":"R24","first-page":"642","volume":"1","author":"Charikar","year":"2001","journal-title":"SODA"},{"key":"R25","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1504\/IJAMS.2009.026199","volume":"1","author":"Sinha","year":"2009","journal-title":"Int. J. Appl. Manag. Sci."},{"key":"R26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tre.2014.01.010","volume":"66","author":"Harris","year":"2014","journal-title":"Transp. Res. Part E Logist. Transp. Rev."},{"key":"R27","doi-asserted-by":"crossref","unstructured":"Abbal K. and Benadada Y., Bi-level Multi-capacitated Facility location Problem, in 2020 5th International Conference on Logistics Operations Management (GOL). IEEE (2020) 1\u20135.","DOI":"10.1109\/GOL49479.2020.9314710"},{"key":"R28","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1016\/j.ejor.2006.04.044","volume":"178","author":"Boffey","year":"2007","journal-title":"Eur. J. Oper. Res."},{"key":"R29","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/s10479-008-0341-2","volume":"167","author":"Aboolian","year":"2009","journal-title":"Ann. Oper. Res."},{"key":"R30","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/j.tre.2017.08.003","volume":"106","author":"Sayarshad","year":"2017","journal-title":"Transp. Res. Part E Logist. Transp. Rev."},{"key":"R31","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1080\/0305215X.2016.1163630","volume":"49","author":"Tavakkoli-Moghaddam","year":"2017","journal-title":"Eng. Optim."},{"key":"R32","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.cor.2019.04.001","volume":"108","author":"Shavarani","year":"2019","journal-title":"Comput. Oper. Res."},{"key":"R33","doi-asserted-by":"crossref","first-page":"933","DOI":"10.1080\/07408170600856722","volume":"38","author":"Berman","year":"2006","journal-title":"IIE Trans."},{"key":"R34","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.cie.2014.04.018","volume":"74","author":"Rahmati","year":"2014","journal-title":"Comput. Ind. Eng."},{"key":"R35","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1016\/j.cie.2019.03.023","volume":"130","author":"Etebari","year":"2019","journal-title":"Comput. Ind. Eng."},{"key":"R36","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/s10845-011-0592-7","volume":"24","author":"Pasandideh","year":"2013","journal-title":"J. Intell. Manuf."},{"key":"R37","first-page":"654","volume":"29","author":"Jafari","year":"2016","journal-title":"Int. J. Eng."},{"key":"R38","doi-asserted-by":"crossref","first-page":"1545","DOI":"10.1007\/s11069-017-2832-4","volume":"87","author":"Golabi","year":"2017","journal-title":"Nat. Hazards"},{"key":"R39","doi-asserted-by":"crossref","first-page":"3220","DOI":"10.1111\/itor.12735","volume":"28","author":"Shavarani","year":"2021","journal-title":"Int. Trans. Oper. Res."},{"key":"R40","unstructured":"Golabi M., Izbirak G. and Arkat J., Multiple-server facility location problem with stochastic demands along the network edges. J. Eng. Res. 6 (2018)."},{"key":"R41","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1111\/j.1538-4632.1990.tb00210.x","volume":"22","author":"Hodgson","year":"1990","journal-title":"Geogr. Anal."},{"key":"R42","unstructured":"Garey M.R. and Johnson D.S., Computers and Intractability. Freeman San Francisco, 174 (1979)."},{"key":"R43","doi-asserted-by":"crossref","unstructured":"Daskin M.S. and Maass K.L., The p-median problem, in Location Science. Springer (2015) 21\u201345.","DOI":"10.1007\/978-3-319-13111-5_2"},{"key":"R44","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1137\/0604028","volume":"4","author":"Megiddo","year":"1983","journal-title":"SIAM J. Alg. Discrete Meth."},{"key":"R45","doi-asserted-by":"crossref","first-page":"3596","DOI":"10.1016\/j.eswa.2013.11.046","volume":"41","author":"Dantrakul","year":"2014","journal-title":"Expert Syst. Appl."},{"key":"R46","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1287\/ijoc.1100.0414","volume":"23","author":"Shen","year":"2011","journal-title":"INFORMS J. Comput."},{"key":"R47","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1007\/s12597-012-0064-7","volume":"49","author":"Sinha","year":"2012","journal-title":"Opsearch"},{"key":"R48","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1007\/s00291-007-0114-3","volume":"30","author":"Wollenweber","year":"2008","journal-title":"OR Spectr."},{"key":"R49","doi-asserted-by":"crossref","unstructured":"Kissell R. and Poserina J., Chapter 4 - Advanced math and statistics, in Optimal Sports Math, Statistics, and Fantasy. Academic Press (2017) 103\u2013135.","DOI":"10.1016\/B978-0-12-805163-4.00004-9"},{"key":"R50","doi-asserted-by":"crossref","unstructured":"Shortle J.F., Thompson J.M., Gross D. and Harris C.M., Fundamentals of Queueing Theory. John Wiley & Sons, 399 (2018).","DOI":"10.1002\/9781119453765"},{"key":"R51","doi-asserted-by":"crossref","unstructured":"Ehrgott M. and Gandibleux X., Multiobjective combinatorial optimization\u2014 theory, methodology, and applications, in Multiple Criteria Optimization: State of the Art Annotated Bibliographic Surveys. Springer (2003) 369\u2013444.","DOI":"10.1007\/0-306-48107-3_8"},{"key":"R52","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1109\/TEVC.2005.850260","volume":"9","author":"Krasnogor","year":"2005","journal-title":"IEEE Trans. Evol. Comput."},{"key":"R53","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1016\/j.cor.2007.10.011","volume":"36","author":"Tavakkoli-Moghaddam","year":"2009","journal-title":"Comput. Oper. Res."},{"key":"R54","first-page":"177","volume":"1","author":"Moscato","year":"1992","journal-title":"Parallel Comput. Transp. Appl."},{"key":"R55","doi-asserted-by":"crossref","unstructured":"Samanta S., Choudhury A., Dey N., Ashour A. and Balas V., Quantuminspired evolutionary algorithm for scaling factor optimization during manifold medical information embedding, in Quantum Inspired Computational Intelligence. Elsevier (2017) 285\u2013326.","DOI":"10.1016\/B978-0-12-804409-4.00009-7"},{"key":"R56","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1287\/mnsc.9.4.643","volume":"9","author":"Kuehn","year":"1963","journal-title":"Manag. Sci."},{"key":"R57","doi-asserted-by":"crossref","first-page":"670","DOI":"10.1287\/mnsc.12.9.670","volume":"12","author":"Feldman","year":"1966","journal-title":"Manag. Sci."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2022167\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,19]],"date-time":"2022-10-19T08:16:16Z","timestamp":1666167376000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2022167"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9]]},"references-count":57,"journal-issue":{"issue":"5"},"alternative-id":["ro210457"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2022167","relation":{},"ISSN":["0399-0559","2804-7303"],"issn-type":[{"type":"print","value":"0399-0559"},{"type":"electronic","value":"2804-7303"}],"subject":[],"published":{"date-parts":[[2022,9]]}}}