{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:26:51Z","timestamp":1742912811914,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031084201"},{"type":"electronic","value":"9783031084218"}],"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.springer.com\/tdm"},{"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.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-08421-8_47","type":"book-chapter","created":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T21:02:38Z","timestamp":1658178158000},"page":"689-699","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Solving the Dial-a-Ride Problem Using an Adapted Genetic Algorithm"],"prefix":"10.1007","author":[{"given":"Stjepan","family":"Zeli\u0107","sequence":"first","affiliation":[]},{"given":"Marko","family":"\u0110urasevi\u0107","sequence":"additional","affiliation":[]},{"given":"Domagoj","family":"Jakobovi\u0107","sequence":"additional","affiliation":[]},{"given":"Lucija","family":"Planini\u0107","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,7,19]]},"reference":[{"key":"47_CR1","doi-asserted-by":"publisher","unstructured":"Baker, B.M., Ayechew, M.: A genetic algorithm for the vehicle routing problem. Comput. Oper. Res. 30(5), 787\u2013800 (2003). https:\/\/doi.org\/10.1016\/S0305-0548(02)00051-5. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0305054802000515","DOI":"10.1016\/S0305-0548(02)00051-5"},{"key":"47_CR2","doi-asserted-by":"publisher","unstructured":"Burke, E.K., Curtois, T., Post, G., Qu, R., Veltman, B.: A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem. Eur. J. Oper. Res. 188(2), 330\u2013341 (2008). https:\/\/doi.org\/10.1016\/j.ejor.2007.04.030. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0377221707004390","DOI":"10.1016\/j.ejor.2007.04.030"},{"key":"47_CR3","unstructured":"Busing, C., Comis, M., Rauh, F.: The dial-a-ride problem in primary care with flexible scheduling (2021)"},{"key":"47_CR4","doi-asserted-by":"publisher","unstructured":"Cordeau, J.F., Laporte, G.: A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transp. Res. Part B: Methodol. 37(6), 579\u2013594 (2003). https:\/\/doi.org\/10.1016\/S0191-2615(02)00045-0. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0191261502000450","DOI":"10.1016\/S0191-2615(02)00045-0"},{"key":"47_CR5","doi-asserted-by":"publisher","unstructured":"Cordeau, J.F., Laporte, G.: The dial-a-ride problem (DARP): models and algorithms. Ann. OR 153, 29\u201346 (2007). https:\/\/doi.org\/10.1007\/s10479-007-0170-8","DOI":"10.1007\/s10479-007-0170-8"},{"key":"47_CR6","doi-asserted-by":"publisher","unstructured":"Cubillos, C., Rodriguez, N., Crawford, B.: A study on genetic algorithms for the DARP problem, pp. 498\u2013507 (2007). https:\/\/doi.org\/10.1007\/978-3-540-73053-8_50","DOI":"10.1007\/978-3-540-73053-8_50"},{"key":"47_CR7","doi-asserted-by":"publisher","unstructured":"Dong, X., Rey, D., Waller, S.T.: Dial-a-ride problem with users\u2019 accept\/reject decisions based on service utilities. Transp. Res. Rec. 2674(10), 55\u201367 (2020). https:\/\/doi.org\/10.1177\/0361198120940307. https:\/\/doi.org\/10.1177\/0361198120940307","DOI":"10.1177\/0361198120940307"},{"key":"47_CR8","doi-asserted-by":"publisher","unstructured":"Jaw, J.J., Odoni, A.R., Psaraftis, H.N., Wilson, N.H.: A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows. Transp. Res. Part B: Methodol. 20(3), 243\u2013257 (1986). https:\/\/doi.org\/10.1016\/0191-2615(86)90020-2. https:\/\/www.sciencedirect.com\/science\/article\/pii\/0191261586900202","DOI":"10.1016\/0191-2615(86)90020-2"},{"key":"47_CR9","doi-asserted-by":"publisher","unstructured":"Jorgensen, R., Larsen, J., Bergvinsdottir, K.: Solving the dial-a-ride problem using genetic algorithms. J. Oper. Res. Soc. 58 (2007). https:\/\/doi.org\/10.1057\/palgrave.jors.2602287","DOI":"10.1057\/palgrave.jors.2602287"},{"key":"47_CR10","doi-asserted-by":"publisher","unstructured":"Baugh Jr, J.W., Kakivaya, G.K.R., Stone, J.R.: Intractability of the dial-a-ride problem and a multiobjective solution using simulated annealing. Eng. Optimiz. 30(2), 91\u2013123 (1998). https:\/\/doi.org\/10.1080\/03052159808941240. https:\/\/doi.org\/10.1080\/03052159808941240","DOI":"10.1080\/03052159808941240"},{"key":"47_CR11","doi-asserted-by":"publisher","unstructured":"Lois, A., Ziliaskopoulos, A.: Online algorithm for dynamic dial a ride problem and its metrics. Transp. Res. Proc. 24, 377\u2013384 (2017). https:\/\/doi.org\/10.1016\/j.trpro.2017.05.097. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S2352146517303782. 3rd Conference on Sustainable Urban Mobility, 3rd CSUM 2016, 26\u201327 May 2016, Volos, Greece","DOI":"10.1016\/j.trpro.2017.05.097"},{"key":"47_CR12","doi-asserted-by":"publisher","unstructured":"Masson, R., Lehu\u00e9d\u00e9, F., P\u00e9ton, O.: The dial-a-ride problem with transfers. Comput. Oper. Res. 41, 12\u201323 (2014). https:\/\/doi.org\/10.1016\/j.cor.2013.07.020. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0305054813001998","DOI":"10.1016\/j.cor.2013.07.020"},{"key":"47_CR13","doi-asserted-by":"publisher","unstructured":"Pandi, R.R., Ho, S.G., Nagavarapu, S.C., Tripathy, T., Dauwels, J.: GPU-accelerated tabu search algorithm for dial-a-ride problem. In: 2018 21st International Conference on Intelligent Transportation Systems (ITSC), pp. 2519\u20132524 (2018). https:\/\/doi.org\/10.1109\/ITSC.2018.8569472","DOI":"10.1109\/ITSC.2018.8569472"},{"key":"47_CR14","doi-asserted-by":"publisher","unstructured":"Picek, S., Jakobovic, D., Miller, J.F., Batina, L., Cupic, M.: Cryptographic Boolean functions: one output, many design criteria. Appl. Soft Comput. 40, 635\u2013653 (2016). https:\/\/doi.org\/10.1016\/j.asoc.2015.10.066. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S1568494615007103","DOI":"10.1016\/j.asoc.2015.10.066"},{"key":"47_CR15","doi-asserted-by":"publisher","unstructured":"Urra, E., Cubillos, C., Cabrera-Paniagua, D.: A hyperheuristic for the dial-a-ride problem with time windows 2015, 1\u201312 (2015). https:\/\/doi.org\/10.1155\/2015\/707056. https:\/\/doi.org\/10.1155\/2015\/707056","DOI":"10.1155\/2015\/707056"},{"key":"47_CR16","doi-asserted-by":"publisher","unstructured":"Vla\u0161i\u0107, I., \u0110\u0110urasevi\u0107, M., Jakobovi\u0107, D.: A comparative study of solution representations for the unrelated machines environment. Comput. Oper. Res. 123, 105005 (2020). https:\/\/doi.org\/10.1016\/j.cor.2020.105005. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0305054820301222","DOI":"10.1016\/j.cor.2020.105005"}],"container-title":["Lecture Notes in Computer Science","AIxIA 2021 \u2013 Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-08421-8_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T21:09:28Z","timestamp":1658178568000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-08421-8_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031084201","9783031084218"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-08421-8_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"19 July 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AIxIA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference of the Italian Association for 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":"1 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 December 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":"aiia2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/aixia2021.disco.unimib.it\/","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":"58","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":"36","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":"62% - 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","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)"}}]}}