A ride time-oriented scheduling algorithm for dial-a-ride problems
From MaRDI portal
Publication:6561235
DOI10.1016/J.COR.2024.106588MaRDI QIDQ6561235FDOQ6561235
Authors: Claudia Bongiovanni, Nikolas Geroliminis, Mor Kaspi 
Publication date: 25 June 2024
Published in: Computers \& Operations Research (Search for Journal in Brave)
Cites Work
- JuMP: a modeling language for mathematical optimization
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
- Efficient feasibility testing for dial-a-ride problems
- The dial-a-ride problem: Models and algorithms
- A heuristic two-phase solution approach for the multi-objective dial-a-ride problem
- Routing a mixed fleet of electric and conventional vehicles
- Timing problems and algorithms: time decisions for sequences of activities
- Typology and literature review for dial-a-ride problems
- Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh
- Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation
- An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization
- Event-based MILP models for ridepooling applications
- A deterministic annealing local search for the electric autonomous dial-a-ride problem
- Revised eight-step feasibility checking procedure with linear time complexity for the dial-a-ride problem (DARP)
This page was built for publication: A ride time-oriented scheduling algorithm for dial-a-ride problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6561235)
