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

DOI10.1111/ITOR.13058MaRDI QIDQ6071075zbMATH OpenOpenAlexFDO

Authors Lissa Melis, K. 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

metaheuristicpublic transportroutingtransportation

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Recommendations

• The real-time on-demand bus routing problem: the cost of dynamic requests
• A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints
• Variable neighborhood search for the dial-a-ride problem
• Hybrid large neighborhood search for the bus rapid transit route design problem
• A hybrid adaptive large neighborhood heuristic for a real-life dial-a-ride problem
• scientific article; zbMATH DE number 7266752
• The dial-a-ride problem (DARP): variants, modeling issues and algorithms
• The dial-a-ride problem: Models and algorithms
• Hybrid column generation and large neighborhood search for the dial-a-ride problem

Cites work

• A heuristic two-phase solution approach for the multi-objective dial-a-ride problem
• A school bus scheduling problem
• A simulation study of an on‐demand transportation system
• A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem.
• Hybrid column generation and large neighborhood search for the dial-a-ride problem
• Large neighborhood search for the bike request scheduling problem
• Optimal routing of multimodal mobility systems with ride‐sharing
• Optimization for dynamic ride-sharing: a review
• Solving a school bus scheduling problem with integer programming
• The dial-A-ride problem with transfers
• The dial-a-ride problem: Models and algorithms
• The pickup and delivery problem with time windows
• The pickup and delivery problem with time windows and occasional drivers
• The school bus routing problem: a review
• The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
• Typology and literature review for dial-a-ride problems

Cited in

(6)

• The integrated on-demand bus routing problem: combining on-demand buses with a high-frequency fixed line public transport network
• Hybridizing a matheuristic with ALNS for the optimal collection and delivery of medical specimens
• Evaluating a simulated annealing metaheuristic for the heterogeneous on-demand bus routing problem with a novel experimental setup
• Static optimization of a semiflexible on-demand public bus line for peak hours
• Optimization of a semiflexible demand-responsive feeder bus system using variable neighborhood search
• Optimizing transport operations in a hybrid mobility system for rural-urban transport

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

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