{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T02:10:57Z","timestamp":1740103857248,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,10,25]],"date-time":"2022-10-25T00:00:00Z","timestamp":1666656000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,10,25]],"date-time":"2022-10-25T00:00:00Z","timestamp":1666656000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100006245","name":"Ministry of Science and Technology, Israel","doi-asserted-by":"publisher","award":["3-12802"],"award-info":[{"award-number":["3-12802"]}],"id":[{"id":"10.13039\/501100006245","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100022770","name":"Israeli Smart Transportation Research Center","doi-asserted-by":"crossref","award":["N\/A"],"award-info":[{"award-number":["N\/A"]}],"id":[{"id":"10.13039\/100022770","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2023,10]]},"DOI":"10.1007\/s10951-022-00757-3","type":"journal-article","created":{"date-parts":[[2022,10,25]],"date-time":"2022-10-25T13:02:45Z","timestamp":1666702965000},"page":"479-495","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Graph representation of the fixed route dial-a-ride problem"],"prefix":"10.1007","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4106-3169","authenticated-orcid":false,"given":"Tal","family":"Grinshpoun","sequence":"first","affiliation":[]},{"given":"Elad","family":"Shufan","sequence":"additional","affiliation":[]},{"given":"Hagai","family":"Ilani","sequence":"additional","affiliation":[]},{"given":"Vadim","family":"Levit","sequence":"additional","affiliation":[]},{"given":"Haya","family":"Brama","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,25]]},"reference":[{"issue":"10","key":"757_CR1","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1145\/1562764.1562783","volume":"52","author":"K Asanovic","year":"2009","unstructured":"Asanovic, K., Bodik, R., Demmel, J., Keaveny, T., Keutzer, K., Kubiatowicz, John, Morgan, Nelson, Patterson, David, Sen, Koushik, Wawrzynek, John, et al. (2009). A view of the parallel computing landscape. Communications of the ACM, 52(10), 56\u201367.","journal-title":"Communications of the ACM"},{"issue":"3","key":"757_CR2","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1287\/ijoc.1110.0454","volume":"24","author":"G Berbeglia","year":"2012","unstructured":"Berbeglia, G., Cordeau, J.-F., & Laporte, G. (2012). A hybrid tabu search and constraint programming algorithm for the dynamic dial-a-ride problem. INFORMS Journal on Computing, 24(3), 343\u2013355.","journal-title":"INFORMS Journal on Computing"},{"issue":"1","key":"757_CR3","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10479-007-0170-8","volume":"153","author":"J-F Cordeau","year":"2007","unstructured":"Cordeau, J.-F., & Laporte, G. (2007). The dial-a-ride problem: models and algorithms. Annals of Operations Research, 153(1), 29\u201346.","journal-title":"Annals of Operations Research"},{"key":"757_CR4","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2009). Introduction to algorithms. Cambridge: MIT Press."},{"unstructured":"Daichman, S., Bar-Gera, H., & Grinshpoun, T. (2018). Mobility habits and transportation needs of inhabitants of elderly homes in Israel. In 14th international conference on industrial logistics (ICIL).","key":"757_CR5"},{"issue":"2","key":"757_CR6","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1287\/ijoc.1030.0052","volume":"16","author":"WE de Paepe","year":"2004","unstructured":"de Paepe, W. E., Lenstra, J. K., Sgall, J., Sitters, R. A., & Stougie, L. (2004). Computer-aided complexity classification of dial-a-ride problems. INFORMS Journal on Computing, 16(2), 120\u2013132.","journal-title":"INFORMS Journal on Computing"},{"issue":"2","key":"757_CR7","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1287\/trsc.24.2.145","volume":"24","author":"Y Dumas","year":"1990","unstructured":"Dumas, Y., Soumis, F., & Desrosiers, J. (1990). Optimizing the schedule for a fixed vehicle path with convex inconvenience costs. Transportation Science, 24(2), 145\u2013152.","journal-title":"Transportation Science"},{"issue":"1","key":"757_CR8","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.orl.2010.11.004","volume":"39","author":"M Firat","year":"2011","unstructured":"Firat, M., & Woeginger, G. J. (2011). Analysis of the dial-a-ride problem of hunsaker and savelsbergh. Operations Research Letters, 39(1), 32\u201335.","journal-title":"Operations Research Letters"},{"doi-asserted-by":"crossref","unstructured":"Grinshpoun, T., Shufan, E., Ilani, H., Levit, V. & Brama, H. (2021). Effective pruning heuristics for the fixed route dial-a-ride problem. In Proceedings of the 13th international conference on the practice and theory of automated timetabling (PATAT) (vol. 1, pp. 224\u2013242).","key":"757_CR9","DOI":"10.1007\/s10951-022-00757-3"},{"issue":"2","key":"757_CR10","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"Hart, P. E., Nilsson, N. J., & Raphael, B. (1968). A formal basis for the heuristic determination of minimum cost paths. IEEE transactions on Systems Science and Cybernetics, 4(2), 100\u2013107.","journal-title":"IEEE transactions on Systems Science and Cybernetics"},{"issue":"3","key":"757_CR11","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/S0167-6377(02)00120-7","volume":"30","author":"B Hunsaker","year":"2002","unstructured":"Hunsaker, B., & Savelsbergh, M. (2002). Efficient feasibility testing for dial-a-ride problems. Operations research letters, 30(3), 169\u2013173.","journal-title":"Operations research letters"},{"unstructured":"Ilani, H., Shufan, E., & Grinshpoun, T. (2015). A fixed route dial-a-ride problem. In Proceedings of the 7th multidisciplinary international conference on scheduling: theory and applications (MISTA) (pp. 313\u2013324).","key":"757_CR12"},{"issue":"6","key":"757_CR13","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1007\/s10951-013-0348-7","volume":"17","author":"H Ilani","year":"2014","unstructured":"Ilani, H., Shufan, E., Grinshpoun, T., Belulu, A., & Fainberg, A. (2014). A reduction approach to the two-campus transport problem. Journal of Scheduling, 17(6), 587\u2013599.","journal-title":"Journal of Scheduling"},{"issue":"3","key":"757_CR14","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/j.orl.2013.01.007","volume":"41","author":"R Masson","year":"2013","unstructured":"Masson, R., Lehu\u00e9d\u00e9, F., & P\u00e9ton, O. (2013). Efficient feasibility testing for request insertion in the pickup and delivery problem with transfers. Operations Research Letters, 41(3), 211\u2013215.","journal-title":"Operations Research Letters"},{"issue":"1\u20132","key":"757_CR15","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s10479-017-2525-0","volume":"259","author":"Y Molenbruch","year":"2017","unstructured":"Molenbruch, Y., Braekers, K., & Caris, A. (2017). Typology and literature review for dial-a-ride problems. Annals of Operations Research, 259(1\u20132), 295\u2013325.","journal-title":"Annals of Operations Research"},{"issue":"1\u20132","key":"757_CR16","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0004-3702(95)00048-8","volume":"81","author":"P Prosser","year":"1996","unstructured":"Prosser, P. (1996). An empirical study of phase transitions in binary constraint satisfaction problems. Artificial Intelligence, 81(1\u20132), 81\u2013109.","journal-title":"Artificial Intelligence"},{"issue":"6","key":"757_CR17","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/BF01389000","volume":"16","author":"VN Rao","year":"1987","unstructured":"Rao, V. N., & Kumar, V. (1987). Parallel depth first search. part i. implementation. International Journal of Parallel Programming, 16(6), 479\u2013499.","journal-title":"International Journal of Parallel Programming"},{"issue":"5","key":"757_CR18","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0020-0190(85)90024-9","volume":"20","author":"JH Reif","year":"1985","unstructured":"Reif, J. H. (1985). Depth-first search is inherently sequential. Information Processing Letters, 20(5), 229\u2013234.","journal-title":"Information Processing Letters"},{"doi-asserted-by":"crossref","unstructured":"Reinefeld, A. & Schnecke, V. (1994). Work-load balancing in highly parallel depth-first search. In Proceedings of IEEE scalable high performance computing conference (pp. 773\u2013780). IEEE.","key":"757_CR19","DOI":"10.1109\/SHPCC.1994.296719"},{"key":"757_CR20","volume-title":"Artificial intelligence: a modern approach","author":"SJ Russell","year":"2016","unstructured":"Russell, S. J., & Norvig, P. (2016). Artificial intelligence: a modern approach (3rd ed.). Malaysia: Pearson Education Limited.","edition":"3"},{"issue":"5","key":"757_CR21","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/j.orl.2010.05.002","volume":"38","author":"J Tang","year":"2010","unstructured":"Tang, J., Kong, Y., Lau, H., & Ip, A. W. H. (2010). A note on \u201cefficient feasibility testing for dial-a-ride problems\u2019\u2019. Operations Research Letters, 38(5), 405\u2013407.","journal-title":"Operations Research Letters"},{"issue":"2","key":"757_CR22","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1002\/net.21587","volume":"65","author":"T Vidal","year":"2015","unstructured":"Vidal, T., Crainic, Teodor G., Gendreau, M., & Prins, C. (2015). Timing problems and algorithms: Time decisions for sequences of activities. Networks, 65(2), 102\u2013128.","journal-title":"Networks"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-022-00757-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10951-022-00757-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-022-00757-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,16]],"date-time":"2023-09-16T09:07:02Z","timestamp":1694855222000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10951-022-00757-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,25]]},"references-count":22,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["757"],"URL":"https:\/\/doi.org\/10.1007\/s10951-022-00757-3","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"type":"print","value":"1094-6136"},{"type":"electronic","value":"1099-1425"}],"subject":[],"published":{"date-parts":[[2022,10,25]]},"assertion":[{"value":"9 September 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 October 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}