The dial-a-tour problem

DOI10.1016/J.COR.2024.106832MaRDI QIDQ6979064zbMATH OpenFDO

Authors Vincent Boyer, Erick Cervantes-Mendieta, Oscar A. Hernández-López, María Angélica Salazar-Aguilar

Publication date 26 May 2025

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

Full work available at URL https://doi.org/10.1016/J.COR.2024.106832

zbMATH Keywords

constraint programmingdial-a-ride problemdial-a-tour problemon-demand transportation problemtourists transportation

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A column generation and combinatorial Benders decomposition algorithm for the selective dial-a-ride-problem
• A hybrid tabu search and constraint programming algorithm for the dynamic dial-a-ride problem
• A ride time-oriented scheduling algorithm for dial-a-ride problems
• Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem
• An effective and fast heuristic for the dial-a-ride problem
• An exact algorithm for the pickup and delivery problem with time windows
• An integrated ride-matching and vehicle-rebalancing model for shared mobility on-demand services
• Dial-a-ride problem: mixed integer programming revisited and constraint programming proposed
• Dynamic pickup and delivery problems
• Dynamic transportation of patients in hospitals
• Event-based MILP models for ridepooling applications
• Handbooks in operations Research \& management science: Transportation
• Modeling and optimizing dynamic dial-a-ride problems
• Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
• Solving the Dial-a-Ride problem using genetic algorithms
• The dial-a-ride problem: Models and algorithms
• Typology and literature review for dial-a-ride problems

This page was built for publication: The dial-a-tour problem

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