Comparison of anticipatory algorithms for a dial-a-ride problem
DOI10.1016/J.EJOR.2021.10.060zbMATH Open1506.90058OpenAlexW3212682890WikidataQ113875437 ScholiaQ113875437MaRDI QIDQ2140208FDOQ2140208
Authors: Ulrike Ritzinger, Jakob Puchinger, Christian Rudloff, Richard F. Hartl 
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
Recommendations
- A scalable anticipatory policy for the dynamic pickup and delivery problem
- Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
- Anticipation in dynamic vehicle routing
- Dynamic transportation of patients in hospitals
- Distribution of waiting time for dynamic pickup and delivery problems
Deterministic scheduling theory in operations research (90B35) Transportation, logistics and supply chain management (90B06)
Cites Work
- A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
- Dynamic vehicle routing: Status and prospects
- A unified solution framework for multi-attribute vehicle routing problems
- Handbooks in operations Research \& management science: Transportation
- Dynamic pickup and delivery problems
- A new extension of local search applied to the Dial-A-Ride problem
- A review of dynamic vehicle routing problems
- Dynamic transportation of patients in hospitals
- The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments
- The dial-a-ride problem: Models and algorithms
- Variable neighborhood search for the dial-a-ride problem
- Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem
- Hybrid column generation and large neighborhood search for the dial-a-ride problem
- A parallel matheuristic for the technician routing and scheduling problem
- Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers
- Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
- Dynamic programming based metaheuristics for the dial-a-ride problem
- Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies.
- Dynamic fleet management. Concepts, systems, algorithms \& case studies
- What you should know about the vehicle routing problem
- Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching
- Title not available (Why is that?)
- A note on ``Efficient feasibility testing for dial-a-ride problems
- A note on the time travel approach for handling time windows in vehicle routing problems
- Partially dynamic vehicle routing—models and algorithms
- Distribution of waiting time for dynamic pickup and delivery problems
- A hybrid genetic algorithm for the heterogeneous dial-a-ride problem
- Typology and literature review for dial-a-ride problems
- Non-myopic vehicle and route selection in dynamic DARP with travel time and workload objectives
- Fast stepwise procedures of selection of variables by using AIC and BIC criteria
- A VNS Algorithm for Noisy Problems and Its Application to Project Portfolio Analysis
- Variable neighborhood search for the stochastic and dynamic vehicle routing problem
- The dynamic dispatch waves problem for same-day delivery
- Online Vehicle Routing Problems: A Survey
- Trends in transportation and logistics
- Variable neighborhood search: basics and variants
- A unified framework for stochastic optimization
- Dynamic courier routing for a food delivery service
- Dynamic traveling salesman problem with stochastic release dates
- Research note: the point of diminishing returns in heuristic search
Cited In (1)
Uses Software
This page was built for publication: Comparison of anticipatory algorithms for a dial-a-ride problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2140208)
