{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:42:43Z","timestamp":1742913763533,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031105616"},{"type":"electronic","value":"9783031105623"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-10562-3_7","type":"book-chapter","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T14:25:15Z","timestamp":1659536715000},"page":"81-96","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Reactive GRASP Algorithm for\u00a0the\u00a0Multi-depot Vehicle Routing Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3745-5530","authenticated-orcid":false,"given":"Israel Pereira","family":"de Souza","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9801-2410","authenticated-orcid":false,"given":"Maria Claudia Silva","family":"Boeres","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5538-0504","authenticated-orcid":false,"given":"Renato Elias Nunes","family":"de Moraes","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5781-3278","authenticated-orcid":false,"given":"Jo\u00e3o Vinicius Corr\u00eaa","family":"Thompson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,4]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Baghbadorani, R.R., Ghanavati, A., Zajkani, M., Haeri, M.: A novel two-phase approach to solve multi-depot vehicle routing problem. In: 2021 25th International Conference on System Theory, Control and Computing (ICSTCC), pp. 390\u2013394. IEEE (2021)","DOI":"10.1109\/ICSTCC52150.2021.9607313"},{"issue":"2","key":"7_CR2","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s10107-008-0218-9","volume":"120","author":"R Baldacci","year":"2009","unstructured":"Baldacci, R., Mingozzi, A.: A unified exact method for solving different classes of vehicle routing problems. Math. Program. 120(2), 347\u2013380 (2009)","journal-title":"Math. Program."},{"issue":"2","key":"7_CR3","first-page":"112","volume":"2","author":"PS Barma","year":"2019","unstructured":"Barma, P.S., Dutta, J., Mukherjee, A.: A 2-opt guided discrete antlion optimization algorithm for multi-depot vehicle routing problem. Decis. Mak. Appl. Manage. Eng. 2(2), 112\u2013125 (2019)","journal-title":"Decis. Mak. Appl. Manage. Eng."},{"issue":"4","key":"7_CR4","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1016\/0305-0483(83)90033-6","volume":"11","author":"JE Beasley","year":"1983","unstructured":"Beasley, J.E.: Route first-cluster second methods for vehicle routing. Omega 11(4), 403\u2013408 (1983)","journal-title":"Omega"},{"issue":"11","key":"7_CR5","doi-asserted-by":"publisher","first-page":"3402","DOI":"10.1016\/j.cor.2006.02.005","volume":"34","author":"M Boudia","year":"2007","unstructured":"Boudia, M., Louly, M.A.O., Prins, C.: A reactive grasp and path relinking for a combined production-distribution problem. Comput. Oper. Res. 34(11), 3402\u20133419 (2007)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"7_CR6","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G Clarke","year":"1964","unstructured":"Clarke, G., Wright, J.W.: Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12(4), 568\u2013581 (1964)","journal-title":"Oper. Res."},{"issue":"4","key":"7_CR7","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1504\/IJPM.2018.092766","volume":"11","author":"SE Comert","year":"2018","unstructured":"Comert, S.E., Yazgan, H.R., K\u0131r, S., Yener, F.: A cluster first-route second approach for a capacitated vehicle routing problem: a case study. Int. J. Procure. Manage. 11(4), 399\u2013419 (2018)","journal-title":"Int. J. Procure. Manage."},{"issue":"2","key":"7_CR8","first-page":"105","volume":"30","author":"JF Cordeau","year":"1997","unstructured":"Cordeau, J.F., Gendreau, M., Laporte, G.: A tabu search heuristic for periodic and multi-depot vehicle routing problems. Netw. Int. J. 30(2), 105\u2013119 (1997)","journal-title":"Netw. Int. J."},{"issue":"6","key":"7_CR9","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1287\/opre.6.6.791","volume":"6","author":"GA Croes","year":"1958","unstructured":"Croes, G.A.: A method for solving traveling-salesman problems. Oper. Res. 6(6), 791\u2013812 (1958)","journal-title":"Oper. Res."},{"issue":"1","key":"7_CR10","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"GB Dantzig","year":"1959","unstructured":"Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manage. Sci. 6(1), 80\u201391 (1959)","journal-title":"Manage. Sci."},{"issue":"3","key":"7_CR11","doi-asserted-by":"publisher","first-page":"e0193751","DOI":"10.1371\/journal.pone.0193751","volume":"13","author":"AE Ezugwu","year":"2018","unstructured":"Ezugwu, A.E., Akutsah, F., Olusanya, M.O., Adewumi, A.O.: Enhanced intelligent water drops algorithm for multi-depot vehicle routing problem. PLOS ONE 13(3), e0193751 (2018)","journal-title":"PLOS ONE"},{"issue":"2","key":"7_CR12","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)","journal-title":"J. Global Optim."},{"issue":"1","key":"7_CR13","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1287\/opre.4.1.61","volume":"4","author":"MM Flood","year":"1956","unstructured":"Flood, M.M.: The traveling-salesman problem. Oper. Res. 4(1), 61\u201375 (1956)","journal-title":"Oper. Res."},{"issue":"9","key":"7_CR14","doi-asserted-by":"publisher","first-page":"977","DOI":"10.1057\/palgrave.jors.2601426","volume":"53","author":"I Giosa","year":"2002","unstructured":"Giosa, I., Tansini, I., Viera, I.: New assignment algorithms for the multi-depot vehicle routing problem. J. Oper. Res. Soc. 53(9), 977\u2013984 (2002)","journal-title":"J. Oper. Res. Soc."},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"He, Y., Miao, W., Xie, R., Shi, Y.: A tabu search algorithm with variable cluster grouping for multi-depot vehicle routing problem. In: Proceedings of the 2014 IEEE 18th International Conference on Computer Supported Cooperative Work in Design (CSCWD), pp. 12\u201317. IEEE (2014)","DOI":"10.1109\/CSCWD.2014.6846809"},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1007\/978-3-030-59747-4_42","volume-title":"Computational Logistics","author":"M Iori","year":"2020","unstructured":"Iori, M., Locatelli, M., Moreira, M.C.O., Silveira, T.: Reactive GRASP-based algorithm for pallet building problem with visibility and contiguity constraints. In: Lalla-Ruiz, E., Mes, M., Vo\u00df, S. (eds.) ICCL 2020. LNCS, vol. 12433, pp. 651\u2013665. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-59747-4_42"},{"issue":"1","key":"7_CR17","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/0377-2217(85)90284-X","volume":"20","author":"R Kulkarni","year":"1985","unstructured":"Kulkarni, R., Bhave, P.R.: Integer programming formulations of vehicle routing problems. Eur. J. Oper. Res. 20(1), 58\u201367 (1985)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"7_CR18","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1051\/ro:2008021","volume":"42","author":"N Labadi","year":"2008","unstructured":"Labadi, N., Prins, C., Reghioui, M.: A memetic algorithm for the vehicle routing problem with time windows. RAIRO Oper. Res. 42(3), 415\u2013431 (2008)","journal-title":"RAIRO Oper. Res."},{"issue":"2","key":"7_CR19","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1002\/net.3230110211","volume":"11","author":"JK Lenstra","year":"1981","unstructured":"Lenstra, J.K., Rinnooy Kan, A.H.G.: Complexity of vehicle routing and scheduling problems. Networks 11(2), 221\u2013227 (1981)","journal-title":"Networks"},{"key":"7_CR20","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.cie.2014.03.004","volume":"72","author":"J Luo","year":"2014","unstructured":"Luo, J., Chen, M.-R.: Multi-phase modified shuffled frog leaping algorithm with extremal optimization for the MDVRP and the MDVRPTW. Comput. Ind. Eng. 72, 84\u201397 (2014)","journal-title":"Comput. Ind. Eng."},{"key":"7_CR21","unstructured":"MacQueen, J., et al.: Some methods for classification and analysis of multivariate observations. In: Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability, Oakland, CA, USA, vol. 1, pp. 281\u2013297 (1967)"},{"issue":"3","key":"7_CR22","first-page":"311","volume":"13","author":"F Misni","year":"2019","unstructured":"Misni, F., Lee, L.: Harmony search for multi-depot vehicle routing problem. Malays. J. Math. Sci. 13(3), 311\u2013328 (2019)","journal-title":"Malays. J. Math. Sci."},{"key":"7_CR23","series-title":"International Series in Operations Research & Management Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-319-91086-4_9","volume-title":"Handbook of Metaheuristics","author":"P Moscato","year":"2019","unstructured":"Moscato, P., Cotta, C.: An accelerated introduction to memetic algorithms. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics. ISORMS, vol. 272, pp. 275\u2013309. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-319-91086-4_9"},{"issue":"3","key":"7_CR24","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1287\/ijoc.12.3.164.12639","volume":"12","author":"M Prais","year":"2000","unstructured":"Prais, M., Ribeiro, C.C.: Reactive GRASP: an application to a matrix decomposition problem in TDMA traffic assignment. INFORMS J. Comput. 12(3), 164\u2013176 (2000)","journal-title":"INFORMS J. Comput."},{"issue":"12","key":"7_CR25","doi-asserted-by":"publisher","first-page":"1985","DOI":"10.1016\/S0305-0548(03)00158-8","volume":"31","author":"C Prins","year":"2004","unstructured":"Prins, C.: A simple and effective evolutionary algorithm for the vehicle routing problem. Comput. Oper. Res. 31(12), 1985\u20132002 (2004)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"7_CR26","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/s10732-018-9366-0","volume":"26","author":"L Reyes-Rubiano","year":"2018","unstructured":"Reyes-Rubiano, L., Calvet, L., Juan, A.A., Faulin, J., Bov\u00e9, L.: A biased-randomized variable neighborhood search for sustainable multi-depot vehicle routing problems. J. Heuristics 26(3), 401\u2013422 (2018)","journal-title":"J. Heuristics"},{"issue":"3","key":"7_CR27","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1287\/opre.1120.1048","volume":"60","author":"T Vidal","year":"2012","unstructured":"Vidal, T., Crainic, T.G., Gendreau, M., Lahrichi, N., Rei, W.: A hybrid genetic algorithm for multidepot and periodic vehicle routing problems. Oper. Res. 60(3), 611\u2013624 (2012)","journal-title":"Oper. Res."},{"issue":"5","key":"7_CR28","doi-asserted-by":"publisher","first-page":"780","DOI":"10.1016\/j.engappai.2010.01.013","volume":"23","author":"JG Villegas","year":"2010","unstructured":"Villegas, J.G., Prins, C., Prodhon, C., Medaglia, A.L., Velasco, N.: GRASP\/VND and multi-start evolutionary local search for the single truck and trailer routing problem with satellite depots. Eng. Appl. Artif. Intell. 23(5), 780\u2013794 (2010)","journal-title":"Eng. Appl. Artif. Intell."}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2022 Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-10562-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T14:26:36Z","timestamp":1659536796000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-10562-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031105616","9783031105623"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-10562-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"4 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCSA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science and Its Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Malaga","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","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":"4 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccsa2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccsa.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CyberChair 4","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"279","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":"57","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":"24","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":"20% - 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":"2.6","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":"8.7","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"285 Workshop submission accepted out of 815 submissions","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}