New optimization guidance for dynamic dial-a-ride problems

DOI10.1007/978-3-031-08623-6_42MaRDI QIDQ6606681zbMATH OpenFDO

Authors Christian Ackermann, Julia Rieck

Publication date 17 September 2024

Full work available at URL https://doi.org/10.1007/978-3-031-08623-6_42

zbMATH Keywords

dynamic dial-a-ride problemmetricsreinforcement learning

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Markov and semi-Markov decision processes (90C40)

Recommendations

• Modeling and optimizing dynamic dial-a-ride problems
• Non-myopic vehicle and route selection in dynamic DARP with travel time and workload objectives
• A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem
• Dynamic programming based metaheuristics for the dial-a-ride problem
• An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows

Cites work

• A hybrid tabu search and constraint programming algorithm for the dynamic dial-a-ride problem

Cited in

(1)

• Multiple plan approach for a dynamic dial-a-ride problem

This page was built for publication: New optimization guidance for dynamic dial-a-ride problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6606681)