{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T20:50:07Z","timestamp":1743022207850,"version":"3.40.3"},"publisher-location":"Cham","reference-count":6,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030233662"},{"type":"electronic","value":"9783030233679"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-23367-9_6","type":"book-chapter","created":{"date-parts":[[2019,6,19]],"date-time":"2019-06-19T17:02:51Z","timestamp":1560963771000},"page":"72-83","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["GRASP Method for Vehicle Routing with Delivery Place Selection"],"prefix":"10.1007","author":[{"given":"Petar","family":"Afric","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adrian Satja","family":"Kurdija","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lucija","family":"\u0160iki\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marin","family":"Silic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Goran","family":"Delac","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Klemo","family":"Vladimir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sinisa","family":"Srbljic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,6,20]]},"reference":[{"issue":"2","key":"6_CR1","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1016\/j.ejor.2013.02.025","volume":"229","author":"P Schittekat","year":"2013","unstructured":"Schittekat, P., Kinable, J., S\u00f6rensen, K., Sevaux, M., Spieksma, F., Springael, J.: A metaheuristic for the school bus routing problem with bus stop selection. Eur. J. Oper. Res. 229(2), 518\u2013528 (2013)","journal-title":"Eur. J. Oper. Res."},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Toth, P., Vigo, D.: An overview of vehicle routing problems, pp. 1\u201326 (2001)","DOI":"10.1137\/1.9780898718515.ch1"},{"issue":"4","key":"6_CR3","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s13675-014-0030-7","volume":"2","author":"C Archetti","year":"2014","unstructured":"Archetti, C., Speranza, M.G.: A survey on matheuristics for routing problems. EURO J. Comput. Optim. 2(4), 223\u2013246 (2014)","journal-title":"EURO J. Comput. Optim."},{"issue":"3","key":"6_CR4","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1287\/trsc.22.3.161","volume":"22","author":"G Laporte","year":"1988","unstructured":"Laporte, G., Nobert, Y., Taillefer, S.: Solving a family of multi-depot vehicle routing and location-routing problems. Transp. Sci. 22(3), 161\u2013172 (1988)","journal-title":"Transp. Sci."},{"issue":"2","key":"6_CR5","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"TA Feo","year":"1995","unstructured":"Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. J. Glob. Optim. 6(2), 109\u2013133 (1995). https:\/\/doi.org\/10.1007\/BF01096763","journal-title":"J. Glob. Optim."},{"issue":"2","key":"6_CR6","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/j.ejor.2009.05.017","volume":"202","author":"J Park","year":"2010","unstructured":"Park, J., Kim, B.I.: The school bus routing problem: a review. Eur. J. Oper. Res. 202(2), 311\u2013319 (2010)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence and Mobile Services \u2013 AIMS 2019"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-23367-9_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,19]],"date-time":"2023-06-19T00:06:48Z","timestamp":1687133208000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-23367-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030233662","9783030233679"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-23367-9_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"20 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AIMS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on AI and Mobile Services","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"San Diego, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aimse2019a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ai1000.org\/2019\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}