The static on‐demand bus routing problem: large neighborhood search for a dial‐a‐ride problem with bus station assignment

DOI10.1111/itor.13058OpenAlexW3200654018MaRDI QIDQ6071075

Lissa Melis, Kenneth Sörensen

Publication date: 27 November 2023

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.13058

zbMATH Keywords

transportationmetaheuristicroutingpublic transport

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• The dial-A-ride problem with transfers
• Hybrid column generation and large neighborhood search for the dial-a-ride problem
• A school bus scheduling problem
• Solving a school bus scheduling problem with integer programming
• The school bus routing problem: a review
• The pickup and delivery problem with time windows
• A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem.
• Typology and literature review for dial-a-ride problems
• The pickup and delivery problem with time windows and occasional drivers
• Optimization for dynamic ride-sharing: a review
• 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
• A simulation study of an on‐demand transportation system
• Large neighborhood search for the bike request scheduling problem
• Optimal routing of multimodal mobility systems with ride‐sharing

This page was built for publication: The static on‐demand bus routing problem: large neighborhood search for a dial‐a‐ride problem with bus station assignment