Sequential Simulated Annealing for the Vehicle Routing Problem with Time Windows
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 5951619
- Simulated annealing metaheuristics for the vehicle routing problem with time windows
- scientific article; zbMATH DE number 1487915
- scientific article; zbMATH DE number 2102229
- On solving the time window assignment vehicle routing problem via iterated local search
- An iterated local search algorithm for the time-dependent vehicle routing problem with time windows
- scientific article; zbMATH DE number 1488069
- Improvement heuristics for the vehicle routing problem based on simulated annealing
- A hybrid search method for the vehicle routing problem with time windows
Cited in
(10)- Simulated annealing metaheuristics for the vehicle routing problem with time windows
- Multi-fleet feeder vehicle routing problem using hybrid metaheuristic
- Heuristic solutions for the vehicle routing problem with time windows and synchronized visits
- A compressed-annealing heuristic for the traveling salesman problem with time windows
- COMPARISON OF SYSTEMS BASED ON EVOLUTIONARY SEARCH AND SIMULATED ANNEALING TO SOLVE THE VRPTW PROBLEM
- scientific article; zbMATH DE number 5951619 (Why is no real title available?)
- A bi-objective approach for scheduling ground-handling vehicles in airports
- scientific article; zbMATH DE number 1487915 (Why is no real title available?)
- Simulated annealing heuristic for the general share-a-ride problem
- Parallel Processing and Applied Mathematics
This page was built for publication: Sequential Simulated Annealing for the Vehicle Routing Problem with Time Windows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4931920)