{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T05:39:25Z","timestamp":1769837965483,"version":"3.49.0"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031265037","type":"print"},{"value":"9783031265044","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-26504-4_24","type":"book-chapter","created":{"date-parts":[[2023,2,22]],"date-time":"2023-02-22T08:02:59Z","timestamp":1677052979000},"page":"335-349","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The P-Next Center Problem with\u00a0Capacity and\u00a0Coverage Radius Constraints: Model and\u00a0Heuristics"],"prefix":"10.1007","author":[{"given":"Mariana A.","family":"Londe","sequence":"first","affiliation":[]},{"given":"Luciana S.","family":"Pessoa","sequence":"additional","affiliation":[]},{"given":"Carlos E.","family":"Andrade","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,23]]},"reference":[{"key":"24_CR1","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.cor.2015.01.002","volume":"62","author":"M Albareda-Sambola","year":"2015","unstructured":"Albareda-Sambola, M., Hinojosa, Y., Mar\u00edn, A., Puerto, J.: When centers can fail: a close second opportunity. Comput. Oper. Res. 62, 145\u2013156 (2015). https:\/\/doi.org\/10.1016\/j.cor.2015.01.002","journal-title":"Comput. Oper. Res."},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Amarilies, H.S., Redi, A.P., Mufidah, I., Nadlifatin, R.: Greedy heuristics for the maximum covering location problem: a case study of optimal trashcan location in kampung Cipare-Tenjo-West java. In: IOP Conference Series: Materials Science and Engineering, vol. 847, p. 012007. IOP Publishing (2020)","DOI":"10.1088\/1757-899X\/847\/1\/012007"},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.eswa.2019.03.007","volume":"128","author":"CE Andrade","year":"2019","unstructured":"Andrade, C.E., Silva, T., Pessoa, L.S.: Minimizing flowtime in a flowshop scheduling problem with a biased random-key genetic algorithm. Expert Syst. Appl. 128, 67\u201380 (2019). https:\/\/doi.org\/10.1016\/j.eswa.2019.03.007","journal-title":"Expert Syst. Appl."},{"issue":"1","key":"24_CR4","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.ejor.2019.11.037","volume":"289","author":"CE Andrade","year":"2021","unstructured":"Andrade, C.E., Toso, R.F., Gon\u00e7alves, J.F., Resende, M.G.C.: The multi-parent biased random-key genetic algorithm with implicit path-relinking and its real-world applications. Eur. J. Oper. Res. 289(1), 17\u201330 (2021). https:\/\/doi.org\/10.1016\/j.ejor.2019.11.037","journal-title":"Eur. J. Oper. Res."},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1016\/j.eswa.2018.08.024","volume":"115","author":"FL Biajoli","year":"2019","unstructured":"Biajoli, F.L., Chaves, A.A., Lorena, L.A.N.: A biased random-key genetic algorithm for the two-stage capacitated facility location problem. Expert Syst. Appl. 115, 418\u2013426 (2019). https:\/\/doi.org\/10.1016\/j.eswa.2018.08.024","journal-title":"Expert Syst. Appl."},{"key":"24_CR6","doi-asserted-by":"publisher","unstructured":"Bochner, R., Fiszon, J.T., Machado, C., et al.: A profile of snake bites in brazil, 2001 to 2012. Clinical Toxicology (2014). https:\/\/doi.org\/10.4172\/2161-0495.1000194","DOI":"10.4172\/2161-0495.1000194"},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.trc.2018.12.001","volume":"99","author":"D Chauhan","year":"2019","unstructured":"Chauhan, D., Unnikrishnan, A., Figliozzi, M.: Maximum coverage capacitated facility location problem with range constrained drones. Transp. Res. Part C: Emerg. Technol. 99, 1\u201318 (2019). https:\/\/doi.org\/10.1016\/j.trc.2018.12.001","journal-title":"Transp. Res. Part C: Emerg. Technol."},{"issue":"2","key":"24_CR8","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1177\/0361198120968094","volume":"2675","author":"DR Chauhan","year":"2021","unstructured":"Chauhan, D.R., Unnikrishnan, A., Figliozzi, M., Boyles, S.D.: Robust maximum coverage facility location problem with drones considering uncertainties in battery availability and consumption. Transp. Res. Rec. 2675(2), 25\u201339 (2021)","journal-title":"Transp. Res. Rec."},{"key":"24_CR9","volume-title":"Facility Location: Applications and Theory","author":"Z Drezner","year":"2004","unstructured":"Drezner, Z., Hamacher, H.W.: Facility Location: Applications and Theory. Springer Science & Business Media, Cham (2004)"},{"issue":"2","key":"24_CR10","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"TA Feo","year":"1995","unstructured":"Feo, T.A., Resende, M.G.: Greedy randomized adaptive search procedures. J. Global Optim. 6(2), 109\u2013133 (1995). https:\/\/doi.org\/10.1007\/BF01096763","journal-title":"J. Global Optim."},{"issue":"3","key":"24_CR11","doi-asserted-by":"publisher","first-page":"959","DOI":"10.1016\/j.ejor.2019.07.045","volume":"289","author":"C Filippi","year":"2021","unstructured":"Filippi, C., Guastaroba, G., Speranza, M.G.: On single-source capacitated facility location with cost and fairness objectives. Eur. J. Oper. Res. 289(3), 959\u2013974 (2021). https:\/\/doi.org\/10.1016\/j.ejor.2019.07.045","journal-title":"Eur. J. Oper. Res."},{"key":"24_CR12","series-title":"Operations Research\/Computer Science Interfaces Series","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-1-4615-4102-8_1","volume-title":"Interfaces in Computer Science and Operations Research","author":"F Glover","year":"1997","unstructured":"Glover, F.: Tabu search and adaptive memory programming\u2014advances, applications and challenges. In: Barr, R.S., Helgason, R.V., Kennington, J.L. (eds.) Interfaces in Computer Science and Operations Research. Operations Research\/Computer Science Interfaces Series, vol. 7, pp. 1\u201375. Springer, Boston (1997). https:\/\/doi.org\/10.1007\/978-1-4615-4102-8_1"},{"issue":"5","key":"24_CR13","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/s10732-010-9143-1","volume":"17","author":"JF Gon\u00e7alves","year":"2011","unstructured":"Gon\u00e7alves, J.F., Resende, M.G.C.: Biased random-key genetic algorithms for combinatorial optimization. J. Heuristics 17(5), 487\u2013525 (2011). https:\/\/doi.org\/10.1007\/s10732-010-9143-1","journal-title":"J. Heuristics"},{"key":"24_CR14","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/0-387-28356-0_8","volume-title":"Search Methodologies","author":"P Hansen","year":"2005","unstructured":"Hansen, P., Mladenovi\u0107, N.: Variable neighborhood search. In: Burke, E.K., Kendall, G. (eds.) Search Methodologies, pp. 211\u2013238. Springer, Boston (2005). https:\/\/doi.org\/10.1007\/0-387-28356-0_8"},{"issue":"1","key":"24_CR15","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s10479-010-0736-8","volume":"181","author":"R Huang","year":"2010","unstructured":"Huang, R., Kim, S., Menezes, M.B.: Facility location for large-scale emergencies. Ann. Oper. Res. 181(1), 271\u2013286 (2010). https:\/\/doi.org\/10.1007\/s10479-010-0736-8","journal-title":"Ann. Oper. Res."},{"key":"24_CR16","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1016\/j.asoc.2017.10.035","volume":"62","author":"M Karatas","year":"2018","unstructured":"Karatas, M., Yak\u0131c\u0131, E.: An iterative solution approach to a multi-objective facility location problem. Appl. Soft Comput. 62, 272\u2013287 (2018)","journal-title":"Appl. Soft Comput."},{"key":"24_CR17","doi-asserted-by":"publisher","first-page":"114728","DOI":"10.1016\/j.eswa.2021.114728","volume":"175","author":"MA Londe","year":"2021","unstructured":"Londe, M.A., Andrade, C.E., Pessoa, L.S.: An evolutionary approach for the p-next center problem. Expert Syst. Appl. 175, 114728 (2021). https:\/\/doi.org\/10.1016\/j.eswa.2021.114728","journal-title":"Expert Syst. Appl."},{"key":"24_CR18","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.orp.2016.09.002","volume":"3","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2016","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., Dubois-Lacoste, J., C\u00e1ceres, L.P., Birattari, M., St\u00fctzle, T.: The irace package: iterated racing for automatic algorithm configuration. Oper. Res. Perspect. 3, 43\u201358 (2016). https:\/\/doi.org\/10.1016\/j.orp.2016.09.002","journal-title":"Oper. Res. Perspect."},{"key":"24_CR19","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/j.cor.2018.12.017","volume":"104","author":"AD L\u00f3pez-S\u00e1nchez","year":"2019","unstructured":"L\u00f3pez-S\u00e1nchez, A.D., S\u00e1nchez-Oro, J., Hern\u00e1ndez-D\u00edaz, A.G.: GRASP and VNS for solving the p-next center problem. Comput. Oper. Res. 104, 295\u2013303 (2019). https:\/\/doi.org\/10.1016\/j.cor.2018.12.017","journal-title":"Comput. Oper. Res."},{"issue":"6","key":"24_CR20","doi-asserted-by":"publisher","first-page":"3069","DOI":"10.1111\/itor.12930","volume":"28","author":"GR Mauri","year":"2021","unstructured":"Mauri, G.R., Biajoli, F.L., Rabello, R.L., Chaves, A.A., Ribeiro, G.M., Lorena, L.A.N.: Hybrid metaheuristics to solve a multiproduct two-stage capacitated facility location problem. Int. Trans. Oper. Res. 28(6), 3069\u20133093 (2021). https:\/\/doi.org\/10.1111\/itor.12930","journal-title":"Int. Trans. Oper. Res."},{"issue":"1","key":"24_CR21","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1111\/itor.13026","volume":"29","author":"AA Morgan","year":"2022","unstructured":"Morgan, A.A., Khayyat, K.M.J.: Improving emergency services efficiency during iIlamic pilgrimage through optimal allocation of facilities. Int. Trans. Oper. Res. 29(1), 259\u2013300 (2022). https:\/\/doi.org\/10.1111\/itor.13026","journal-title":"Int. Trans. Oper. Res."},{"issue":"1","key":"24_CR22","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1177\/0160017615600222","volume":"39","author":"AT Murray","year":"2016","unstructured":"Murray, A.T.: Maximal coverage location problem: impacts, significance, and evolution. Int. Reg. Sci. Rev. 39(1), 5\u201327 (2016). https:\/\/doi.org\/10.1177\/0160017615600222","journal-title":"Int. Reg. Sci. Rev."},{"key":"24_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.115501","volume":"185","author":"G Souto","year":"2021","unstructured":"Souto, G., Morais, I., Mauri, G.R., Ribeiro, G.M., Gonz\u00e1lez, P.H.: A hybrid matheuristic for the two-stage capacitated facility location problem. Expert Syst. Appl. 185, 115501 (2021)","journal-title":"Expert Syst. Appl."},{"issue":"1\u20132","key":"24_CR24","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0966-8349(96)00012-5","volume":"4","author":"A Suzuki","year":"1996","unstructured":"Suzuki, A., Drezner, Z.: The p-center location problem in an area. Locat. Sci. 4(1\u20132), 69\u201382 (1996). https:\/\/doi.org\/10.1016\/S0966-8349(96)00012-5","journal-title":"Locat. Sci."},{"issue":"4","key":"24_CR25","first-page":"395","volume":"40","author":"OJ Taiwo","year":"2021","unstructured":"Taiwo, O.J.: Maximal covering location problem (MCLP) for the identification of potential optimal COVID-19 testing facility sites in nigeria. Afr. Geogr. Rev. 40(4), 395\u2013411 (2021)","journal-title":"Afr. Geogr. Rev."},{"issue":"5","key":"24_CR26","doi-asserted-by":"publisher","first-page":"1226","DOI":"10.1016\/j.cor.2004.09.012","volume":"33","author":"LY Wu","year":"2006","unstructured":"Wu, L.Y., Zhang, X.S., Zhang, J.L.: Capacitated facility location problem with general setup cost. Comput. Oper. Res. 33(5), 1226\u20131241 (2006). https:\/\/doi.org\/10.1016\/j.cor.2004.09.012","journal-title":"Comput. Oper. Res."},{"key":"24_CR27","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106608","volume":"146","author":"P Yang","year":"2020","unstructured":"Yang, P., Xiao, Y., Zhang, Y., Zhou, S., Yang, J., Xu, Y.: The continuous maximal covering location problem in large-scale natural disaster rescue scenes. Comput. Ind. Eng. 146, 106608 (2020)","journal-title":"Comput. Ind. Eng."},{"key":"24_CR28","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijdrr.2019.101335","volume":"42","author":"W Yu","year":"2020","unstructured":"Yu, W.: Reachability guarantee based model for pre-positioning of emergency facilities under uncertain disaster damages. Int. J. Disaster Risk Reduction 42, 101335 (2020). https:\/\/doi.org\/10.1016\/j.ijdrr.2019.101335","journal-title":"Int. J. Disaster Risk Reduction"}],"container-title":["Lecture Notes in Computer Science","Metaheuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-26504-4_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T08:04:26Z","timestamp":1688198666000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-26504-4_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031265037","9783031265044"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-26504-4_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"23 February 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Metaheuristics International Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ortigia-Syracuse","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"metic2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.ants-lab.it\/mic2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"72","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"67% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}