Computing nine new best-so-far solutions for Capacitated VRP with a cellular Genetic Algorithm

Authors:
Enrique Alba;Bernabé Dorronsoro
Affiliations:
Department of Computer Science, University of Málaga, Spain;Department of Computer Science, University of Málaga, Spain
Venue:
Information Processing Letters
Year:
2006

Citing 10
Cited 2

The “molecular” traveling salesman

Biological Cybernetics
Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem

Annals of Operations Research - Special issue on Tabu search
MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows

New ideas in optimization
Comparing descent heuristics and metaheuristics for the vehicle routing problem

Computers and Operations Research
Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence

Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence
Scheduling Problems and Traveling Salesmen: The Genetic Edge Recombination Operator

Proceedings of the 3rd International Conference on Genetic Algorithms
Fine-Grained Parallel Genetic Algorithms

Proceedings of the 3rd International Conference on Genetic Algorithms
Cellular Genetic Algorithms

Proceedings of the 5th International Conference on Genetic Algorithms
Very large-scale vehicle routing: new test problems, algorithms, and results

Computers and Operations Research
Active guided evolution strategies for large-scale vehicle routing problems with time windows

Computers and Operations Research

Design of an improved quantum-inspired evolutionary algorithm for a transportation problem in logistics systems

Journal of Intelligent Manufacturing
A hybrid meta-heuristic for multi-objective vehicle routing problems with time windows

Computers and Industrial Engineering

Quantified Score

Hi-index	0.89

Visualization

Abstract

The Vehicle Routing Problem (VRP) is a hard combinatorial problem with numerous industrial applications. Among the large number of extensions to the canonical VRP, we study the Capacitated VRP (CVRP), which is mainly characterized by using vehicles of the same capacity. A cellular Genetic Algorithm (cGA)-a kind of decentralized population based heuristic-is used for solving CVRP, improving several of the best existing results so far in the literature. Our study shows a high performance in terms of the quality of the solutions found and the number of function evaluations (effort).