{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:35:44Z","timestamp":1742996144997,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"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_1","type":"book-chapter","created":{"date-parts":[[2018,6,11]],"date-time":"2018-06-11T19:30:25Z","timestamp":1528745425000},"page":"3-14","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Optimizing the Efficiency, Vulnerability and Robustness of Road-Based Para-Transit Networks Using Genetic Algorithm"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0253-452X","authenticated-orcid":false,"given":"Briane Paul V.","family":"Samson","sequence":"first","affiliation":[]},{"given":"Gio Anton T.","family":"Velez","sequence":"additional","affiliation":[]},{"given":"Joseph Ryan","family":"Nobleza","sequence":"additional","affiliation":[]},{"given":"David","family":"Sanchez","sequence":"additional","affiliation":[]},{"given":"Jan Tristan","family":"Milan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,6,12]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","unstructured":"Abad, R.P.B., Fillone, A.M., Dadios, E.P., Roquel, K.I.Z.: An application of genetic algorithm in optimizing Jeepney operations along Taft Avenue, Manila. In: 8th International Conference on Humanoid, Nanotechnology, Information Technology, Communication and Control, Environment and Management, HNICEM 2015 (2016). https:\/\/doi.org\/10.1109\/HNICEM.2015.7393243","DOI":"10.1109\/HNICEM.2015.7393243"},{"key":"1_CR2","unstructured":"Asian Development Bank: Philippines: Transport Sector Assessment, Strategy, and Road Map, p. 18 (2012)"},{"issue":"4","key":"1_CR3","doi-asserted-by":"publisher","first-page":"6","DOI":"10.17645\/up.v1i4.612","volume":"1","author":"M Attard","year":"2016","unstructured":"Attard, M., Haklay, M., Capineri, C.: The potential of volunteered geographic information (VGI) in future transport systems. Urban Plan. 1(4), 6\u201319 (2016). https:\/\/doi.org\/10.17645\/up.v1i4.612","journal-title":"Urban Plan."},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.compenvurbsys.2017.05.004","volume":"65","author":"G Boeing","year":"2017","unstructured":"Boeing, G.: OSMnx: new methods for acquiring, constructing, analyzing, and visualizing complex street networks. Comput. Environ. Urban Syst. 65, 126\u2013139 (2017). https:\/\/doi.org\/10.1016\/j.compenvurbsys.2017.05.004","journal-title":"Comput. Environ. Urban Syst."},{"issue":"12","key":"1_CR5","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1287\/trsc.1050.0127","volume":"39","author":"D Braess","year":"2005","unstructured":"Braess, D., Nagurney, A., Wakolbinger, T.: On a paradox of traffic planning. Transp. Sci. Unternehm. 39(12), 446\u2013450 (2005). https:\/\/doi.org\/10.1287\/trsc.1050.0127","journal-title":"Transp. Sci. Unternehm."},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.trb.2014.04.005","volume":"67","author":"X Di","year":"2014","unstructured":"Di, X., He, X., Guo, X., Liu, H.X.: Braess paradox under the boundedly rational user equilibria. Transp. Res. Part B: Methodol. 67, 86\u2013108 (2014). https:\/\/doi.org\/10.1016\/j.trb.2014.04.005","journal-title":"Transp. Res. Part B: Methodol."},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Jain, V., Sharma, A., Subramanian, L.: Road traffic congestion in the developing world. In: Proceedings of the 2nd ACM Symposium on Computing for Development, pp. 1\u201310. ACM, New York (2012)","DOI":"10.1145\/2160601.2160616"},{"issue":"180","key":"1_CR8","first-page":"41","volume":"80","author":"P Jaramillo-Alvarez","year":"2013","unstructured":"Jaramillo-Alvarez, P., Gonz\u00e1lez-Calder\u00f3n, C., Gonz\u00e1lez-Calder\u00f3n, G.: Route optimization of urban public transportation. Dyna 80(180), 41\u201349 (2013). http:\/\/www.scielo.org.co\/pdf\/dyna\/v80n180\/v80n180a06.pdf","journal-title":"Dyna"},{"issue":"1","key":"1_CR9","doi-asserted-by":"publisher","first-page":"9","DOI":"10.11121\/ijocta.01.2016.00258","volume":"6","author":"A Johar","year":"2016","unstructured":"Johar, A., Jain, S.S., Garg, P.K.: Transit network design and scheduling using genetic algorithm - a review. Int. J. Optim. Control: Theor. Appl. (IJOCTA) 6(1), 9\u201322 (2016). https:\/\/doi.org\/10.11121\/ijocta.01.2016.00258. http:\/\/ijocta.balikesir.edu.tr\/index.php\/files\/article\/view\/258","journal-title":"Int. J. Optim. Control: Theor. Appl. (IJOCTA)"},{"issue":"1","key":"1_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pone.0168762","volume":"12","author":"J Ma","year":"2017","unstructured":"Ma, J., Zhao, Y., Yang, Y., Liu, T., Guan, W., Wang, J., Song, C.: A model for the stop planning and timetables of customized buses. PLoS ONE 12(1), 1\u201328 (2017). https:\/\/doi.org\/10.1371\/journal.pone.0168762","journal-title":"PLoS ONE"},{"key":"1_CR11","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.trc.2014.05.002","volume":"46","author":"MA Nayeem","year":"2014","unstructured":"Nayeem, M.A., Rahman, M.K., Rahman, M.S.: Transit network design by genetic algorithm with elitism. Transp. Res. Part C: Emerg. Technol. 46, 30\u201345 (2014). https:\/\/doi.org\/10.1016\/j.trc.2014.05.002","journal-title":"Transp. Res. Part C: Emerg. Technol."},{"issue":"03","key":"1_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S0129183115500242","volume":"26","author":"JZF Pang","year":"2015","unstructured":"Pang, J.Z.F., Bin Othman, N., Ng, K.M., Monterola, C.: Efficiency and robustness of different bus network designs. Int. J. Mod. Phys. C 26(03), 1\u201315 (2015). https:\/\/doi.org\/10.1142\/S0129183115500242","journal-title":"Int. J. Mod. Phys. C"},{"key":"1_CR13","unstructured":"Schalekamp, H., Behrens, R.: An international review of paratransit regulation and integration experiences: lessons for public transport system rationalisation and improvement in South African cities. In: Proceedings of the 28th Southern African Transport Conference, Pretoria, South Africa, pp. 442\u2013450 (2009)"},{"key":"1_CR14","unstructured":"Takakura, M., Furuta, T., Tanaka, M.S.: Urban bus network design using genetic algorithm and map information. In: Proceedings of the Eastern Asia Society for Transportation Studies 2015, pp. 1\u201313 (2015)"}],"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_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,11]],"date-time":"2022-06-11T00:03:24Z","timestamp":1654905804000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-93698-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319936970","9783319936987"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-93698-7_1","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"}]}}