Distribution of waiting time for dynamic pickup and delivery problems
From MaRDI portal
Publication:5963102
DOI10.1007/s10479-014-1683-6zbMath1331.90018OpenAlexW2081451888MaRDI QIDQ5963102
Michael Affenzeller, Stefan Vonolfen
Publication date: 4 March 2016
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-014-1683-6
simulation-based optimizationdirect policy searchdynamic pickup and delivery problemwaiting strategies
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (4)
Comparison of anticipatory algorithms for a dial-a-ride problem ⋮ A column generation approach for location-routing problems with pickup and delivery ⋮ Horizontal combinations of online and offline approximate dynamic programming for stochastic dynamic vehicle routing ⋮ A colored traveling salesman problem with varying city colors
Uses Software
Cites Work
- Unnamed Item
- Comparison of agent-based scheduling to look-ahead heuristics for real-time transportation problems
- The vehicle routing problem. Latest advances and new challenges.
- Dynamic pickup and delivery problems
- Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies.
- Evolution strategies. A comprehensive introduction
- Simulation-based evolution of resupply and routing policies in rich vendor-managed inventory scenarios
- A review of dynamic vehicle routing problems
- A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem
- 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
- Hybrid adaptive predictive control for the multi-vehicle dynamic pick-up and delivery problem based on genetic algorithms and fuzzy clustering
- The Truck Dispatching Problem
- Feature Article: Optimization for simulation: Theory vs. Practice
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Genetic Algorithms and Genetic Programming
- A guide to vehicle routing heuristics
- A unified tabu search heuristic for vehicle routing problems with time windows
- The General Pickup and Delivery Problem
- A Dynamic Pickup and Delivery Problem in Mobile Networks Under Information Constraints
- Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making
This page was built for publication: Distribution of waiting time for dynamic pickup and delivery problems