Abstract
Ride Hailing (RH) services have become common in many cities. An important aspect of such services is the optimal matching between vehicles and customer requests, which is very close to the classical Vehicle Routing Problem with Time Windows (VRPTW).
With the emergence of new Machine Learning (ML) techniques, many researches have tried to use them for discreet optimization problems. Recently, Pointer Networks (Ptr-Net) have been applied to simpler Vehicle Routing Problem (VRP) with limited applicability [14]. We add fixed slots to their approach to make it applicable to RH scenario. The number of slots can vary without retraining the network. Furthermore, contrary to reinforcement learning in [14], we use supervise learning for training.
We show that the presented architecture has the potential to build good vehicle routes for RH services. Furthermore, looking at the effectiveness of Large Neighbourhood Search(LNS) for VRPTW, we combine the approach with LNS by using the trained network as an insertion operator. We generate examples from New York Taxi data and use the solutions generated from LNS for training. The approach consistently produces good solutions for problems of sizes similar to the ones used during training, and scales well to unseen problems of relatively bigger sizes.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
https://www1.nyc.gov/site/tlc/about/tlc-trip-record-data.page
Alonso-Mora, J., Samaranayake, S., Wallar, A., Frazzoli, E., Rus, D.: On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment. Proc. Nat. Acad. Sci. 114(3), 462–467 (2017)
Bello, I., Pham, H., Le, Q.V., Norouzi, M., Bengio, S.: Neural combinatorial optimization with reinforcement learning. arXiv preprint. arXiv:1611.09940 (2016)
Cordeau, J.F., Laporte, G.: The dial-a-ride problem: models and algorithms. Ann. Oper. Res. 153(1), 29–46 (2007)
Cubillos, C., Urra, E., RodrÃguez, N.: Application of genetic algorithms for the DARPTW problem. Int. J. Comput. Commun. Control 4(2), 127–136 (2009)
Dandl, F., Bracher, B., Bogenberger, K.: Microsimulation of an autonomous taxi-system in Munich. In: 2017 5th IEEE International Conference on Models and Technologies for Intelligent Transportation Systems (MT-ITS), pp. 833–838. IEEE (2017)
Detti, P., de Lara, G.Z.M.: Variable neighborhood search algorithms for the multi-depot dial-a-ride problem with heterogeneous vehicles and users. arXiv preprint. arXiv:1611.05187 (2016)
Gschwind, T., Drexl, M.: Adaptive large neighborhood search with a constant-time feasibility test for the dial-a-ride problem. Transp. Sci. 53, 319–622 (2019)
Ho, S.C., Szeto, W., Kuo, Y.H., Leung, J.M., Petering, M., Tou, T.W.: A survey of dial-a-ride problems literature review and recent developments. Transp. Res. Part B Methodological 111, 395–421 (2018)
Hörl, S., Ruch, C., Becker, F., Frazzoli, E., Axhausen, K.W.: Fleet control algorithms for automated mobility: a simulation assessment for Zurich. Transp. Res. Part C Emerg. Technol. 102, 20–31 (2018)
Masmoudi, M.A., Braekers, K., Masmoudi, M., Dammak, A.: A hybrid genetic algorithm for the heterogeneous dial-a-ride problem. Comput. Oper. Res. 81, 1–13 (2017)
Milan, A., Rezatofighi, S.H., Garg, R., Dick, A., Reid, I.: Data-driven approximations to NP-hard problems. In: Thirty-First AAAI Conference on Artificial Intelligence (2017)
Nazari, M., Oroojlooy, A., Snyder, L., Takác, M.: Reinforcement learning for solving the vehicle routing problem. In: Advances in Neural Information Processing Systems, pp. 9839–9849 (2018)
Parragh, S.N., Doerner, K.F., Hartl, R.F.: Variable neighborhood search for the dial-a-ride problem. Comput. Oper. Res. 37(6), 1129–1138 (2010)
Ropke, S., Pisinger, D.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp. Sci. 40(4), 455–472 (2006)
Savelsbergh, M.W.: The vehicle routing problem with time windows: minimizing route duration. ORSA J. Comput. 4(2), 146–154 (1992)
Vinyals, O., Fortunato, M., Jaitly, N.: Pointer networks. In: Advances in Neural Information Processing Systems, pp. 2692–2700 (2015)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Syed, A.A., Akhnoukh, K., Kaltenhaeuser, B., Bogenberger, K. (2019). Neural Network Based Large Neighborhood Search Algorithm for Ride Hailing Services. In: Moura Oliveira, P., Novais, P., Reis, L. (eds) Progress in Artificial Intelligence. EPIA 2019. Lecture Notes in Computer Science(), vol 11804. Springer, Cham. https://doi.org/10.1007/978-3-030-30241-2_49
Download citation
DOI: https://doi.org/10.1007/978-3-030-30241-2_49
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-30240-5
Online ISBN: 978-3-030-30241-2
eBook Packages: Computer ScienceComputer Science (R0)