Hybrid ant colony optimization algorithm applied to the multi-depot vehicle routing problem
From MaRDI portal
Cites work
- A Fast Taboo Search Algorithm for the Job Shop Problem
- A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- A tabu search heuristic for the multi-depot vehicle routing problem
- A unified exact method for solving different classes of vehicle routing problems
- An improved ant colony optimization for vehicle routing problem
- An Upperbound Algorithm for the Single and Multiple Terminal Delivery Problem
- Comparing descent heuristics and metaheuristics for the vehicle routing problem
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1488087 (Why is no real title available?)
- Hybrid ant colony optimization and visibility studies applied to a job-shop scheduling problem
- Multi-depot vehicle routing problem with time windows considering delivery and installation vehicles
- Principles of scatter search
- Solving variants of the vehicle routing problem with a simple parallel iterated tabu search
- The truck dispatching problem
- Using metaheuristics on the multi-depot vehicle routing problem with modified optimization criterion
This page was built for publication: Hybrid ant colony optimization algorithm applied to the multi-depot vehicle routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6151180)