Bilevel large neighborhood search for the electric autonomous dial-a-ride problem

Bongiovanni, 2020 Bongiovanni, 2019, The electric autonomous dial-a-ride problem, Transp. Res. B, 122, 436, 10.1016/j.trb.2019.03.004 Braekers, 2014, Exact and meta-heuristic approach for a general heterogeneous dial-a-ride problem with multiple depots, Transp. Res. B, 67, 166, 10.1016/j.trb.2014.05.007 Cordeau, 2006, A branch-and-cut algorithm for the dial-a-ride problem, Oper. Res., 54, 573, 10.1287/opre.1060.0283 Cordeau, 2003, A tabu search heuristic for the static multi-vehicle dial-a-ride problem, Transp. Res. B, 37, 579, 10.1016/S0191-2615(02)00045-0 Garaix, 2011, Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation, Comput. Oper. Res., 38, 1435, 10.1016/j.cor.2010.12.014 Gschwind, 2019, Adaptive large neighborhood search with a constant-time feasibility test for the dial-a-ride problem, Transp. Sci., 53, 480, 10.1287/trsc.2018.0837 Gschwind, 2015, Effective handling of dynamic time windows and its application to solving the dial-a-ride problem, Transp. Sci., 49, 335, 10.1287/trsc.2014.0531 Ho, 2018, A survey of dial-a-ride problems: Literature review and recent developments, Transp. Res. B, 111, 395, 10.1016/j.trb.2018.02.001 Hoché, 2020, Charging management of shared taxis: Neighbourhood search for the E-ADARP, 1 Jorgensen, 2007, Solving the dial-a-ride problem using genetic algorithms, J. Oper. Res. Soc., 58, 1321, 10.1057/palgrave.jors.2602287 Liang, 2020, Automated taxis’ dial-a-ride problem with ride-sharing considering congestion-based dynamic travel times, Transp. Res. C, 112, 260, 10.1016/j.trc.2020.01.024 Masmoudi, 2017, A hybrid genetic algorithm for the heterogeneous dial-a-ride problem, Comput. Oper. Res., 81, 1, 10.1016/j.cor.2016.12.008 Masmoudi, 2016, Three effective metaheuristics to solve the multi-depot multi-trip heterogeneous dial-a-ride problem, Transp. Res. E, 96, 60, 10.1016/j.tre.2016.10.002 Masmoudi, 2018, The dial-a-ride problem with electric vehicles and battery swapping stations, Transp. Res. E, 118, 392, 10.1016/j.tre.2018.08.005 Molenbruch, 2017, Benefits of horizontal cooperation in dial-a-ride services, Transp. Res. E, 107, 97, 10.1016/j.tre.2017.09.001 Molenbruch, 2017, Typology and literature review for dial-a-ride problems, Ann. Oper. Res., 259, 295, 10.1007/s10479-017-2525-0 Narayanan, 2020, Shared autonomous vehicle services: A comprehensive review, Transp. Res. C, 111, 255, 10.1016/j.trc.2019.12.008 Parragh, 2011, Introducing heterogeneous users and vehicles into models and algorithms for the dial-a-ride problem, Transp. Res. C, 19, 912, 10.1016/j.trc.2010.06.002 Parragh, 2013, Hybrid column generation and large neighborhood search for the dial-a-ride problem, Comput. Oper. Res., 40, 490, 10.1016/j.cor.2012.08.004 Pimenta, 2017, Models and algorithms for reliability-oriented dial-a-ride with autonomous electric vehicles, European J. Oper. Res., 257, 601, 10.1016/j.ejor.2016.07.037 Ropke, 2009, Branch and cut and price for the pickup and delivery problem with time windows, Transp. Sci., 43, 267, 10.1287/trsc.1090.0272 Ropke, 2007, Models and branch-and-cut algorithms for pickup and delivery problems with time windows, Networks, 49, 258, 10.1002/net.20177 Ropke, 2006, An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows, Transp. Sci., 40, 455, 10.1287/trsc.1050.0135 Shaheen, 2020, Chapter 3 - Mobility on demand (MOD) and mobility as a service (MaaS): Early understanding of shared mobility impacts and public transit partnerships, 37 Shaw, 1997 Su, 2023, A deterministic annealing local search for the electric autonomous dial-a-ride problem, European J. Oper. Res., 10.1016/j.ejor.2023.02.012 Vallée, 2017, Maximizing the number of served requests in an online shared transport system by solving a dynamic DARP, vol. 10572, 64 Venkatraman, 2019, A congestion-aware tabu search heuristic to solve the shared autonomous vehicle routing problem, J. Intell. Transp. Syst., 25, 343, 10.1080/15472450.2019.1665521