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

DOI10.1016/J.COR.2024.106588MaRDI QIDQ6561235zbMATH OpenFDO

Authors Claudia Bongiovanni, Nikolas Geroliminis, Mor Kaspi

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

• A deterministic annealing local search for the electric autonomous dial-a-ride problem
• A heuristic two-phase solution approach for the multi-objective dial-a-ride problem
• An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization
• Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh
• Efficient feasibility testing for dial-a-ride problems
• Event-based MILP models for ridepooling applications
• JuMP: a modeling language for mathematical optimization
• Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation
• Revised eight-step feasibility checking procedure with linear time complexity for the dial-a-ride problem (DARP)
• Routing a mixed fleet of electric and conventional vehicles
• The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
• The dial-a-ride problem: Models and algorithms
• Timing problems and algorithms: time decisions for sequences of activities
• Typology and literature review for dial-a-ride problems

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)