{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T14:38:33Z","timestamp":1784644713222,"version":"3.55.0"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031605963","type":"print"},{"value":"9783031605970","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-60597-0_1","type":"book-chapter","created":{"date-parts":[[2024,5,27]],"date-time":"2024-05-27T14:04:39Z","timestamp":1716818679000},"page":"1-16","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Online Optimization of\u00a0a\u00a0Dial-a-Ride Problem with\u00a0the\u00a0Integral Primal Simplex"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-5905-2237","authenticated-orcid":false,"given":"Elahe","family":"Amiri","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2903-9593","authenticated-orcid":false,"given":"Antoine","family":"Legrain","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0778-2503","authenticated-orcid":false,"given":"Issma\u00efl","family":"El Hallaoui","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,5,25]]},"reference":[{"issue":"3","key":"1_CR1","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1073\/pnas.1611675114","volume":"114","author":"J Alonso-Mora","year":"2017","unstructured":"Alonso-Mora, J., Samaranayake, S., Wallar, A., Frazzoli, E., Rus, D.: On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment. Proc. Natl. Acad. Sci. 114(3), 462\u2013467 (2017). https:\/\/doi.org\/10.1073\/pnas.1611675114","journal-title":"Proc. Natl. Acad. Sci."},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1007\/978-3-030-19212-9_31","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"C Riley","year":"2019","unstructured":"Riley, C., Legrain, A., Van Hentenryck, P.: Column generation for real-time ride-sharing operations. In: Rousseau, L.-M., Stergiou, K. (eds.) CPAIOR 2019. LNCS, vol. 11494, pp. 472\u2013487. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-19212-9_31"},{"issue":"1","key":"1_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.: The dial-a-ride problem: models and algorithms. Ann. Oper. Res. 153(1), 29\u201346 (2007). https:\/\/doi.org\/10.1007\/s10479-007-0170-8","journal-title":"Ann. Oper. Res."},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/j.trb.2018.02.001","volume":"111","author":"SC Ho","year":"2018","unstructured":"Ho, S.C., Szeto, W.Y., Kuo, Y.-H., Leung, J.M.Y., Petering, M., Tou, T.W.H.: A survey of dial-a-ride problems: literature review and recent developments. Transp. Res. Part B Methodol. 111, 395\u2013421 (2018). https:\/\/doi.org\/10.1016\/j.trb.2018.02.001","journal-title":"Transp. Res. Part B Methodol."},{"key":"1_CR5","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.: Typology and literature review for dial-a-ride problems. Ann. Oper. Res. 259, 295\u2013325 (2017). https:\/\/doi.org\/10.1007\/s10479-017-2525-0","journal-title":"Ann. Oper. Res."},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/j.trpro.2017.05.097","volume":"24","author":"A Lois","year":"2017","unstructured":"Lois, A., Ziliaskopoulos, A.: Online algorithm for dynamic dial a ride problem and its metrics. Transp. Res. Procedia 24, 377\u2013384 (2017). https:\/\/doi.org\/10.1016\/j.trpro.2017.05.097","journal-title":"Transp. Res. Procedia"},{"issue":"1","key":"1_CR7","doi-asserted-by":"publisher","first-page":"59","DOI":"10.3141\/2218-07","volume":"2218","author":"Y Luo","year":"2011","unstructured":"Luo, Y., Schonfeld, P.: Online rejected-reinsertion heuristics for dynamic multivehicle dial-a-ride problem. Transp. Res. Rec. 2218(1), 59\u201367 (2011)","journal-title":"Transp. Res. Rec."},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1016\/j.trpro.2017.12.131","volume":"27","author":"P Carotenuto","year":"2017","unstructured":"Carotenuto, P., Martis, F.: A double dynamic fast algorithm to solve multi-vehicle dial a ride problem. Transp. Res. Procedia 27, 632\u2013639 (2017). https:\/\/doi.org\/10.1016\/j.trpro.2017.12.131","journal-title":"Transp. Res. Procedia"},{"issue":"1","key":"1_CR9","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1287\/opre.2018.1763","volume":"67","author":"D Bertsimas","year":"2019","unstructured":"Bertsimas, D., Jaillet, P., Martin, S.: Online vehicle routing: the edge of optimization in large-scale applications. Oper. Res. 67(1), 143\u2013162 (2019). https:\/\/doi.org\/10.1287\/opre.2018.1763","journal-title":"Oper. Res."},{"key":"1_CR10","unstructured":"New York City Taxi and Limousine Commission: Trip record data, 2021 (2021). https:\/\/www1.nyc.gov\/site\/tlc\/about\/tlc-trip-record-data.page"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Riley, C., Van Hentenryck, P., Yuan, E.: Real-time dispatching of large-scale ride-sharing systems: integrating optimization, machine learning, and model predictive control. arXiv preprint arXiv:2003.10942 (2020)","DOI":"10.24963\/ijcai.2020\/609"},{"issue":"1","key":"1_CR12","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1287\/opre.23.1.74","volume":"23","author":"E Balas","year":"1975","unstructured":"Balas, E., Padberg, M.: On the set-covering problem: II. An algorithm for set partitioning. Oper. Res. 23(1), 74\u201390 (1975)","journal-title":"Oper. Res."},{"issue":"2","key":"1_CR13","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1287\/opre.2013.1247","volume":"62","author":"A Zaghrouti","year":"2014","unstructured":"Zaghrouti, A., Soumis, F., El Hallaoui, I.: Integral simplex using decomposition for the set partitioning problem. Oper. Res. 62(2), 435\u2013449 (2014). https:\/\/doi.org\/10.1287\/opre.2013.1247","journal-title":"Oper. Res."},{"key":"1_CR14","doi-asserted-by":"publisher","unstructured":"Rosat, S., Elhallaoui, I., Soumis, F., Lodi, A.: Integral simplex using decomposition with primal cuts. In: International Symposium on Experimental Algorithms, vol. 166, pp. 22\u201333 (2017). https:\/\/doi.org\/10.1007\/s10107-017-1123-x","DOI":"10.1007\/s10107-017-1123-x"},{"issue":"2","key":"1_CR15","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1007\/s10479-018-2868-1","volume":"284","author":"A Zaghrouti","year":"2020","unstructured":"Zaghrouti, A., El Hallaoui, I., Soumis, F.: Improving set partitioning problem solutions by zooming around an improving direction. Ann. Oper. Res. 284(2), 645\u2013671 (2020). https:\/\/doi.org\/10.1007\/s10479-018-2868-1","journal-title":"Ann. Oper. Res."},{"issue":"5","key":"1_CR16","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1007\/s13676-019-00145-6","volume":"8","author":"A Tahir","year":"2019","unstructured":"Tahir, A., Desaulniers, G., El Hallaoui, I.: Integral column generation for the set partitioning problem. EURO J. Transp. Logist. 8(5), 713\u2013744 (2019). https:\/\/doi.org\/10.1007\/s13676-019-00145-6","journal-title":"EURO J. Transp. Logist."},{"issue":"4","key":"1_CR17","doi-asserted-by":"publisher","first-page":"2313","DOI":"10.1287\/ijoc.2022.1174","volume":"34","author":"A Tahir","year":"2022","unstructured":"Tahir, A., Desaulniers, G., El Hallaoui, I.: Integral column generation for set partitioning problems with side constraints. INFORMS J. Comput. 34(4), 2313\u20132331 (2022). https:\/\/doi.org\/10.1287\/ijoc.2022.1174","journal-title":"INFORMS J. Comput."},{"key":"1_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-030-53262-8_24","volume-title":"Combinatorial Optimization","author":"M Messaoudi","year":"2020","unstructured":"Messaoudi, M., El Hallaoui, I., Rousseau, L.-M., Tahir, A.: Solving a real-world multi-attribute VRP using a primal-based approach. In: Ba\u00efou, M., Gendron, B., G\u00fcnl\u00fck, O., Mahjoub, A.R. (eds.) ISCO 2020. LNCS, vol. 12176, pp. 286\u2013296. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-53262-8_24"},{"issue":"5","key":"1_CR19","doi-asserted-by":"publisher","first-page":"1191","DOI":"10.1287\/trsc.2017.0798","volume":"52","author":"V Ghilas","year":"2018","unstructured":"Ghilas, V., Cordeau, J.-F., Demir, E., Van Woensel, T.: Branch-and-price for the pickup and delivery problem with time windows and scheduled lines. Transp. Sci. 52(5), 1191\u20131210 (2018). https:\/\/doi.org\/10.1287\/trsc.2017.0798","journal-title":"Transp. Sci."},{"key":"1_CR20","first-page":"1544","volume":"10","author":"V Trubin","year":"1969","unstructured":"Trubin, V.: On a method of solution of integer linear programming problems of a special kind. Sov. Math. Dokl. 10, 1544\u20131546 (1969)","journal-title":"Sov. Math. Dokl."},{"key":"1_CR21","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.dam.2015.12.015","volume":"217","author":"S Rosat","year":"2017","unstructured":"Rosat, S., Elhallaoui, I., Soumis, F., Chakour, D.: Influence of the normalization constraint on the integral simplex using decomposition. Discrete Appl. Math. 217, 53\u201370 (2017). https:\/\/doi.org\/10.1016\/j.dam.2015.12.015","journal-title":"Discrete Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-60597-0_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,27]],"date-time":"2024-05-27T14:04:46Z","timestamp":1716818686000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-60597-0_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031605963","9783031605970"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-60597-0_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"25 May 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CPAIOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Uppsala","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sweden","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/cpaior2024","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}