Analyzing the benefits of an integrated mobility system using a matheuristic routing algorithm
From MaRDI portal
Publication:2029308
DOI10.1016/j.ejor.2020.07.060zbMath1487.90148MaRDI QIDQ2029308
Patrick Hirsch, Kris Braekers, Yves Molenbruch, Marco Oberscheider
Publication date: 3 June 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2020.07.060
integration; vehicle routing problem; dial-a-ride problem; large neighborhood search; public transport; demand-dependent transport
90B06: Transportation, logistics and supply chain management
90C59: Approximation methods and heuristics in mathematical programming
Related Items
Lexicographic multi-objective road pricing optimization considering land use and transportation effects, The dial-a-ride problem with private fleet and common carrier
Cites Work
- Unnamed Item
- The dial-A-ride problem with transfers
- Hybrid column generation and large neighborhood search for the dial-a-ride problem
- An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows and scheduled lines
- A note on ``Efficient feasibility testing for dial-a-ride problems
- Dynamic pickup and delivery problems
- Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation
- A hybrid genetic algorithm for the heterogeneous dial-a-ride problem
- Enhancing urban mobility: integrating ride-sharing and public transit
- Typology and literature review for dial-a-ride problems
- Recovery management for a dial-a-ride system with real-time disruptions
- A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem
- Variable neighborhood search for the dial-a-ride problem
- On a routing problem
- A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
- The pickup and delivery problem with time windows and scheduled lines
