Comparison of anticipatory algorithms for a dial-a-ride problem
From MaRDI portal
(Redirected from Publication:2140208)
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
Cites work
- scientific article; zbMATH DE number 1452992 (Why is no real title available?)
- A VNS Algorithm for Noisy Problems and Its Application to Project Portfolio Analysis
- A hybrid genetic algorithm for the heterogeneous dial-a-ride problem
- A new extension of local search applied to the Dial-A-Ride problem
- 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
- A parallel matheuristic for the technician routing and scheduling problem
- A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
- A review of dynamic vehicle routing problems
- A unified framework for stochastic optimization
- A unified solution framework for multi-attribute vehicle routing problems
- Distribution of waiting time for dynamic pickup and delivery problems
- Dynamic courier routing for a food delivery service
- Dynamic fleet management. Concepts, systems, algorithms \& case studies
- Dynamic pickup and delivery problems
- Dynamic programming based metaheuristics for the dial-a-ride problem
- Dynamic transportation of patients in hospitals
- Dynamic traveling salesman problem with stochastic release dates
- Dynamic vehicle routing: Status and prospects
- Fast stepwise procedures of selection of variables by using AIC and BIC criteria
- Handbooks in operations Research \& management science: Transportation
- Hybrid column generation and large neighborhood search for the dial-a-ride problem
- Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem
- Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
- Non-myopic vehicle and route selection in dynamic DARP with travel time and workload objectives
- Online Vehicle Routing Problems: A Survey
- Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching
- Partially dynamic vehicle routing—models and algorithms
- Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies.
- Research note: the point of diminishing returns in heuristic search
- Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers
- The dial-a-ride problem: Models and algorithms
- The dynamic dispatch waves problem for same-day delivery
- The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments
- Trends in transportation and logistics
- Typology and literature review for dial-a-ride problems
- Variable neighborhood search for the dial-a-ride problem
- Variable neighborhood search for the stochastic and dynamic vehicle routing problem
- Variable neighborhood search: basics and variants
- What you should know about the vehicle routing problem
Cited in
(1)
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)
