Dynamic vehicle routing with time windows in theory and practice
From MaRDI portal
Publication:2311301
Recommendations
- Ant colony system for a dynamic vehicle routing problem
- A dynamic vehicle routing problem with multiple delivery routes
- Online vehicle routing and scheduling with dynamic travel times
- Dynamic vehicle routing problems with enhanced ant colony optimization
- Improved ant colony optimization algorithm for solving dynamic vehicle routing problem with time windows
Cites work
- A genetic algorithm for the vehicle routing problem
- A particle swarm optimization based memetic algorithm for dynamic optimization problems
- A review of dynamic vehicle routing problems
- A survey on metaheuristics for stochastic combinatorial optimization
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- Adaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problem
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- An ant colony optimisation algorithm for solving the asymmetric traffic assignment problem
- Ant colony system for a dynamic vehicle routing problem
- Development of a fuel consumption optimization model for the capacitated vehicle routing problem
- Dynamic vehicle routing: Status and prospects
- Evolutionary swarm cooperative optimization in dynamic environments
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- Honey bees mating optimization algorithm for large scale vehicle routing problems
- scientific article; zbMATH DE number 2079890 (Why is no real title available?)
- scientific article; zbMATH DE number 1749226 (Why is no real title available?)
- Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching
- Solving real-life vehicle routing problems efficiently using tabu search
- Solving software project scheduling problems with ant colony optimization
- The traveling-salesman problem
- The truck dispatching problem
- Vehicle Routing
Cited in
(15)- On the use of learnheuristics in vehicle routing optimization problems with dynamic inputs
- A dynamic vehicle routing problem with multiple delivery routes
- TLHSA and SACA: two heuristic algorithms for two variant VRP models
- A vector evaluated evolutionary algorithm with exploitation reinforcement for the dynamic pollution routing problem
- Optimizing distribution route of convenience vegetable stores considering transit nodes
- Ant colony system for a dynamic vehicle routing problem
- Balanced dynamic multiple travelling salesmen: algorithms and continuous approximations
- An ant colony system for responsive dynamic vehicle routing
- Vehicle routing problem with pick-up and delivery under dynamic travel times
- Non-myopic vehicle and route selection in dynamic DARP with travel time and workload objectives
- Dynamic Vehicle Dispatching: Optimal Heavy Traffic Performance and Practical Insights
- Design and Optimization of Dynamic Routing Problems with Time Dependent Travel Times
- Reoptimisation strategies for dynamic vehicle routing problems with proximity-dependent nodes
- Quantum ant colony optimization algorithm for AGVs path planning based on Bloch coordinates of pheromones
- Dynamic VRP in pharmaceutical distribution -- a case study
This page was built for publication: Dynamic vehicle routing with time windows in theory and practice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2311301)
