{"type":"ScholarlyArticle","title":"Optimization-driven Demand Prediction Framework for Suburban Dynamic Demand-Responsive Transport Systems","authors":[{"name":"Louis Zigrand","slug":"louis-zigrand","given":"Louis","family":"Zigrand","affiliation":"Research and Development Team , Padam Mobility , Paris , France; LIPN (CNRS -UMR 7030) , Université Sorbonne Paris Nord , Paris , France"},{"name":"Roberto Wolfler Calvo","slug":"roberto-wolfler-calvo","given":"Roberto","family":"Wolfler Calvo","affiliation":"LIPN (CNRS -UMR 7030) , Université Sorbonne Paris Nord , Paris , France"},{"name":"Emiliano Traversi","slug":"emiliano-traversi","given":"Emiliano","family":"Traversi","affiliation":"LIPN (CNRS -UMR 7030) , Université Sorbonne Paris Nord , Paris , France"},{"name":"Pegah Alizadeh","slug":"pegah-alizadeh","given":"Pegah","family":"Alizadeh","affiliation":"LIPN (CNRS -UMR 7030) , Université Sorbonne Paris Nord , Paris , France"}],"abstract":"Demand-Responsive Transport (DRT) has grown over the last decade as an ecological solution to both metropolitan and suburban areas. It provides a more efficient public transport service in metropolitan areas and satisfies the mobility needs in sparse and heterogeneous suburban areas. Traditionally, DRT operators build the plannings of their drivers by relying on myopic insertion heuristics that do not take into account the dynamic nature of such a service. We thus investigate in this work the potential of a Demand Prediction Framework used specifically to build more flexible routes within a Dynamic Dial-a-Ride Problem (DaRP) solver. We show how to obtain a Machine Learning forecasting model that is explicitly designed for optimization purposes. The prediction task is further complicated by the fact that the historical dataset is significantly sparse. We finally show how the predicted travel requests can be integrated within an optimization scheme in order to compute better plannings at the start of the day. Numerical results support the fact that, despite the data sparsity challenge as well as the optimization-driven constraints that result from the DaRP model, such a look-ahead approach can improve up to 3.5% the average insertion rate of an actual DRT service.","doi":"10.24963/ijcai.2023/703","url":"https://ijcai.org/proceedings/2023/703","pdf":"https://ijcai.org/proceedings/2023/0703.pdf","markdown":"https://ijcai.org/proceedings/2023/703.md","bibtex":"https://ijcai.org/proceedings/2023/bibtex/703","volume":{"slug":"2023","title":"Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2023","url":"https://ijcai.org/proceedings/2023/","year":2023,"location":"Macao, SAR","dates":"19-25 August 2023","editors":"Edith Elkind","isbn":"978-1-956792-03-4","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2023"},"section":"AI for Good","track":"AI for Good","number":703,"pages":{"first":6335,"last":6342},"keywords":["AI for Good: Machine Learning","AI for Good: Constraint Satisfaction and Optimization","AI for Good: Planning and Scheduling"],"videos":[],"references":[{"position":1,"raw":"[Agency, 2023] International Energy Agency. Global co2 emissions from transport by subsector, 2000-2030. https://www.iea.org/data-and-statistics/charts/global-co2- emissions-from-transport-by-subsector-2000-2030, 2023. Accessed: 2023-02-23.","title":"International Energy Agency. Global co2 emissions from transport by subsector, 2000-2030","authors":null,"year":"2023","venue":null,"doi":null,"url":"https://www.iea.org/data-and-statistics/charts/global-co2-emissions-from-transport-by-subsector-2000-2030","internal_url":null},{"position":2,"raw":"[Bernardo and Pannek, 2018] Marcella Bernardo and Jürgen Pannek. Robust solution approach for the dynamic and stochastic vehicle routing problem. Journal of Advanced Transportation, 2018, 2018.","title":"Robust solution approach for the dynamic and stochastic vehicle routing problem","authors":"Marcella Bernardo, Jürgen Pannek","year":"2018","venue":"Journal of Advanced Transportation","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Codato and Fischetti, 2006] Gianni Codato and Matteo Fischetti. Combinatorial benders' cuts for mixed-integer linear programming. Operations Research, 54(4):756- 766, 2006.","title":"Combinatorial benders' cuts for mixed-integer linear programming","authors":"Gianni Codato, Matteo Fischetti","year":"2006","venue":"Operations Research","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Cordeau and Laporte, 2007] Jean-Franc ¸ois Cordeau and Gilbert Laporte. The dial-a-ride problem: models and algorithms. Annals of operations research, 153(1):29, 2007.","title":"Jean-Franc ¸ois Cordeau and Gilbert Laporte. The dial-a-ride problem: models and algorithms","authors":"Laporte Cordeau","year":"2007","venue":"Annals of operations research","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Fachini and Armentano, 2020] Ramon Faganello Fachini and Vinícius Amaral Armentano. Logic-based benders decomposition for the heterogeneous fixed fleet vehicle routing problem with time windows. Computers & Industrial Engineering, 148:106641, 2020.","title":"Ramon Faganello Fachini and Vinícius Amaral Armentano. Logic-based benders decomposition for the heterogeneous fixed fleet vehicle routing problem with time windows","authors":"Armentano Fachini","year":"2020","venue":"Computers & Industrial Engineering","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Feigon and Murphy, 2016] Sharon Feigon and Colin Murphy. Shared mobility and the transformation of public transit. Transportation Research Board, 2016.","title":"Shared mobility and the transformation of public transit","authors":"Murphy ; Feigon, Sharon Feigon, Colin Murphy","year":"2016","venue":null,"doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Ferreira et al., 2013] Nivan Ferreira, Jorge Poco, Huy T Vo, Juliana Freire, and Cláudio T Silva. Visual exploration of big spatio-temporal urban data: A study of new york city taxi trips. IEEE transactions on visualization and computer graphics, 19(12):2149-2158, 2013.","title":"Visual exploration of big spatio-temporal urban data: A study of new york city taxi trips","authors":"Ferreira","year":"2013","venue":"IEEE transactions on visualization and computer graphics","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Ho et al., 2018] Sin C Ho, Wai Yuen Szeto, Yong- Hong Kuo, Janny MY Leung, Matthew Petering, and Terence WH Tou. A survey of dial-a-ride problems: Literature review and recent developments. Transportation Research Part B: Methodological, 111:395-421, 2018.","title":"A survey of dial-a-ride problems: Literature review and recent developments","authors":"Ho","year":"2018","venue":"Transportation Research Part B: Methodological","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Hochreiter and Schmidhuber, 1997] Sepp Hochreiter and Jürgen Schmidhuber. Long short-term memory. Neural computation, 9(8):1735-1780, 1997.","title":"Long short-term memory","authors":"Schmidhuber Hochreiter, Sepp Hochreiter, Jürgen Schmidhuber","year":"1997","venue":"Neural computation","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Johnson, 1967] Stephen C Johnson. Hierarchical clustering schemes. Psychometrika, 32(3):241-254, 1967.","title":"Hierarchical clustering schemes","authors":"Johnson Stephen","year":"1967","venue":"Psychometrika","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Liu et al., 2019] Lingbo Liu, Zhilin Qiu, Guanbin Li, Qing Wang, Wanli Ouyang, and Liang Lin. Contextualized spatial-temporal network for taxi origin-destination demand prediction. IEEE Transactions on Intelligent Transportation Systems, 20(10):3875-3887, 2019.","title":"Contextualized spatial-temporal network for taxi origin-destination demand prediction","authors":"Lingbo Liu, Zhilin Qiu, Guanbin Li, Qing Wang, Wanli Ouyang, Liang Lin","year":"2019","venue":"IEEE Transactions on Intelligent Transportation Systems","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Riedler and Raidl, 2018] Martin Riedler and Günther Raidl. Solving a selective dial-a-ride problem with logic- based benders decomposition. Computers & Operations Research, 96:30-54, 2018.","title":"Solving a selective dial-a-ride problem with logicbased benders decomposition","authors":"Martin Riedler, Günther Raidl","year":"2018","venue":"Computers & Operations Research","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Saint-Guillain et al., 2015] Michael Saint-Guillain, Yves Deville, and Christine Solnon. A multistage stochastic programming approach to the dynamic and stochastic vrptw. In Integration of AI and OR Techniques in Constraint Programming: 12th International Conference, CPAIOR 2015, Barcelona, Spain, May 18-22, 2015, Proceedings 12, pages 357-374. Springer, 2015.","title":"A multistage stochastic programming approach to the dynamic and stochastic vrptw","authors":"Michael Saint-Guillain, Yves Deville, Christine Solnon","year":"2015","venue":"Integration of AI and OR Techniques in Constraint Programming: 12th International Conference, CPAIOR 2015","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Tensen, 2015] IF Tensen. Stochastic optimization of the dial-a-ride problem. dealing with variable travel times and irregular arrival of requests in the planning of special transport services. Master's thesis, University of Twente, 2015.","title":"Stochastic optimization of the dial-a-ride problem. dealing with variable travel times and irregular arrival of requests in the planning of special transport services","authors":"; If Tensen, Tensen","year":"2015","venue":null,"doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Tong et al., 2017] Yongxin Tong, Yuqiang Chen, Zimu Zhou, Lei Chen, Jie Wang, Qiang Yang, Jieping Ye, and Weifeng Lv. The simpler the better: a unified approach to predicting original taxi demands based on large-scale online platforms. In Proceedings of the 23rd ACM SIGKDD international conference on knowledge discovery and data mining, pages 1653-1662, 2017.","title":"The simpler the better: a unified approach to predicting original taxi demands based on large-scale online platforms","authors":"Yongxin Tong, Yuqiang Chen, Zimu Zhou, Lei Chen, Jie Wang, Qiang Yang, Jieping Ye, Weifeng Lv","year":"2017","venue":"Proceedings of the 23rd ACM SIGKDD international conference on knowledge discovery and data mining","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Toqué et al., 2016] Florian Toqué, Etienne Côme, Mohamed Khalil El Mahrsi, and Latifa Oukhellou. Forecasting dynamic public transport origin-destination matrices with long-short term memory recurrent neural networks. In 2016 IEEE 19th international conference on intelligent transportation systems (ITSC), pages 1071-1076. IEEE, 2016.","title":"Forecasting dynamic public transport origin-destination matrices with long-short term memory recurrent neural networks","authors":"Toqué","year":"2016","venue":"IEEE 19th international conference on intelligent transportation systems (ITSC)","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Vallée, 2019] Sven Vallée. Algorithmes d'optimisation pour un service de transport partagé à la demande. PhD thesis, Université de Lorraine, 2019.","title":"Algorithmes d'optimisation pour un service de transport partagé à la demande","authors":"Sven Vallée, Vallée","year":"2019","venue":null,"doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Wang et al., 2019] Yuandong Wang, Hongzhi Yin, Hongxu Chen, Tianyu Wo, Jie Xu, and Kai Zheng. Origin- destination matrix prediction via graph convolution: a new perspective of passenger demand modeling. In Proceedings of the 25th ACM SIGKDD international conference on knowledge discovery & data mining, pages 1227-1235, 2019.","title":"Origindestination matrix prediction via graph convolution: a new perspective of passenger demand modeling","authors":"Yuandong Wang, Hongzhi Yin, Hongxu Chen, Tianyu Wo, Jie Xu, Kai Zheng","year":"2019","venue":"Proceedings of the 25th ACM SIGKDD international conference on knowledge discovery & data mining","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Yang et al., 2017] Chao Yang, Fenfan Yan, and Xiangdong Xu. Daily metro origin-destination pattern recognition using dimensionality reduction and clustering methods. In 2017 IEEE 20th International Conference on Intelligent Transportation Systems (ITSC), pages 548-553. IEEE, 2017.","title":"Daily metro origin-destination pattern recognition using dimensionality reduction and clustering methods","authors":"Chao Yang, Fenfan Yan, Xiangdong Xu","year":"2017","venue":"IEEE 20th International Conference on Intelligent Transportation Systems (ITSC)","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Yao et al., 2018] Huaxiu Yao, Fei Wu, Jintao Ke, Xianfeng Tang, Yitian Jia, Siyu Lu, Pinghua Gong, Jieping Ye, and Zhenhui Li. Deep multi-view spatial-temporal network for taxi demand prediction. In Proceedings of the AAAI conference on artificial intelligence, volume 32, 2018.","title":"Deep multi-view spatial-temporal network for taxi demand prediction","authors":"Huaxiu Yao, Fei Wu, Jintao Ke, Xianfeng Tang, Yitian Jia, Siyu Lu, Pinghua Gong, Jieping Ye, Zhenhui Li","year":"2018","venue":"Proceedings of the AAAI conference on artificial intelligence","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Zhuang et al., 2022] Dingyi Zhuang, Shenhao Wang, Haris Koutsopoulos, and Jinhua Zhao. Uncertainty quantification of sparse travel demand prediction with spatial-temporal graph neural networks. In Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pages 4639-4647, 2022.","title":"Uncertainty quantification of sparse travel demand prediction with spatial-temporal graph neural networks","authors":"Zhuang","year":"2022","venue":"Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Zigrand et al., 2021] Louis Zigrand, Pegah Alizadeh, Emiliano Traversi, and Roberto Wolfler Calvo. Machine learning guided optimization for demand responsive transport systems. In Machine Learning and Knowledge Discovery in Databases. Applied Data Science Track: European Conference, ECML PKDD 2021, Bilbao, Spain, September 13-17, 2021, Proceedings, Part IV 21, pages 420-436. Springer, 2021.","title":"Machine learning guided optimization for demand responsive transport systems","authors":"Zigrand","year":"2021","venue":"Machine Learning and Knowledge Discovery in Databases. Applied Data Science Track: European Conference, ECML PKDD 2021","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}