{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T01:02:59Z","timestamp":1743037379052,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030876715"},{"type":"electronic","value":"9783030876722"}],"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-87672-2_30","type":"book-chapter","created":{"date-parts":[[2021,9,21]],"date-time":"2021-09-21T21:02:46Z","timestamp":1632258166000},"page":"456-470","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Automated Tour Planning for Driving Service of Children with Disabilities: A Web-Based Platform and a Case Study"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6940-7691","authenticated-orcid":false,"given":"Mahdi","family":"Moeini","sequence":"first","affiliation":[]},{"given":"Lukas","family":"Mees","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,22]]},"reference":[{"key":"30_CR1","unstructured":"Bootstrap. https:\/\/getbootstrap.com\/. Accessed 15 Apr 2021"},{"key":"30_CR2","unstructured":"Flask. https:\/\/flask.palletsprojects.com\/en\/1.1.x\/. Accessed 15 Apr 2021"},{"key":"30_CR3","unstructured":"Folium. python-visualization.github.io\/folium\/. Accessed 15 Apr 2021"},{"key":"30_CR4","unstructured":"jquery. https:\/\/jquery.com\/. Accessed 15 Apr 2021"},{"key":"30_CR5","unstructured":"Leaflet. https:\/\/leafletjs.com\/. Accessed 15 Apr 2021"},{"key":"30_CR6","unstructured":"Openrouteservice. https:\/\/openrouteservice.org\/. Accessed 15 Apr 2021"},{"key":"30_CR7","unstructured":"Styleguide Deutsches Rotes Kreuz. https:\/\/styleguide.drk.de\/deutsches-rotes-kreuz\/basiselemente\/farben. Accessed 15 Apr 2021"},{"issue":"2","key":"30_CR8","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1080\/03052159808941240","volume":"30","author":"JW Baugh Jr","year":"1998","unstructured":"Baugh, J.W., Jr., Kakivaya, G.K.R., Stone, J.R.: Intractability of the dial-a-ride problem and a multiobjective solution using simulated annealing. Eng. Optim. 30(2), 91\u2013123 (1998)","journal-title":"Eng. Optim."},{"key":"30_CR9","doi-asserted-by":"publisher","first-page":"1599","DOI":"10.1057\/palgrave.jors.2602305","volume":"58","author":"T Bektas","year":"2007","unstructured":"Bektas, T., Elmastas, S.: Solving school bus routing problems through integer programming. J. Oper. Res. Soc. 58, 1599\u20131604 (2007)","journal-title":"J. Oper. Res. Soc."},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"Bodin, L., Golden, B., Assad, A., Ball, M.: Routing and scheduling of vehicles and crews: the state of the art. Comput. Oper. Res. 10(2), 63\u2013211 (1983)","DOI":"10.1016\/0305-0548(83)90030-8"},{"issue":"4","key":"30_CR11","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.: Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12(4), 568\u2013581 (1964)","journal-title":"Oper. Res."},{"key":"30_CR12","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10479-007-0170-8","volume":"153","author":"JF Cordeau","year":"2007","unstructured":"Cordeau, J.F., Laporte, G.: The dial-a-ride problem: models and algorithms. Ann. Oper. Res. 153, 29\u201347 (2007)","journal-title":"Ann. Oper. Res."},{"key":"30_CR13","doi-asserted-by":"crossref","unstructured":"Cordeau, J.F., Laporte, G., Potvin, J.Y., Savelsbergh, M.W.: Transportation on Demand, vol. 14. Elsevier (2007)","DOI":"10.1016\/S0927-0507(06)14007-4"},{"key":"30_CR14","unstructured":"Cordeau, J.F., Laporte, G., Savelsbergh, M.W., Vigo, D.: Vehicle Routing, vol. 14. Elsevier (2007)"},{"issue":"3","key":"30_CR15","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0305-0548(80)90006-4","volume":"6","author":"G Dulac","year":"1980","unstructured":"Dulac, G., Ferland, J., Forgues, P.: School bus routes generator in urban surroundings. Comput. Oper. Res. 6(3), 199\u2013213 (1980)","journal-title":"Comput. Oper. Res."},{"key":"30_CR16","doi-asserted-by":"crossref","unstructured":"Ellegood, W., Solomon, S., North, J., Campbell, J.: School bus routing problem: Contemporary trends and research directions. Omega 95 (2020)","DOI":"10.1016\/j.omega.2019.03.014"},{"key":"30_CR17","unstructured":"Gurobi Optimization: Gurobi Optimizer Reference Manual (2019)"},{"issue":"1","key":"30_CR18","doi-asserted-by":"publisher","first-page":"25","DOI":"10.3844\/jcssp.2020.25.34","volume":"16","author":"A Jaradat","year":"2020","unstructured":"Jaradat, A., Shatnawi, M.: Solving school bus routing problem by intelligent water drops algorithm. J. Comput. Sci. 16(1), 25\u201334 (2020)","journal-title":"J. Comput. Sci."},{"key":"30_CR19","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-030-68154-8_28","volume-title":"Intelligent Computing and Optimization","author":"A Lekburapa","year":"2021","unstructured":"Lekburapa, A., Boonperm, A., Sintunavarat, W.: A new integer programming model for solving a school bus routing problem with the student assignment. In: Vasant, P., Zelinka, I., Weber, G.-W. (eds.) ICO 2020. AISC, vol. 1324, pp. 287\u2013296. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-68154-8_28"},{"key":"30_CR20","doi-asserted-by":"crossref","unstructured":"Ozmen, M., Sahin, H.: Real-time optimization of school bus routing problem in smart cities using genetic algorithm. In: 6th International Conference on Inventive Computation Technologies (ICICT), pp. 1152\u20131158 (2021)","DOI":"10.1109\/ICICT50816.2021.9358666"},{"key":"30_CR21","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1057\/palgrave.jors.2600924","volume":"51","author":"D Sariklis","year":"2000","unstructured":"Sariklis, D., Powell, D.: A heuristic method for the open vehicle routing problem. J. Oper. Res. Soc. 51, 564\u2013573 (2000)","journal-title":"J. Oper. Res. Soc."}],"container-title":["Lecture Notes in Computer Science","Computational Logistics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-87672-2_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,21]],"date-time":"2021-09-21T21:10:54Z","timestamp":1632258654000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-87672-2_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030876715","9783030876722"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-87672-2_30","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":"22 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Logistics","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":"26 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccl22021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccl2021.nl\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"111","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":"42","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":"38% - 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":"2.5","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":"2","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)"}}]}}