{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:25:13Z","timestamp":1767338713212,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030707392"},{"type":"electronic","value":"9783030707408"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-70740-8_12","type":"book-chapter","created":{"date-parts":[[2021,3,4]],"date-time":"2021-03-04T07:03:00Z","timestamp":1614841380000},"page":"189-205","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["The GRASP Metaheuristic for the Electric Vehicle Routing Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8809-3587","authenticated-orcid":false,"given":"David","family":"Woller","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8405-269X","authenticated-orcid":false,"given":"Viktor","family":"Koz\u00e1k","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0997-5889","authenticated-orcid":false,"given":"Miroslav","family":"Kulich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,3,5]]},"reference":[{"issue":"3","key":"12_CR1","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). https:\/\/doi.org\/10.1057\/jors.1969.75","journal-title":"J. Oper. Res. Soc."},{"issue":"1","key":"12_CR2","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/BF01589353","volume":"20","author":"N Christofides","year":"1981","unstructured":"Christofides, N., Mingozzi, A., Toth, P.: Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations. Math. Program. 20(1), 255\u2013282 (1981). https:\/\/doi.org\/10.1007\/BF01589353","journal-title":"Math. Program."},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-319-07124-4_9","volume-title":"Handbook of Heuristics","author":"A Duarte","year":"2018","unstructured":"Duarte, A., S\u00e1nchez-Oro, J., Mladenovi\u0107, N., Todosijevi\u0107, R.: Variable neighborhood descent. In: Mart\u00ed, R., Pardalos, P.M., Resende, M.G.C. (eds.) Handbook of Heuristics, pp. 341\u2013367. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-07124-4_9"},{"issue":"1","key":"12_CR4","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/s00453-013-9801-4","volume":"68","author":"M Englert","year":"2013","unstructured":"Englert, M., R\u00f6glin, H., V\u00f6cking, B.: Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP. Algorithmica 68(1), 190\u2013264 (2013). https:\/\/doi.org\/10.1007\/s00453-013-9801-4","journal-title":"Algorithmica"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1155\/2019\/5075671","volume":"2019","author":"T Erdelic","year":"2019","unstructured":"Erdelic, T., Cari\u0107, T., Lalla-Ruiz, E.: A survey on the electric vehicle routing problem: variants and solution approaches. J. Adv. Transp. 2019, 48 (2019). https:\/\/doi.org\/10.1155\/2019\/5075671","journal-title":"J. Adv. Transp."},{"issue":"2","key":"12_CR6","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.: A probabilistic heuristic for a computationally difficult set covering problem. Oper. Res. Lett. 8(2), 67\u201371 (1989). https:\/\/doi.org\/10.1016\/0167-6377(89)90002-3","journal-title":"Oper. Res. Lett."},{"key":"12_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07124-4_23","volume-title":"Handbook of Heuristics","author":"P Festa","year":"2018","unstructured":"Festa, P., Resende, M.G.C.: GRASP. In: Mart\u00ed, R., Pardalos, P., Resende, M. (eds.) Handbook of Heuristics. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-07124-4_23"},{"issue":"4","key":"12_CR8","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1287\/opre.42.4.626","volume":"42","author":"ML Fisher","year":"1994","unstructured":"Fisher, M.L.: Optimal solution of vehicle routing problems using minimum K-trees. Oper. Res. 42(4), 626\u2013642 (1994). https:\/\/doi.org\/10.1287\/opre.42.4.626. https:\/\/www.jstor.org\/stable\/171617","journal-title":"Oper. Res."},{"key":"12_CR9","unstructured":"Goncalves, F., Cardoso, S., Relvas, S.: Optimization of distribution network using electric vehicles: A VRP problem. Technical report. University of Lisbon (2011)"},{"issue":"1\u20133","key":"12_CR10","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/S0166-218X(01)00195-0","volume":"117","author":"G Gutin","year":"2002","unstructured":"Gutin, G., Yeo, A., Zverovich, A.: Traveling salesman should not be greedy: Domination analysis of greedy-type heuristics for the TSP. Discrete Appl. Math. 117(1\u20133), 81\u201386 (2002). https:\/\/doi.org\/10.1016\/S0166-218X(01)00195-0","journal-title":"Discrete Appl. Math."},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Koz\u00e1k, V., Woller, D., Kulich, M.: Initial solution constructors for capacitated green vehicle routing problem. In: Modelling and Simulation for Autonomous Systems (MESAS) 2020 (2020)","DOI":"10.1007\/978-3-030-70740-8_16"},{"key":"12_CR12","unstructured":"Mavrovouniotis, M.: CEC-12 Competition on Electric Vehicle Routing Problem (2020). https:\/\/mavrovouniotis.github.io\/EVRPcompetition2020\/. Accessed 23 Nov 2020"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Mavrovouniotis, M., Menelaou, C., Timotheou, S., Ellinas, G.: A benchmark test suite for the electric capacitated vehicle routing problem. In: 2020 IEEE Congress on Evolutionary Computation (CEC), pp. 1\u20138 (2020). https:\/\/doi.org\/10.1109\/CEC48606.2020.9185753","DOI":"10.1109\/CEC48606.2020.9185753"},{"key":"12_CR14","unstructured":"Mavrovouniotis, M., Menelaou, C., Timotheou, S., Panayiotou, C., Ellinas, G., Polycarpou, M.: Benchmark Set for the IEEE WCCI-2020 Competition on Evolutionary Computation for the Electric Vehicle Routing Problem. Technical report, KIOS Research and Innovation Center of Excellence, Department of Electrical and Computer Engineering, University of Cyprus, Nicosia, Cyprus (2020). https:\/\/mavrovouniotis.github.io\/EVRPcompetition2020\/TR-EVRP-Competition.pdf"},{"key":"12_CR15","doi-asserted-by":"publisher","unstructured":"Normasari, N.M.E., Yu, V.F., Bachtiyar, C.: Sukoyo: A simulated annealing heuristic for the capacitated green vehicle routing problem. Mathematical Problems in Engineering 2019 (2019). https:\/\/doi.org\/10.1155\/2019\/2358258","DOI":"10.1155\/2019\/2358258"},{"key":"12_CR16","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1016\/j.ejor.2016.08.012","volume":"257","author":"E Uchoa","year":"2016","unstructured":"Uchoa, E., Pecin, D., Pessoa, A., Poggi, M., Vidal, T., Subramanian, A.: New benchmark instances for the capacitated vehicle routing problem. Eur. J. Oper. Res. 257, 845\u2013858 (2016). https:\/\/doi.org\/10.1016\/j.ejor.2016.08.012","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"12_CR17","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1109\/JAS.2019.1911405","volume":"6","author":"L Wang","year":"2019","unstructured":"Wang, L., Lu, J.: A memetic algorithm with competition for the capacitated green vehicle routing problem. IEEE\/CAA J. Autom. Sinica 6(2), 516\u2013526 (2019). https:\/\/doi.org\/10.1109\/JAS.2019.1911405","journal-title":"IEEE\/CAA J. Autom. Sinica"},{"issue":"1\u20132","key":"12_CR18","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1007\/s10479-017-2567-3","volume":"269","author":"S Zhang","year":"2018","unstructured":"Zhang, S., Gajpal, Y., Appadoo, S.S.: A meta-heuristic for capacitated green vehicle routing problem. Ann. Oper. Res. 269(1\u20132), 753\u2013771 (2018). https:\/\/doi.org\/10.1007\/s10479-017-2567-3","journal-title":"Ann. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Modelling and Simulation for Autonomous Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-70740-8_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:48:40Z","timestamp":1619560120000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-70740-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030707392","9783030707408"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-70740-8_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"5 March 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MESAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Modelling and Simulation for Autonomous Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","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":"21 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mesas2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.mscoe.org\/event\/mesas-2020\/","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":"Springer OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","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":"19","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":"73% - 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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually.","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)"}}]}}