{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:54:19Z","timestamp":1743044059040,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030387518"},{"type":"electronic","value":"9783030387525"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-38752-5_14","type":"book-chapter","created":{"date-parts":[[2020,1,7]],"date-time":"2020-01-07T15:02:41Z","timestamp":1578409361000},"page":"171-184","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Novel Car-Pooling Optimization Method Using Ant Colony Optimization Based on Network Analysis (Case Study: Tehran)"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1605-6941","authenticated-orcid":false,"given":"Mojtaba","family":"Davoodi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5211-0664","authenticated-orcid":false,"given":"Saeed","family":"Hasani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,1,8]]},"reference":[{"key":"14_CR1","unstructured":"B\u00f6ckmann, M.: The shared economy: it is time to start caring about sharing; value creating factors in the shared economy. Univ. Twente Fac. Manag. Gov. 350 (2013)"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/j.trpro.2016.05.018","volume":"13","author":"S Fahnenschreiber","year":"2016","unstructured":"Fahnenschreiber, S., G\u00fcndling, F., Keyhani, M.H., Schnee, M.: A multi-modal routing approach combining dynamic ride-sharing and public transport. Transp. Res. Procedia 13, 176\u2013183 (2016)","journal-title":"Transp. Res. Procedia"},{"issue":"7","key":"14_CR3","first-page":"234","volume":"31","author":"X Wei","year":"2016","unstructured":"Wei, X., Dai, J., Sun, B.: Routing for taxi-pooling problem based on ant colony optimization algorithm. Rev. Fac. Ing. U. C. 31(7), 234\u2013246 (2016)","journal-title":"Rev. Fac. Ing. U. C."},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.trc.2015.07.016","volume":"64","author":"M Nourinejad","year":"2016","unstructured":"Nourinejad, M., Roorda, M.J.: Agent based model for dynamic ridesharing. Transp. Res. Part C Emerg. Technol. 64, 117\u2013132 (2016)","journal-title":"Transp. Res. Part C Emerg. Technol."},{"issue":"2","key":"14_CR5","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1007\/s10878-016-0015-y","volume":"32","author":"C Huang","year":"2016","unstructured":"Huang, C., Zhang, D., Si, Y.W., Leung, S.C.: Tabu search for the real-world carpooling problem. J. Comb. Optim. 32(2), 492\u2013512 (2016)","journal-title":"J. Comb. Optim."},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/j.tranpol.2015.10.004","volume":"45","author":"L Rayle","year":"2016","unstructured":"Rayle, L., Dai, D., Chan, N., Cervero, R., Shaheen, S.: Just a better taxi? A survey-based comparison of taxis, transit, and ridesourcing services in San Francisco. Transp. Policy 45, 168\u2013178 (2016)","journal-title":"Transp. Policy"},{"issue":"19","key":"14_CR7","doi-asserted-by":"publisher","first-page":"6728","DOI":"10.1016\/j.eswa.2015.04.060","volume":"42","author":"DO Santos","year":"2015","unstructured":"Santos, D.O., Xavier, E.C.: Taxi and ride sharing: A dynamic dial-a-ride problem with money as an incentive. Expert Syst. Appl. 42(19), 6728\u20136737 (2015)","journal-title":"Expert Syst. Appl."},{"key":"14_CR8","unstructured":"Zhan, X., Szeto, W.Y., Sam, S.: An artificial bee colony algorithm for the dynamic taxi sharing problem (No. 19-03116) (2019)"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.cor.2017.08.016","volume":"90","author":"M Stiglic","year":"2018","unstructured":"Stiglic, M., Agatz, N., Savelsbergh, M., Gradisar, M.: Enhancing urban mobility: integrating ride-sharing and public transit. Comput. Oper. Res. 90, 12\u201321 (2018)","journal-title":"Comput. Oper. Res."},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/j.trc.2019.01.019","volume":"101","author":"A Simonetto","year":"2019","unstructured":"Simonetto, A., Monteil, J., Gambella, C.: Real-time city-scale ridesharing via linear assignment problems. Transp. Res. Part C Emerg. Technol. 101, 208\u2013232 (2019)","journal-title":"Transp. Res. Part C Emerg. Technol."},{"issue":"1","key":"14_CR11","doi-asserted-by":"publisher","first-page":"994","DOI":"10.1109\/JSYST.2018.2795255","volume":"13","author":"SC Huang","year":"2018","unstructured":"Huang, S.C., Jiau, M.K., Liu, Y.P.: An ant path-oriented carpooling allocation approach to optimize the carpool service problem with time windows. IEEE Syst. J. 13(1), 994\u20131005 (2018)","journal-title":"IEEE Syst. J."},{"issue":"3","key":"14_CR12","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0191-2615(80)90008-9","volume":"14","author":"HJ Zuylen Van","year":"1980","unstructured":"Van Zuylen, H.J., Willumsen, L.G.: The most likely trip matrix estimated from traffic counts. Transp. Res. Part B Methodol. 14(3), 281\u2013293 (1980)","journal-title":"Transp. Res. Part B Methodol."},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"129","DOI":"10.5194\/isprsarchives-XL-1-W5-129-2015","volume":"1","author":"M Davoodi","year":"2015","unstructured":"Davoodi, M., Mesgari, M.S.: GIS-based route finding using ant colony optimization and urban traffic data from different sources. Int. Arch. Photogrammetry Remote Sens. Spat. Inf. Sci. 1, 129\u2013133 (2015)","journal-title":"Int. Arch. Photogrammetry Remote Sens. Spat. Inf. Sci."},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Claes, R., Holvoet, T.: Ant colony optimization applied to route planning using link travel time predictions. In: 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum, pp. 358\u2013365 (2011)","DOI":"10.1109\/IPDPS.2011.173"},{"issue":"6","key":"14_CR15","doi-asserted-by":"publisher","first-page":"2193","DOI":"10.1016\/j.physa.2011.12.004","volume":"391","author":"A Lipowski","year":"2012","unstructured":"Lipowski, A., Lipowska, D.: Roulette-wheel selection via stochastic acceptance. Phys. Stat. Mech. Appl. 391(6), 2193\u20132196 (2012)","journal-title":"Phys. Stat. Mech. Appl."}],"container-title":["Communications in Computer and Information Science","Applied Computing to Support Industry: Innovation and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-38752-5_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T11:11:07Z","timestamp":1578654667000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-38752-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030387518","9783030387525"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-38752-5_14","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"8 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACRIT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applied Computing to Support Industry: Innovation and Technology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ramadi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Iraq","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":"15 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acrit2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.acritt.org.uk\/wp\/acrit-conferences\/","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":"EDAS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"159","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":"38","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":"1","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":"24% - 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)"}}]}}