Hybrid ant colony optimization algorithm applied to the multi-depot vehicle routing problem

DOI10.1007/S11047-020-09783-6zbMath1530.68288OpenAlexW3003557778MaRDI QIDQ6151180

Petr Stodola

Publication date: 9 February 2024

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-020-09783-6

zbMATH Keywords

hybrid algorithmsant colony optimizationmulti-depot vehicle routing problembio-inspired algorithmslocal optimization process

Mathematics Subject Classification ID

Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Unnamed Item
• Unnamed Item
• Hybrid ant colony optimization and visibility studies applied to a job-shop scheduling problem
• A tabu search heuristic for the multi-depot vehicle routing problem
• Using metaheuristics on the multi-depot vehicle routing problem with modified optimization criterion
• Multi-depot vehicle routing problem with time windows considering delivery and installation vehicles
• An improved ant colony optimization for vehicle routing problem
• A unified exact method for solving different classes of vehicle routing problems
• Principles of scatter search
• The Truck Dispatching Problem
• Solving Variants of the Vehicle Routing Problem with a Simple Parallel Iterated Tabu Search
• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• A Fast Taboo Search Algorithm for the Job Shop Problem
• A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
• An Upperbound Algorithm for the Single and Multiple Terminal Delivery Problem
• Comparing descent heuristics and metaheuristics for the vehicle routing problem

This page was built for publication: Hybrid ant colony optimization algorithm applied to the multi-depot vehicle routing problem