{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:38:33Z","timestamp":1740101913418,"version":"3.37.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031371257"},{"type":"electronic","value":"9783031371264"}],"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"},{"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-37126-4_19","type":"book-chapter","created":{"date-parts":[[2023,6,28]],"date-time":"2023-06-28T23:04:56Z","timestamp":1687993496000},"page":"273-289","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Execution Time Experiments to\u00a0Solve Capacitated Vehicle Routing Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6795-2335","authenticated-orcid":false,"given":"Adriano S.","family":"Silva","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7902-1207","authenticated-orcid":false,"given":"Jos\u00e9","family":"Lima","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3803-2043","authenticated-orcid":false,"given":"Ana I.","family":"Pereira","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8551-6353","authenticated-orcid":false,"given":"Adri\u00e1n M. T.","family":"Silva","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6898-2408","authenticated-orcid":false,"given":"Helder T.","family":"Gomes","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,29]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","unstructured":"Abdelatti, M.F., Sodhi, M.S.: An improved GPU-accelerated heuristic technique applied to the capacitated vehicle routing problem. In: Proceedings of the 2020 Genetic and Evolutionary Computation Conference, pp. 663\u2013671 (2020). https:\/\/doi.org\/10.1145\/3377930.3390159","DOI":"10.1145\/3377930.3390159"},{"key":"19_CR2","unstructured":"Augerat, P., Naddef, D., Belenguer, J., Benavent, E., Corberan, A., Rinaldi, G.: Computational results with a branch and cut code for the capacitated vehicle routing problem (1995)"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/j.cie.2015.12.007","volume":"99","author":"K Braekers","year":"2016","unstructured":"Braekers, K., Ramaekers, K., Van Nieuwenhuyse, I.: The vehicle routing problem: state of the art classification and review. Comput. Indust. Eng. 99, 300\u2013313 (2016). https:\/\/doi.org\/10.1016\/j.cie.2015.12.007","journal-title":"Comput. Indust. Eng."},{"key":"19_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.enpol.2021.112640","volume":"159","author":"AK Breed","year":"2021","unstructured":"Breed, A.K., Speth, D., Pl\u00f6tz, P.: $$\\text{ CO}_{{2}}$$ fleet regulation and the future market diffusion of zero-emission trucks in Europe. Energy Policy 159, 112640 (2021). https:\/\/doi.org\/10.1016\/j.enpol.2021.112640","journal-title":"Energy Policy"},{"issue":"1","key":"19_CR5","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). https:\/\/doi.org\/10.1287\/mnsc.6.1.80","journal-title":"Manage. Sci."},{"issue":"6","key":"19_CR6","doi-asserted-by":"publisher","first-page":"1388","DOI":"10.1287\/opre.2016.1535","volume":"64","author":"G Desaulniers","year":"2016","unstructured":"Desaulniers, G., Errico, F., Irnich, S., Schneider, M.: Exact algorithms for electric vehicle-routing problems with time windows. Oper. Res. 64(6), 1388\u20131405 (2016). https:\/\/doi.org\/10.1287\/opre.2016.1535","journal-title":"Oper. Res."},{"key":"19_CR7","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-981-13-1936-5_5","volume-title":"Soft Computing Systems","author":"KM Dhanya","year":"2018","unstructured":"Dhanya, K.M., Kanmani, S., Hanitha, G., Abirami, S.: Hybrid crow search-ant colony optimization algorithm for capacitated vehicle routing problem. In: Zelinka, I., Senkerik, R., Panda, G., Lekshmi Kanthan, P.S. (eds.) ICSCS 2018. CCIS, vol. 837, pp. 46\u201352. Springer, Singapore (2018). https:\/\/doi.org\/10.1007\/978-981-13-1936-5_5"},{"issue":"4","key":"19_CR8","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1002\/net.20472","volume":"58","author":"A Dohn","year":"2011","unstructured":"Dohn, A., Rasmussen, M.S., Larsen, J.: The vehicle routing problem with time windows and temporal dependencies. Networks 58(4), 273\u2013289 (2011). https:\/\/doi.org\/10.1002\/net.20472","journal-title":"Networks"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"45629","DOI":"10.1109\/ACCESS.2022.3170446","volume":"10","author":"F Dubois","year":"2022","unstructured":"Dubois, F., Renaud-Goud, P., Stolf, P.: Capacitated vehicle routing problem under deadlines: an application to flooding crisis. IEEE Access 10, 45629\u201345642 (2022). https:\/\/doi.org\/10.1109\/ACCESS.2022.3170446","journal-title":"IEEE Access"},{"issue":"11","key":"19_CR10","doi-asserted-by":"publisher","first-page":"2959","DOI":"10.1016\/j.cor.2004.04.013","volume":"32","author":"A Haghani","year":"2005","unstructured":"Haghani, A., Jung, S.: A dynamic vehicle routing problem with time-dependent travel times. Comput. Oper. Res. 32(11), 2959\u20132986 (2005). https:\/\/doi.org\/10.1016\/j.cor.2004.04.013","journal-title":"Comput. Oper. Res."},{"key":"19_CR11","doi-asserted-by":"publisher","unstructured":"Hannan, M., Akhtar, M., Begum, R., Basri, H., Hussain, A., Scavino, E.: Capacitated vehicle-routing problem model for scheduled solid waste collection and route optimization using PSO algorithm. Waste Manag. 71, 31\u201341 (2018). https:\/\/doi.org\/10.1016\/j.wasman.2017.10.019. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0956053X17307675","DOI":"10.1016\/j.wasman.2017.10.019"},{"issue":"6","key":"19_CR12","doi-asserted-by":"publisher","first-page":"1394","DOI":"10.1109\/TEVC.2022.3144142","volume":"26","author":"YH Jia","year":"2022","unstructured":"Jia, Y.H., Mei, Y., Zhang, M.: Confidence-based ant colony optimization for capacitated electric vehicle routing problem with comparison of different encoding schemes. IEEE Trans. Evol. Comput. 26(6), 1394\u20131408 (2022). https:\/\/doi.org\/10.1109\/TEVC.2022.3144142","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"19_CR13","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/j.ejor.2007.05.055","volume":"189","author":"N Jozefowiez","year":"2008","unstructured":"Jozefowiez, N., Semet, F., Talbi, E.G.: Multi-objective vehicle routing problems. Eur. J. Oper. Res. 189(2), 293\u2013309 (2008). https:\/\/doi.org\/10.1016\/j.ejor.2007.05.055","journal-title":"Eur. J. Oper. Res."},{"key":"19_CR14","doi-asserted-by":"publisher","unstructured":"Mehmood, T.: Does information technology competencies and fleet management practices lead to effective service delivery? Empirical evidence from e-commerce industry. Int. J. Technol. Innov. Manag. (IJTIM) 1(2), 14\u201341 (2021). https:\/\/doi.org\/10.54489\/ijtim.v1i2.26","DOI":"10.54489\/ijtim.v1i2.26"},{"key":"19_CR15","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1016\/j.jocs.2017.04.012","volume":"21","author":"MA Mohammed","year":"2017","unstructured":"Mohammed, M.A., et al.: Solving vehicle routing problem by using improved k-nearest neighbor algorithm for best solution. J. Comput. Sci. 21, 232\u2013240 (2017). https:\/\/doi.org\/10.1016\/j.jocs.2017.04.012","journal-title":"J. Comput. Sci."},{"key":"19_CR16","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.trb.2017.02.004","volume":"103","author":"A Montoya","year":"2017","unstructured":"Montoya, A., Gu\u00e9ret, C., Mendoza, J.E., Villegas, J.G.: The electric vehicle routing problem with nonlinear charging function. Transport. Res. Part B: Methodol. 103, 87\u2013110 (2017). https:\/\/doi.org\/10.1016\/j.trb.2017.02.004","journal-title":"Transport. Res. Part B: Methodol."},{"issue":"1","key":"19_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2012.08.015","volume":"225","author":"V Pillac","year":"2013","unstructured":"Pillac, V., Gendreau, M., Gu\u00e9ret, C., Medaglia, A.L.: A review of dynamic vehicle routing problems. Eur. J. Oper. Res. 225(1), 1\u201311 (2013). https:\/\/doi.org\/10.1016\/j.ejor.2012.08.015","journal-title":"Eur. J. Oper. Res."},{"issue":"8","key":"19_CR18","doi-asserted-by":"publisher","first-page":"2403","DOI":"10.1016\/j.cor.2005.09.012","volume":"34","author":"D Pisinger","year":"2007","unstructured":"Pisinger, D., Ropke, S.: A general heuristic for vehicle routing problems. Comput. Oper. Res. 34(8), 2403\u20132435 (2007). https:\/\/doi.org\/10.1016\/j.cor.2005.09.012","journal-title":"Comput. Oper. Res."},{"key":"19_CR19","doi-asserted-by":"publisher","first-page":"670","DOI":"10.1016\/j.matpr.2022.05.185","volume":"64","author":"V Praveen","year":"2022","unstructured":"Praveen, V., Keerthika, P., Sivapriya, G., Sarankumar, A., Bhasker, B.: Vehicle routing optimization problem: a study on capacitated vehicle routing problem. Mater. Today: Proceed. 64, 670\u2013674 (2022). https:\/\/doi.org\/10.1016\/j.matpr.2022.05.185","journal-title":"Mater. Today: Proceed."},{"key":"19_CR20","doi-asserted-by":"publisher","unstructured":"Silva, A.S., et al.: Solving a capacitated waste collection problem using an open-source tool. In: Gervasi, O., Murgante, B., Misra, S., Rocha, A.M.A.C., Garau, C. (eds.) Computational Science and Its Applications - ICCSA 2022 Workshops. ICCSA 2022. Lecture Notes in Computer Science, vol. 13378, pp. 140\u2013156. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-10562-3_11","DOI":"10.1007\/978-3-031-10562-3_11"},{"key":"19_CR21","doi-asserted-by":"publisher","unstructured":"Silva, A.S., et al.: Dynamic urban solid waste management system for smart cities. In: Simos, D.E., Rasskazova, V.A., Archetti, F., Kotsireas, I.S., Pardalos, P.M. (eds.) Learning and Intelligent Optimization. LION 2022. Lecture Notes in Computer Science, vol. 13621, pp. 178\u2013190. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-24866-5_14","DOI":"10.1007\/978-3-031-24866-5_14"},{"key":"19_CR22","doi-asserted-by":"publisher","unstructured":"Silva, A.S., et al.: Capacitated waste collection problem solution using an open-source tool. Computers 12(1), 15 (2023). https:\/\/doi.org\/10.3390\/computers12010015. https:\/\/www.mdpi.com\/2073-431X\/12\/1\/15","DOI":"10.3390\/computers12010015"},{"key":"19_CR23","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.tra.2019.05.010","volume":"125","author":"P Siskos","year":"2019","unstructured":"Siskos, P., Moysoglou, Y.: Assessing the impacts of setting $$\\text{ CO}_{{2}}$$ emission targets on truck manufacturers: a model implementation and application for the EU. Transport. Res. Part A: Policy Pract. 125, 123\u2013138 (2019). https:\/\/doi.org\/10.1016\/j.tra.2019.05.010","journal-title":"Transport. Res. Part A: Policy Pract."},{"key":"19_CR24","doi-asserted-by":"publisher","unstructured":"Tian, J., Yang, D., Zhang, H., Liu, L.: Classification method of energy efficiency and $$\\text{ CO}_{{2}}$$ emission intensity of commercial trucks in china\u2019s road transport. Procedia Eng. 137, 75\u201384 (2016). https:\/\/doi.org\/10.1016\/j.proeng.2016.01.236. Green Intelligent Transportation System and Safety","DOI":"10.1016\/j.proeng.2016.01.236"},{"key":"19_CR25","doi-asserted-by":"publisher","unstructured":"Toth, P., Vigo, D.: The vehicle routing problem. SIAM (2002). https:\/\/doi.org\/10.1137\/1.9780898718515","DOI":"10.1137\/1.9780898718515"},{"issue":"2","key":"19_CR26","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/j.ejor.2019.10.010","volume":"286","author":"T Vidal","year":"2020","unstructured":"Vidal, T., Laporte, G., Matl, P.: A concise guide to existing and emerging vehicle routing problem variants. Eur. J. Oper. Res. 286(2), 401\u2013416 (2020). https:\/\/doi.org\/10.1016\/j.ejor.2019.10.010","journal-title":"Eur. J. Oper. Res."},{"key":"19_CR27","doi-asserted-by":"publisher","unstructured":"Voudouris, C., Tsang, E.P., Alsheddy, A.: Guided local search. In: Gendreau, M., Potvin, JY. (eds.) Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol. 146, pp. 321\u2013361. Springer, MA (2010). https:\/\/doi.org\/10.1007\/978-1-4419-1665-5_11","DOI":"10.1007\/978-1-4419-1665-5_11"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2023 Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-37126-4_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,15]],"date-time":"2023-12-15T15:07:13Z","timestamp":1702652833000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-37126-4_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031371257","9783031371264"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-37126-4_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"29 June 2023","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":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccsa2023","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":"Custom based on 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":"283","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":"67","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":"13","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":"24% - 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.5","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,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":"PHD Showcase Papers: 6(for main conf) \/ For ICCSA 2023 Workshops 876 subm sent, 350 full papers and 29 short papers accepted, additional PHD Showcase Papers: 2","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)"}}]}}