{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,31]],"date-time":"2025-03-31T04:06:04Z","timestamp":1743393964833,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031220388"},{"type":"electronic","value":"9783031220395"}],"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.springernature.com\/gp\/researchers\/text-and-data-mining"},{"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.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-22039-5_13","type":"book-chapter","created":{"date-parts":[[2022,12,10]],"date-time":"2022-12-10T18:02:31Z","timestamp":1670695351000},"page":"157-167","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimal Delivery Area Assignment for the Capital Vehicle Routing Problem Based on a Maximum Likelihood Approach"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6703-3259","authenticated-orcid":false,"given":"Junya","family":"Maruyama","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6458-0767","authenticated-orcid":false,"given":"Yudai","family":"Honma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4854-6665","authenticated-orcid":false,"given":"Daisuke","family":"Hasegawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3603-3798","authenticated-orcid":false,"given":"Soma","family":"Toki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0913-821X","authenticated-orcid":false,"given":"Naoshi","family":"Shiono","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,11]]},"reference":[{"issue":"5","key":"13_CR1","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/0191-2615(86)90009-3","volume":"20","author":"F Newell","year":"1986","unstructured":"Newell, F., Gordon, D., Carlos, F.: Design of multiple vehicle delivery tours-II other metrics. Transp. Res B-Meth 20(5), 365\u2013376 (1986). https:\/\/doi.org\/10.1016\/0191-2615(86)90009-3","journal-title":"Transp. Res B-Meth"},{"issue":"10","key":"13_CR2","doi-asserted-by":"publisher","first-page":"1079","DOI":"10.1016\/j.trb.2007.04.010","volume":"41","author":"Y Ouyang","year":"2007","unstructured":"Ouyang, Y.: Design of vehicle routing zones for large-scale distribution systems. Transp. Res B-Meth: Methodol. 41(10), 1079\u20131093 (2007). https:\/\/doi.org\/10.1016\/j.trb.2007.04.010","journal-title":"Transp. Res B-Meth: Methodol."},{"key":"13_CR3","doi-asserted-by":"publisher","unstructured":"Galv\u00e3o, L.C., Novaes, A.G.N., Souza de Cursi, J.E., Souza, J.C.: A multiplicatively-weighted Voronoi diagram approach to logistics districting. Comput. Oper. Res. 33, 93\u2013114 (2006). https:\/\/doi.org\/10.1016\/j.cor.2004.07.001","DOI":"10.1016\/j.cor.2004.07.001"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1111\/itor.12219","volume":"23","author":"G Garc\u00eda-Ayala","year":"2016","unstructured":"Garc\u00eda-Ayala, G., Gonz\u00e1lez-Velarde, J.L., R\u00edos-Mercado, R.Z., Fern\u00e1ndez, E.: A novel model for arc territory design: promoting Eulerian districts. Int. Trans. Oper. Res. 23, 433\u2013458 (2016). https:\/\/doi.org\/10.1111\/itor.12219","journal-title":"Int. Trans. Oper. Res."},{"issue":"1","key":"13_CR5","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1287\/trsc.1060.0167","volume":"4","author":"H Zhong","year":"2007","unstructured":"Zhong, H., Hall, R.W., Dessouky, M.: Territory planning and vehicle dispatching with driver learning. Transp. Sci. 4(1), 74\u201389 (2007). https:\/\/doi.org\/10.1287\/trsc.1060.0167","journal-title":"Transp. Sci."},{"issue":"3-4","key":"13_CR6","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1007\/s10846-019-01045-7","volume":"97","author":"I Sung","year":"2019","unstructured":"Sung, I., Nielsen, P.: Zoning a service area of unmanned aerial vehicles for package delivery services. J. Intell. Rob. Syst. 97(3\u20134), 719\u2013731 (2019). https:\/\/doi.org\/10.1007\/s10846-019-01045-7","journal-title":"J. Intell. Rob. Syst."},{"issue":"3","key":"13_CR7","doi-asserted-by":"publisher","first-page":"475","DOI":"10.11361\/journalcpij.55.475","volume":"55","author":"H Yudai","year":"2020","unstructured":"Yudai, H., Atsushi, S.: New clustering method to estimate overlapped exchange area from regional flow matrix \u2013characteristics of population migrations and freight flow. J. City Plan. Inst. Japan 55(3), 475\u2013481 (2020). https:\/\/doi.org\/10.11361\/journalcpij.55.475","journal-title":"J. City Plan. Inst. Japan"},{"key":"13_CR8","volume-title":"Mathematical Optimization: Solving Problems Using Gurobi and Python","author":"K Mikio","year":"2013","unstructured":"Mikio, K., Pedroso, J.P., Masakazu, M., Rais, A.: Mathematical Optimization: Solving Problems Using Gurobi and Python, 2nd edn. Kindai Kagaku sha Co., Ltd., Japan (2013)","edition":"2"},{"issue":"3","key":"13_CR9","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/BF01434270","volume":"71","author":"PJ Densham","year":"1992","unstructured":"Densham, P.J., Rushton, G.: A more efficient heuristic for solving large p-median problems. J. RSAI 71(3), 307\u2013329 (1992). https:\/\/doi.org\/10.1007\/BF01434270","journal-title":"J. RSAI"},{"key":"13_CR10","unstructured":"Capacitated Vehicle Routing (CVRP) package, LocalSolver. https:\/\/www.localsolver.com\/docs\/last\/exampletour\/vrp.html. Accessed 20 Jan 2022"},{"key":"13_CR11","unstructured":"LocalSolver. https:\/\/www.localsolver.com\/. Accessed 20 Jan 2022"}],"container-title":["Communications in Computer and Information Science","Optimization and Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22039-5_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,30]],"date-time":"2025-03-30T04:30:19Z","timestamp":1743309019000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22039-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031220388","9783031220395"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22039-5_13","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"11 December 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"OLA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Optimization and Learning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Syracuse, Sicilia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"18 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ola2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ola2022.sciencesconf.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":"sciencesconf.org","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"52","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":"37% - 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":"4","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}