{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T17:31:01Z","timestamp":1750959061792,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030862299"},{"type":"electronic","value":"9783030862305"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/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":"https:\/\/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-86230-5_16","type":"book-chapter","created":{"date-parts":[[2021,9,7]],"date-time":"2021-09-07T09:03:00Z","timestamp":1631005380000},"page":"199-210","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Minimising Fleet Times in Multi-depot Pickup and Dropoff Problems"],"prefix":"10.1007","author":[{"given":"Martin Damyanov","family":"Aleksandrov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,3]]},"reference":[{"key":"16_CR1","unstructured":"Brosch\u00fcre Mobilit\u00e4t der Stadt - Berliner Verkehr in Zahlen (2017). https:\/\/www.berlin.de\/sen\/uvk\/verkehr\/verkehrsdaten\/zahlen-und-fakten\/mobilitaet-der-stadt-berliner-verkehr-in-zahlen-2017. Accessed 15 May 2021"},{"key":"16_CR2","unstructured":"NewStatesman - Berlin has biggest rise in public transport use and traffic congestion among world cities (2020). https:\/\/www.newstatesman.com\/2020\/05\/berlin-has-biggest-rise-public-transport-use-and-traffic-congestion-among-world-cities. Accessed 15 June 2021"},{"issue":"4","key":"16_CR3","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1016\/0305-0483(83)90033-6","volume":"11","author":"J Beasley","year":"1983","unstructured":"Beasley, J.: Route first-cluster second methods for vehicle routing. Omega 11(4), 403\u2013408 (1983). https:\/\/doi.org\/10.1016\/0305-0483(83)90033-6","journal-title":"Omega"},{"issue":"1","key":"16_CR4","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."},{"key":"16_CR5","unstructured":"Fortin, F.A., De Rainville, F.M., Gardner, M.A.G., Parizeau, M., Gagn\u00e9, C.: DEAP: evolutionary algorithms made easy. J. Mach. Learn. Res. 13(70), 2171\u20132175 (2012). http:\/\/jmlr.org\/papers\/v13\/fortin12a.html"},{"issue":"2","key":"16_CR6","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1287\/opre.22.2.340","volume":"22","author":"BE Gillett","year":"1974","unstructured":"Gillett, B.E., Miller, L.R.: A heuristic algorithm for the vehicle-dispatch problem. Oper. Res. 22(2), 340\u2013349 (1974). https:\/\/doi.org\/10.1287\/opre.22.2.340","journal-title":"Oper. Res."},{"key":"16_CR7","unstructured":"Goldberg, D.E., Lingle, R.: Alleles, loci, and the traveling salesman problem. In: Proceedings of the 1st International Conference on Genetic Algorithms, pp. 154\u2013159. L. Erlbaum Associates Inc., USA, July 1985. https:\/\/dl.acm.org\/doi\/10.5555\/645511.657095"},{"issue":"2","key":"16_CR8","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1016\/S0377-2217(99)00235-0","volume":"122","author":"S Irnich","year":"2000","unstructured":"Irnich, S.: Multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles. Eur. J. Oper. Res. 122(2), 310\u2013328 (2000). https:\/\/doi.org\/10.1016\/S0377-2217(99)00235-0","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"16_CR9","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1287\/trsc.2017.0744","volume":"52","author":"P Matl","year":"2018","unstructured":"Matl, P., Hartl, R.F., Vidal, T.: Workload equity in vehicle routing problems: a survey and analysis. Transp. Sci. 52(2), 239\u2013260 (2018). https:\/\/doi.org\/10.1287\/trsc.2017.0744","journal-title":"Transp. Sci."},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Mitchell, M.: An Introduction to Genetic Algorithms. MIT Press, Cambridge (1998). https:\/\/dl.acm.org\/doi\/10.5555\/522098","DOI":"10.7551\/mitpress\/3927.001.0001"},{"key":"16_CR11","unstructured":"Otman, A., Jaafar, A.: A comparative study of adaptive crossover operators for genetic algorithms to resolve the traveling salesman problem. Int. J. Comput. Appl. 31(11), 49\u201357 (2011). https:\/\/www.ijcaonline.org\/archives\/volume31\/number11\/3945-5587"},{"issue":"3","key":"16_CR12","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/s11116-011-9375-4","volume":"39","author":"J Paquette","year":"2012","unstructured":"Paquette, J., Bellavance, F., Cordeau, J.F., Laporte, G.: Measuring quality of service in dial-a-ride operations: the case of a Canadian city. Transportation 39(3), 539\u2013564 (2012). https:\/\/doi.org\/10.1007\/s11116-011-9375-4","journal-title":"Transportation"},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s11301-008-0033-7","volume":"58","author":"S Parragh","year":"2008","unstructured":"Parragh, S., Doerner, K., Hartl, R.: A survey on pickup and delivery problems: Part i: transportation between customers and depot. Journal f\u00fcr Betriebswirtschaft 58, 21\u201351 (2008). https:\/\/doi.org\/10.1007\/s11301-008-0033-7","journal-title":"Journal f\u00fcr Betriebswirtschaft"},{"key":"16_CR14","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s11301-008-0036-4","volume":"58","author":"S Parragh","year":"2008","unstructured":"Parragh, S., Doerner, K., Hartl, R.: A survey on pickup and delivery problems: Part ii: transportation between pickup and delivery locations. Journal f\u00fcr Betriebswirtschaft 58, 81\u2013117 (2008). https:\/\/doi.org\/10.1007\/s11301-008-0036-4","journal-title":"Journal f\u00fcr Betriebswirtschaft"},{"issue":"2","key":"16_CR15","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1080\/00207540802426599","volume":"47","author":"C Prins","year":"2008","unstructured":"Prins, C., Labadi, N., Reghioui, M.: Tour splitting algorithms for vehicle routing problems. Int. J. Prod. Res. 47(2), 507\u2013535 (2008). https:\/\/doi.org\/10.1080\/00207540802426599","journal-title":"Int. J. Prod. Res."},{"key":"16_CR16","doi-asserted-by":"publisher","unstructured":"Prins, C., Lacomme, P., Prodhon, C.: Order-first split-second methods for vehicle routing problems: a review. Transp. Res. Part C, Emerg. Technol. 40, 179\u2013200 (2014). https:\/\/doi.org\/10.1016\/j.trc.2014.01.011","DOI":"10.1016\/j.trc.2014.01.011"},{"issue":"2\u20133","key":"16_CR17","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s10107-002-0323-0","volume":"94","author":"TK Ralphs","year":"2003","unstructured":"Ralphs, T.K., Kopman, L., Pulleyblank, W.R., Trotter, L.E.: On the capacitated vehicle routing problem. Math. Program. 94(2\u20133), 343\u2013359 (2003). https:\/\/doi.org\/10.1007\/s10107-002-0323-0","journal-title":"Math. Program."},{"issue":"1","key":"16_CR18","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1287\/trsc.29.1.17","volume":"29","author":"MWP Savelsbergh","year":"1995","unstructured":"Savelsbergh, M.W.P., Sol, M.: The general pickup and delivery problem. Transp. Sci. 29(1), 17\u201329 (1995). https:\/\/doi.org\/10.1287\/trsc.29.1.17","journal-title":"Transp. Sci."},{"issue":"3","key":"16_CR19","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1016\/j.ejor.2012.03.044","volume":"221","author":"MM Silva","year":"2012","unstructured":"Silva, M.M., Subramanian, A., Vidal, T., Ochi, L.S.: A simple and effective metaheuristic for the minimum latency problem. Eur. J. Oper. Res. 221(3), 513\u2013520 (2012). https:\/\/doi.org\/10.1016\/j.ejor.2012.03.044","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"16_CR20","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1016\/j.ejor.2016.08.012","volume":"257","author":"E Uchoa","year":"2017","unstructured":"Uchoa, E., Pecin, D., Pessoa, A.A., Poggi, M., Vidal, T., Subramanian, A.: New benchmark instances for the capacitated vehicle routing problem. Eur. J. Oper. Res. 257(3), 845\u2013858 (2017). https:\/\/doi.org\/10.1016\/j.ejor.2016.08.012","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"16_CR21","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."}],"container-title":["Lecture Notes in Computer Science","Progress in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-86230-5_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,7]],"date-time":"2021-09-07T09:08:17Z","timestamp":1631005697000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86230-5_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030862299","9783030862305"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86230-5_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":"3 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EPIA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"EPIA Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"epia2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.appia.pt\/epia2021\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"108","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":"62","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":"57% - 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.47","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":"1.36","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)"}}]}}