{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T22:29:39Z","timestamp":1743114579593,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030613761"},{"type":"electronic","value":"9783030613778"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-61377-8_1","type":"book-chapter","created":{"date-parts":[[2020,10,15]],"date-time":"2020-10-15T19:04:06Z","timestamp":1602788646000},"page":"3-17","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A New Hybridization of Evolutionary Algorithms, GRASP and Set-Partitioning Formulation for the Capacitated Vehicle Routing Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8560-4473","authenticated-orcid":false,"given":"Andr\u00e9 Manh\u00e3es","family":"Machado","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-0003-0841-514X","authenticated-orcid":false,"given":"Rodrigo de Alvarenga","family":"Rosa","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8393-7741","authenticated-orcid":false,"given":"Geraldo Regis","family":"Mauri","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,10,13]]},"reference":[{"issue":"1","key":"1_CR1","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1111\/itor.12041","volume":"21","author":"HM Afsar","year":"2014","unstructured":"Afsar, H.M., Prins, C., Santos, A.C.: Exact and heuristic algorithms for solving the generalized vehicle routing problem with flexible fleet size. Int. Trans. Oper. Res. 21(1), 153\u2013175 (2014)","journal-title":"Int. Trans. Oper. Res."},{"issue":"7","key":"1_CR2","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1002\/net.3230190702","volume":"19","author":"Y Agarwal","year":"1989","unstructured":"Agarwal, Y., Mathur, K., Salkin, H.M.: A set-partitioning-based exact algorithm for the vehicle routing problem. Networks 19(7), 731\u2013749 (1989)","journal-title":"Networks"},{"key":"1_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30665-5","volume-title":"Metaheuristics for Dynamic Optimization","author":"E Alba","year":"2013","unstructured":"Alba, E., Nakib, A., Siarry, P.: Metaheuristics for Dynamic Optimization. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-30665-5"},{"unstructured":"Augerat, P., Belenguer, J.M., Benavent, E., Corber\u00e1n, A., Naddef, D., Rinaldi, G.: Computational results with a branch and cut code for the capacitated vehicle routing problem, vol. 34. IMAG (1995)","key":"1_CR4"},{"issue":"4","key":"1_CR5","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":"3","key":"1_CR6","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1057\/jors.1969.75","volume":"20","author":"N Christofides","year":"1969","unstructured":"Christofides, N., Eilon, S.: An algorithm for the vehicle-dispatching problem. J. Oper. Res. Soc. 20(3), 309\u2013318 (1969)","journal-title":"J. Oper. Res. Soc."},{"issue":"2","key":"1_CR7","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","volume":"8","author":"TA Feo","year":"1989","unstructured":"Feo, T.A., Resende, M.G.C.: A probabilistic heuristic for a computationally difficult set covering problem. Oper. Res. Lett. 8(2), 67\u201371 (1989)","journal-title":"Oper. Res. Lett."},{"issue":"7","key":"1_CR8","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1016\/S0305-0548(98)00085-9","volume":"26","author":"M Gendreau","year":"1999","unstructured":"Gendreau, M., Laporte, G., Vigo, D.: Heuristics for the traveling salesman problem with pickup and delivery. Comput. Oper. Res. 26(7), 699\u2013714 (1999)","journal-title":"Comput. Oper. Res."},{"doi-asserted-by":"crossref","unstructured":"Goldberg, A., Radzik, T.: A heuristic improvement of the bellman-ford algorithm. Stanford Univ CA Dept. of Computer Science, Technical report (1993)","key":"1_CR9","DOI":"10.1016\/0893-9659(93)90022-F"},{"issue":"8","key":"1_CR10","doi-asserted-by":"publisher","first-page":"2405","DOI":"10.1016\/j.cor.2005.02.020","volume":"33","author":"S Irnich","year":"2006","unstructured":"Irnich, S., Funke, B., Gr\u00fcnert, T.: Sequential search and its application to vehicle-routing problems. Comput. Oper. Res. 33(8), 2405\u20132429 (2006)","journal-title":"Comput. Oper. Res."},{"doi-asserted-by":"publisher","unstructured":"Prins, C.: A grasp$$\\times $$ evolutionary local search hybrid for the vehicle routing problem. In: Bio-inspired algorithms for the vehicle routing problem, pp. 35\u201353. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-540-85152-3_2","key":"1_CR11","DOI":"10.1007\/978-3-540-85152-3_2"},{"issue":"1","key":"1_CR12","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.ejor.2004.09.057","volume":"174","author":"LV Snyder","year":"2006","unstructured":"Snyder, L.V., Daskin, M.S.: A random-key genetic algorithm for the generalized traveling salesman problem. Eur. J. Oper. Res. 174(1), 38\u201353 (2006)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"1_CR13","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn, R., Price, K.: Differential evolution-a simple and efficient heuristic for global optimization over continuous spaces. J. Glob. Optim. 11(4), 341\u2013359 (1997)","journal-title":"J. Glob. Optim."},{"doi-asserted-by":"crossref","unstructured":"Toth, P., Vigo, D.: Vehicle Routing: Problems, Methods, and Applications. SIAM (2014)","key":"1_CR14","DOI":"10.1137\/1.9781611973594"},{"issue":"3","key":"1_CR15","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0377-2217(85)90252-8","volume":"22","author":"G Ulusoy","year":"1985","unstructured":"Ulusoy, G., et al.: The fleet size and mix problem for capacitated arc routing. Eur. J. Oper. Res. 22(3), 329\u2013337 (1985)","journal-title":"Eur. J. Oper. Res."},{"issue":"8","key":"1_CR16","doi-asserted-by":"publisher","first-page":"5375","DOI":"10.1016\/j.asoc.2011.05.021","volume":"11","author":"Z Ursani","year":"2011","unstructured":"Ursani, Z., Essam, D., Cornforth, D., Stocker, R.: Localized genetic algorithm for vehicle routing problem with time windows. Appl. Soft Comput. 11(8), 5375\u20135390 (2011)","journal-title":"Appl. Soft Comput."},{"issue":"2","key":"1_CR17","doi-asserted-by":"publisher","first-page":"2921","DOI":"10.1016\/j.eswa.2008.01.072","volume":"36","author":"CH Wang","year":"2009","unstructured":"Wang, C.H., Lu, J.Z.: A hybrid genetic algorithm that optimizes capacitated vehicle routing problems. Exp. Syst. Appl. 36(2), 2921\u20132936 (2009)","journal-title":"Exp. Syst. Appl."},{"key":"1_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-75514-2_1","volume-title":"Hybrid Metaheuristics","author":"S Wolf","year":"2007","unstructured":"Wolf, S., Merz, P.: Evolutionary local search for the super-peer selection problem and the p-hub median problem. In: Bartz-Beielstein, T., et al. (eds.) HM 2007. LNCS, vol. 4771, pp. 1\u201315. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75514-2_1"},{"issue":"12","key":"1_CR19","doi-asserted-by":"publisher","first-page":"2089","DOI":"10.1016\/j.cor.2010.02.009","volume":"37","author":"EE Zachariadis","year":"2010","unstructured":"Zachariadis, E.E., Kiranoudis, C.T.: A strategy for reducing the computational complexity of local search-based methods for the vehicle routing problem. Comput. Oper. Res. 37(12), 2089\u20132105 (2010)","journal-title":"Comput. Oper. Res."},{"issue":"9","key":"1_CR20","doi-asserted-by":"publisher","first-page":"2178","DOI":"10.1016\/j.cor.2011.11.001","volume":"39","author":"W Zhu","year":"2012","unstructured":"Zhu, W., Qin, H., Lim, A., Wang, L.: A two-stage tabu search algorithm with enhanced packing heuristics for the 3l-cvrp and m3l-cvrp. Comput. Oper. Res. 39(9), 2178\u20132195 (2012)","journal-title":"Comput. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-61377-8_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,12]],"date-time":"2020-11-12T09:47:24Z","timestamp":1605174444000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-61377-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030613761","9783030613778"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-61377-8_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"13 October 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"BRACIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brazilian Conference on Intelligent Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rio Grande","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brazil","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"bracis2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www2.sbc.org.br\/bracis2020\/","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":"JEMS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"228","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":"91","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":"0","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":"40% - 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,5","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":"Due to the Corona pandemic BRACIS 2020 was held as a virtual event.","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)"}}]}}