Distribution of waiting time for dynamic pickup and delivery problems
From MaRDI portal
Recommendations
- Waiting and Buffering Strategies for the Dynamic Pickup and Delivery Problem with Time Windows
- Generalised pickup and delivery problem with dynamic time windows
- The Pickup And Delivery Problem With Time Windows And Transshipment
- Dynamic pickup and delivery problems
- A stochastic and dynamic model for the single-vehicle pick-up and delivery problem
- A probabilistic approach to pickup and delivery problems with time window uncertainty
- The pickup and delivery problem with time windows
- The pickup and delivery problem with time windows and occasional drivers
- The pickup and delivery problem with time windows and handling operations
Cites work
- A Dynamic Pickup and Delivery Problem in Mobile Networks Under Information Constraints
- A guide to vehicle routing heuristics
- A review of dynamic vehicle routing problems
- A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem
- A unified tabu search heuristic for vehicle routing problems with time windows
- Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Comparison of agent-based scheduling to look-ahead heuristics for real-time transportation problems
- Dynamic fleet management. Concepts, systems, algorithms \& case studies
- Dynamic pickup and delivery problems
- Evolution strategies. A comprehensive introduction
- Genetic Algorithms and Genetic Programming
- scientific article; zbMATH DE number 1348743 (Why is no real title available?)
- Hybrid adaptive predictive control for the multi-vehicle dynamic pick-up and delivery problem based on genetic algorithms and fuzzy clustering
- Optimization for simulation: theory vs. practice
- Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies.
- Simulation-based evolution of resupply and routing policies in rich vendor-managed inventory scenarios
- The dial-a-ride problem: Models and algorithms
- The General Pickup and Delivery Problem
- The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments
- The truck dispatching problem
- The vehicle routing problem. Latest advances and new challenges.
Cited in
(12)- A column generation approach for location-routing problems with pickup and delivery
- A colored traveling salesman problem with varying city colors
- Comparison of anticipatory algorithms for a dial-a-ride problem
- Horizontal combinations of online and offline approximate dynamic programming for stochastic dynamic vehicle routing
- Look-ahead strategies for dynamic pickup and delivery problems
- A scalable anticipatory policy for the dynamic pickup and delivery problem
- Acceptance and dispatching policies for a distribution problem
- Stochastic bounds for order flow times in parts-to-picker warehouses with remotely located order-picking workstations
- How does variability in input load relate to the probability of critically delayed delivery in a simple multipart re-entrant flow-line problem?
- scientific article; zbMATH DE number 7656031 (Why is no real title available?)
- Waiting and Buffering Strategies for the Dynamic Pickup and Delivery Problem with Time Windows
- Dynamic pickup-and-delivery for collaborative platforms with time-dependent travel and crowdshipping
This page was built for publication: Distribution of waiting time for dynamic pickup and delivery problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963102)
