Comparison of anticipatory algorithms for a dial-a-ride problem

DOI10.1016/j.ejor.2021.10.060zbMath1506.90058OpenAlexW3212682890WikidataQ113875437 ScholiaQ113875437MaRDI QIDQ2140208

Richard F. Hartl, Jakob Puchinger, Ulrike Ritzinger, Christian Rudloff

Publication date: 20 May 2022

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2021.10.060

zbMATH Keywords

dynamictransportationreal-world applicationstochasticdial-a-ride problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem
• A note on the time travel approach for handling time windows in vehicle routing problems
• Hybrid column generation and large neighborhood search for the dial-a-ride problem
• Non-myopic vehicle and route selection in dynamic DARP with travel time and workload objectives
• A parallel matheuristic for the technician routing and scheduling problem
• Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
• A note on ``Efficient feasibility testing for dial-a-ride problems
• The dynamic dispatch waves problem for same-day delivery
• Dynamic pickup and delivery problems
• A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
• Fast stepwise procedures of selection of variables by using AIC and BIC criteria
• A new extension of local search applied to the Dial-A-Ride problem
• Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies.
• A hybrid genetic algorithm for the heterogeneous dial-a-ride problem
• Trends in transportation and logistics
• Typology and literature review for dial-a-ride problems
• Variable neighborhood search: basics and variants
• A unified framework for stochastic optimization
• Dynamic courier routing for a food delivery service
• Dynamic vehicle routing: Status and prospects
• A review of dynamic vehicle routing problems
• Research note: the point of diminishing returns in heuristic search
• Dynamic transportation of patients in hospitals
• Dynamic traveling salesman problem with stochastic release dates
• The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments
• Dynamic fleet management. Concepts, systems, algorithms \& case studies
• The dial-a-ride problem: Models and algorithms
• A unified solution framework for multi-attribute vehicle routing problems
• Variable neighborhood search for the dial-a-ride problem
• What you should know about the vehicle routing problem
• Online Vehicle Routing Problems: A Survey
• A VNS Algorithm for Noisy Problems and Its Application to Project Portfolio Analysis
• Partially dynamic vehicle routing—models and algorithms
• Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching
• Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers
• Dynamic programming based metaheuristics for the dial-a-ride problem
• Distribution of waiting time for dynamic pickup and delivery problems
• Variable neighborhood search for the stochastic and dynamic vehicle routing problem

This page was built for publication: Comparison of anticipatory algorithms for a dial-a-ride problem