Recovery management for a dial-a-ride system with real-time disruptions
From MaRDI portal
Publication:2327632
DOI10.1016/j.ejor.2019.08.006zbMath1430.90119OpenAlexW2967477084MaRDI QIDQ2327632
Thierry Pironet, Célia Paquay, Yves Cramer
Publication date: 15 October 2019
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://orbi.uliege.be/handle/2268/236250
Related Items
Strategies for ensuring required service level for COVID-19 herd immunity in Indian vaccine supply chain, Prepositioning can improve the performance of a dynamic stochastic on-demand public bus system, An online reinforcement learning approach to charging and order-dispatching optimization for an e-hailing electric vehicle fleet, Probabilistic Temporal Networks with Ordinary Distributions: Theory, Robustness and Expected Utility, Real-time ride-sharing framework with dynamic timeframe and anticipation-based migration, Analyzing the benefits of an integrated mobility system using a matheuristic routing algorithm
Uses Software
Cites Work
- Unnamed Item
- Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
- Dynamic pickup and delivery problems
- Modelling and solving the senior transportation problem
- Typology and literature review for dial-a-ride problems
- A review of dynamic vehicle routing problems
- A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem
- The dial-a-ride problem: Models and algorithms
- A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
- The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
- Scheduling Large-Scale Advance-Request Dial-A-Ride Systems
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
- The General Pickup and Delivery Problem
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
