{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:46:49Z","timestamp":1743050809600,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"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_16","type":"book-chapter","created":{"date-parts":[[2021,3,4]],"date-time":"2021-03-04T07:03:00Z","timestamp":1614841380000},"page":"250-268","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Initial Solution Constructors for Capacitated Green Vehicle Routing Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8405-269X","authenticated-orcid":false,"given":"Viktor","family":"Koz\u00e1k","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8809-3587","authenticated-orcid":false,"given":"David","family":"Woller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V\u00e1clav","family":"V\u00e1vra","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":[{"key":"16_CR1","doi-asserted-by":"publisher","unstructured":"Akhand, M.A.H., Jannat, Z., Murase, K.: Capacitated vehicle routing problem solving using adaptive sweep and velocity tentative PSO. Int. J. Adv. Comput. Sci. Appl. 8, 288\u2013295 (2017). https:\/\/doi.org\/10.14569\/IJACSA.2017.081237","DOI":"10.14569\/IJACSA.2017.081237"},{"key":"16_CR2","doi-asserted-by":"publisher","unstructured":"Bard, J., Huang, L., Dror, M., Jaillet, P.: A branch and cut algorithm for the VRP with satellite facilities. IIE Trans. 30, 821\u2013834 (1998). https:\/\/doi.org\/10.1023\/A:1007500200749","DOI":"10.1023\/A:1007500200749"},{"key":"16_CR3","doi-asserted-by":"publisher","unstructured":"Chan, Y., Baker, S.: The multiple depot, multiple traveling salesmen facility-location problem: vehicle range, service frequency, and heuristic implementations. Math. Comput. Model. 41, 1035\u20131053 (2005). https:\/\/doi.org\/10.1016\/j.mcm.2003.08.011","DOI":"10.1016\/j.mcm.2003.08.011"},{"key":"16_CR4","doi-asserted-by":"publisher","unstructured":"Chen, M., Chang, P., Chiu, C., Annadurai, S.P.: A hybrid two-stage sweep algorithm for capacitated vehicle routing problem. In: 2015 International Conference on Control, Automation and Robotics, pp. 195\u2013199 (2015). https:\/\/doi.org\/10.1109\/ICCAR.2015.7166030","DOI":"10.1109\/ICCAR.2015.7166030"},{"issue":"3","key":"16_CR5","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":"4","key":"16_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). https:\/\/doi.org\/10.1287\/opre.12.4.568","journal-title":"Oper. Res."},{"key":"16_CR7","doi-asserted-by":"publisher","DOI":"10.1155\/2019\/5075671","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). https:\/\/doi.org\/10.1155\/2019\/5075671","journal-title":"J. Adv. Transp."},{"issue":"1","key":"16_CR8","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.tre.2011.08.001","volume":"48","author":"S Erdogan","year":"2012","unstructured":"Erdogan, S., Miller-Hooks, E.: A green vehicle routing problem. Transp. Res. Part E Logist. Transp. Rev. 48(1), 100\u2013114 (2012)","journal-title":"Transp. Res. Part E Logist. Transp. Rev."},{"key":"16_CR9","doi-asserted-by":"publisher","unstructured":"Ester, M., Kriegel, H.P., Sander, J., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: Proceedings of the Second International Conference on Knowledge Discovery and Data Mining, KDD 1996, pp. 226\u2013231. AAAI Press (1996). https:\/\/doi.org\/10.5120\/739-1038","DOI":"10.5120\/739-1038"},{"key":"16_CR10","doi-asserted-by":"publisher","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, 81\u201386 (2002). https:\/\/doi.org\/10.1016\/S0166-218X(01)00195-0","DOI":"10.1016\/S0166-218X(01)00195-0"},{"key":"16_CR11","doi-asserted-by":"publisher","unstructured":"Kek, A., Cheu, R., Meng, Q.: Distance-constrained capacitated vehicle routing problems with flexible assignment of start and end depots. Math. Comput. Model. 47, 140\u2013152 (2008). https:\/\/doi.org\/10.1016\/j.mcm.2007.02.007","DOI":"10.1016\/j.mcm.2007.02.007"},{"key":"16_CR12","doi-asserted-by":"publisher","unstructured":"Kheirkhahzadeh, M., Barforoush, A.: A hybrid algorithm for the vehicle routing problem, pp. 1791\u20131798 (2009). https:\/\/doi.org\/10.1109\/CEC.2009.4983158","DOI":"10.1109\/CEC.2009.4983158"},{"key":"16_CR13","doi-asserted-by":"publisher","unstructured":"Martinovic, G., Aleksi, I., Baumgartner, A.: Single-commodity vehicle routing problem with pickup and delivery service. Math. Prob. Eng. 2008 (2009). https:\/\/doi.org\/10.1155\/2008\/697981","DOI":"10.1155\/2008\/697981"},{"key":"16_CR14","unstructured":"Mavrovouniotis, M.: CEC-12 competition on electric vehicle routing problem. https:\/\/mavrovouniotis.github.io\/EVRPcompetition2020\/ (2020). Accessed 23 Nov 2020"},{"key":"16_CR15","doi-asserted-by":"publisher","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":"16_CR16","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":"16_CR17","doi-asserted-by":"publisher","unstructured":"Tarantilis, C., Zachariadis, E., Kiranoudis, C.: A hybrid guided local search for the vehicle-routing problem with intermediate replenishment facilities. INFORMS J. Comput. 20, 154\u2013168 (2008). https:\/\/doi.org\/10.1287\/ijoc.1070.0230","DOI":"10.1287\/ijoc.1070.0230"},{"key":"16_CR18","doi-asserted-by":"publisher","unstructured":"Uchoa, E., Pecin, D., Pessoa, A., Poggi, M., Vidal, T., Subramanian, A.: New benchmark instances for the capacitated vehicle routing problem. Euro. J. Oper. Res. 257 (2016). https:\/\/doi.org\/10.1016\/j.ejor.2016.08.012","DOI":"10.1016\/j.ejor.2016.08.012"},{"issue":"2","key":"16_CR19","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. Automatica Sinica 6(2), 516\u2013526 (2019). https:\/\/doi.org\/10.1109\/JAS.2019.1911405","journal-title":"IEEE\/CAA J. Automatica Sinica"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Woller, D., Koz\u00e1k, V., Kulich, M.: The grasp metaheuristic for the electric vehicle routing problem (2020)","DOI":"10.1007\/978-3-030-70740-8_12"},{"key":"16_CR21","unstructured":"Xavier, I.: Cvrplib - capacitated vehicle routing problem librar. http:\/\/vrp.atd-lab.inf.puc-rio.br\/ (2020). Accessed 23 Nov 2020"},{"key":"16_CR22","doi-asserted-by":"publisher","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","DOI":"10.1007\/s10479-017-2567-3"}],"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_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:48:06Z","timestamp":1619560086000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-70740-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030707392","9783030707408"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-70740-8_16","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)"}}]}}