An improved ant colony optimization for vehicle routing problem

DOI10.1016/j.ejor.2008.02.028zbMath1156.90434MaRDI QIDQ2378461

Yanyan Li

Publication date: 8 January 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2008.02.028

zbMATH Keywords

vehicle routing problem; ant-weight strategy; mutation operation; improved ant colony optimization

Mathematics Subject Classification ID

90C59: Approximation methods and heuristics in mathematical programming

90C27: Combinatorial optimization

Related Items

An ant colony system for responsive dynamic vehicle routing, An improved particle swarm optimization for carton heterogeneous vehicle routing problem with a collection depot, A solution method for a two-layer sustainable supply chain distribution model, Testing local search move operators on the vehicle routing problem with split deliveries and time windows, An improved particle swarm optimization for the automobile spare part warehouse location problem, The school bus routing problem: a review, A two-stage simulated annealing algorithm for the many-to-many milk-run routing problem with pipeline inventory cost, Dynamic vehicle routing problems with enhanced ant colony optimization, A hybrid ant colony optimization for dynamic multidepot vehicle routing problem, Optimization of two-stage location-routing-inventory problem with time-windows in food distribution network, Fresh seafood delivery routing problem using an improved ant colony optimization, Solving fixed charge transportation problem with truck load constraint using metaheuristics, Scheduling quay cranes and yard trucks for unloading operations in container ports, An improved shuffled frog-leaping algorithm for flexible job shop scheduling problem, Makespan minimization on single batch-processing machine via ant colony optimization, Economic analysis on value chain of taxi fleet with battery-swapping mode using multiobjective genetic algorithm, Direct index method of beam damage location detection based on difference theory of strain modal shapes and the genetic algorithms application, Genetic algorithm for multiuser discrete network design problem under demand uncertainty, A hybrid algorithm based on ACO and PSO for capacitated vehicle routing problems, The hop-constrained minimum cost flow spanning tree problem with nonlinear costs: an ant colony optimization approach, Bilayer local search enhanced particle swarm optimization for the capacitated vehicle routing problem, Heuristics for multi-attribute vehicle routing problems: a survey and synthesis, Memory and Learning in Metaheuristics, Vehicle routing problem based on a fuzzy customer clustering approach for logistics network optimization

Uses Software

• OR-Library

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A tabu search algorithm for the multi-trip vehicle routing and scheduling problem
• A tabu search heuristic for the heterogeneous fleet vehicle routing problem
• An effective genetic algorithm approach to multiobjective routing problems (MORPs)
• An improved ant system algorithm for the vehicle routing problem
• A genetic algorithm for the vehicle routing problem
• A simple and effective evolutionary algorithm for the vehicle routing problem
• A tabu search heuristic for the multi-depot vehicle routing problem
• Simulated annealing metaheuristics for the vehicle routing problem with time windows
• Probabilistic diversification and intensification in local search for vehicle routing
• Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
• Solving real-life vehicle routing problems efficiently using tabu search
• A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length
• Ant colonies for the quadratic assignment problem
• Parallel iterative search methods for vehicle routing problems
• Evolutionary Computation in Combinatorial Optimization