{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T03:44:17Z","timestamp":1761709457766,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319936970"},{"type":"electronic","value":"9783319936987"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-93698-7_8","type":"book-chapter","created":{"date-parts":[[2018,6,11]],"date-time":"2018-06-11T19:30:25Z","timestamp":1528745425000},"page":"98-113","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Hybrid Genetic Algorithm for an On-Demand First Mile Transit System Using Electric Vehicles"],"prefix":"10.1007","author":[{"given":"Thilina","family":"Perera","sequence":"first","affiliation":[]},{"given":"Alok","family":"Prakash","sequence":"additional","affiliation":[]},{"given":"Chathura Nagoda","family":"Gamage","sequence":"additional","affiliation":[]},{"given":"Thambipillai","family":"Srikanthan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,6,12]]},"reference":[{"key":"8_CR1","unstructured":"Google Maps APIs: Build the next generation of location experiences. https:\/\/developers.google.com\/maps\/"},{"key":"8_CR2","unstructured":"IBM ILOG CPLEX Optimization Studio. https:\/\/ibm.co\/2vXgzRC"},{"key":"8_CR3","unstructured":"American Public Transportation Association: Public Transportation Benefits (2017). http:\/\/www.apta.com\/mediacenter\/ptbenefits\/Pages\/default.aspx"},{"key":"8_CR4","first-page":"391","volume-title":"Lecture Notes in Economics and Mathematical Systems","author":"R. Bornd\u00f6rfer","year":"1999","unstructured":"Bornd\u00f6rfer, R., et al.: Telebus Berlin: vehicle scheduling in a dial-a-ride system (1999)"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Cao, B., et al.: SHAREK: a scalable dynamic ride sharing system. In: MDM (2015)","DOI":"10.1109\/MDM.2015.12"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-642-19934-9_29","volume-title":"Advances in Intelligent and Soft Computing","author":"Roberto Carballedo","year":"2011","unstructured":"Carballedo, R., et al.: A new evolutionary hybrid algorithm to solve demand responsive transportation problems. In: Abraham, A., Corchado, J.M., Gonz\u00e1lez, S.R., De Paz Santana, J.F. (eds) International Symposium on Distributed Computing and Artificial Intelligence. AINSC, vol. 91, pp. 233\u2013240. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19934-9_29"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Chevrier, R., et al.: Comparison of three algorithms for solving the convergent demand responsive transportation problem. In: ITSC (2006)","DOI":"10.1109\/ITSC.2006.1707368"},{"issue":"4","key":"8_CR8","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.W.: Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12(4), 568\u2013581 (1964)","journal-title":"Oper. Res."},{"issue":"3","key":"8_CR9","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1287\/opre.1060.0283","volume":"54","author":"JF Cordeau","year":"2006","unstructured":"Cordeau, J.F.: A branch-and-cut algorithm for the dial-a-ride problem. Oper. Res. 54(3), 573\u2013586 (2006)","journal-title":"Oper. Res."},{"issue":"2","key":"8_CR10","first-page":"89","volume":"1","author":"JF Cordeau","year":"2003","unstructured":"Cordeau, J.F., Laporte, G.: The Dial-A-Ride Problem (DARP): variants, modeling issues and algorithms. Q. J. Belg. Fr. Ital. Oper. Res. Soc. 1(2), 89\u2013101 (2003)","journal-title":"Q. J. Belg. Fr. Ital. Oper. Res. Soc."},{"issue":"6","key":"8_CR11","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1016\/S0191-2615(02)00045-0","volume":"37","author":"J Cordeau","year":"2003","unstructured":"Cordeau, J., 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)","journal-title":"Transp. Res. Part B: Methodol."},{"key":"8_CR12","unstructured":"TUM CREATE: The last mile problem (2012). http:\/\/bit.ly\/2qKpCaY"},{"issue":"3\u20134","key":"8_CR13","first-page":"301","volume":"6","author":"J Desrosiers","year":"1986","unstructured":"Desrosiers, J., et al.: A dynamic programming solution of the large-scale single-vehicle dial-a-ride problem with time windows. Am. J. Math. Manag. Sci. 6(3\u20134), 301\u2013325 (1986)","journal-title":"Am. J. Math. Manag. Sci."},{"issue":"6","key":"8_CR14","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1016\/j.trb.2003.07.001","volume":"38","author":"M Diana","year":"2004","unstructured":"Diana, M., Dessouky, M.M.: A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows. Transp. Res. Part B: Methodol. 38(6), 539\u2013557 (2004)","journal-title":"Transp. Res. Part B: Methodol."},{"issue":"1","key":"8_CR15","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1080\/01441647.2015.1033036","volume":"36","author":"F Elliot","year":"2016","unstructured":"Elliot, F.: Bikeshare: a review of recent literature. Transp. Rev. 36(1), 92\u2013113 (2016)","journal-title":"Transp. Rev."},{"key":"8_CR16","doi-asserted-by":"publisher","first-page":"1641","DOI":"10.1016\/S0167-8191(01)00103-X","volume":"27","author":"M Gendreau","year":"2001","unstructured":"Gendreau, M., et al.: A dynamic model and parallel tabu search heuristic for real-time ambulance relocation. Parallel Comput. 27, 1641\u20131653 (2001)","journal-title":"Parallel Comput."},{"issue":"3","key":"8_CR17","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.trc.2006.03.002","volume":"14","author":"M Gendreau","year":"2006","unstructured":"Gendreau, M., et al.: Neighborhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries. Transp. Res. Part C Emerg. Technol. 14(3), 157\u2013174 (2006)","journal-title":"Transp. Res. Part C Emerg. Technol."},{"key":"8_CR18","unstructured":"Gibson, A.: Eliminating Public Transit\u2019s First-Mile\/Last-Mile Problem (2016). http:\/\/bit.ly\/2mgw6sm"},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"Gonzlez, M., et al.: Using genetic algorithms for maximizing technical efficiency in data envelopment analysis. Procedia Comput. Sci. 51(C), 374\u2013383 (2015)","DOI":"10.1016\/j.procs.2015.05.257"},{"issue":"3","key":"8_CR20","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0191-2615(86)90020-2","volume":"20","author":"JJ Jaw","year":"1986","unstructured":"Jaw, J.J., et al.: 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)","journal-title":"Transp. Res. Part B: Methodol."},{"issue":"10","key":"8_CR21","doi-asserted-by":"publisher","first-page":"1321","DOI":"10.1057\/palgrave.jors.2602287","volume":"58","author":"RM Jorgensen","year":"2007","unstructured":"Jorgensen, R.M., et al.: Solving the dial-a-ride problem using genetic algorithms. J. Oper. Res. Soc. 58(10), 1321\u20131331 (2007)","journal-title":"J. Oper. Res. Soc."},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"Lesh, M.C.: Innovative concepts in first-last mile connections to public transportation. In: International Conference on Urban Public Transportation Systems (2013)","DOI":"10.1061\/9780784413210.007"},{"key":"8_CR23","unstructured":"Logan, S., et al.: First and Last Mile Connections: New Mobility (2016). http:\/\/on.nrdc.org\/2utPxUd"},{"key":"8_CR24","unstructured":"MIT: Welcome to MIT Real-Time Rideshare Research (2010). http:\/\/ridesharechoices.scripts.mit.edu\/home\/"},{"key":"8_CR25","doi-asserted-by":"crossref","unstructured":"Osaba, E., et al.: An asymmetric multiple traveling salesman problem with backhauls to solve a dial-a-ride problem. In: SAMI (2015)","DOI":"10.1109\/SAMI.2015.7061865"},{"key":"8_CR26","doi-asserted-by":"crossref","unstructured":"Perera, T., et al.: A scalable heuristic algorithm for demand responsive transportation for first mile transit. In: INES (2017)","DOI":"10.1109\/INES.2017.8118547"},{"issue":"2","key":"8_CR27","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1287\/trsc.14.2.130","volume":"14","author":"HN Psaraftis","year":"1980","unstructured":"Psaraftis, H.N.: A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem. Transp. Sci. 14(2), 130\u2013154 (1980)","journal-title":"Transp. Sci."},{"issue":"1","key":"8_CR28","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1002\/net.21628","volume":"67","author":"HN Psaraftis","year":"2016","unstructured":"Psaraftis, H.N., et al.: Dynamic vehicle routing problems: three decades and counting. Networks 67(1), 3\u201331 (2016)","journal-title":"Networks"},{"issue":"5","key":"8_CR29","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1016\/j.engappai.2005.12.013","volume":"19","author":"B Rekiek","year":"2006","unstructured":"Rekiek, B., et al.: Handicapped person transportation: an application of the grouping genetic algorithm. Eng. Appl. Artif. Intell. 19(5), 511\u2013520 (2006)","journal-title":"Eng. Appl. Artif. Intell."},{"key":"8_CR30","unstructured":"Robyn, D., et al.: Use of personal mobility devices for first-and-last mile travel: the Macquarie Ryde trial. In: ARSC (2015)"},{"key":"8_CR31","unstructured":"Sulopuiso, O.: Why Helsinki\u2019s innovative on-demand bus service failed (2016). http:\/\/bit.ly\/2mkeUDg"},{"issue":"4","key":"8_CR32","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1049\/iet-its.2009.0113","volume":"4","author":"K Tsubouchi","year":"2010","unstructured":"Tsubouchi, K., et al.: Innovative on-demand bus system in Japan. IET Intell. Transp. Syst. 4(4), 270\u2013279 (2010)","journal-title":"IET Intell. Transp. Syst."},{"issue":"4","key":"8_CR33","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1109\/TVT.2002.1015354","volume":"51","author":"K Uchimura","year":"2002","unstructured":"Uchimura, K., et al.: Demand responsive services in hierarchical public transportation system. IEEE Trans. Veh. Technol. 51(4), 760\u2013766 (2002)","journal-title":"IEEE Trans. Veh. Technol."},{"key":"8_CR34","doi-asserted-by":"crossref","unstructured":"Uehara, K., et al.: A proposal of a transport system connecting demand responsive bus with mass transit. In: ICCE (2014)","DOI":"10.1109\/ICCE-TW.2014.6904027"},{"issue":"1","key":"8_CR35","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1587\/transfun.E99.A.310","volume":"E99.A","author":"K Uehara","year":"2016","unstructured":"Uehara, K., et al.: Evaluation of a hierarchical cooperative transport system using demand responsive bus on a dynamic simulation. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E99.A(1), 310\u2013318 (2016)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"issue":"2","key":"8_CR36","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.1016\/j.ejor.2004.09.060","volume":"174","author":"Z Xiang","year":"2006","unstructured":"Xiang, Z., et al.: A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints. Eur. J. Oper. Res. 174(2), 1117\u20131139 (2006)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2018"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-93698-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,11]],"date-time":"2022-06-11T00:03:42Z","timestamp":1654905822000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-93698-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319936970","9783319936987"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-93698-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"12 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wuxi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2018\/","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":"406","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":"148","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":"60","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":"36% - 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":"3","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)"}},{"value":"Acceptance rate in the Main Track is 28%. Acceptance rate in the workshops is 43%.  A high acceptance rate in the workshops is explained by the nature of these thematic sessions, where many experts in a particular field are personally invited by workshop organisers to participate in their sessions.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}