A ride time-oriented scheduling algorithm for dial-a-ride problems

DOI10.1016/J.COR.2024.106588MaRDI QIDQ6561235

Claudia Bongiovanni, Mor Kaspi, Nikolas Geroliminis

Publication date: 25 June 2024

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

heuristicsschedulingdial-a-ridebattery management

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Routing a mixed fleet of electric and conventional vehicles
• 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
• Typology and literature review for dial-a-ride problems
• Efficient feasibility testing for dial-a-ride problems
• An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization
• Event-based MILP models for ridepooling applications
• The dial-a-ride problem: Models and algorithms
• A heuristic two-phase solution approach for the multi-objective dial-a-ride problem
• The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
• Timing problems and algorithms: Time decisions for sequences of activities
• JuMP: A Modeling Language for Mathematical Optimization
• 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)