The “molecular” traveling salesman
Biological Cybernetics
Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
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
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
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
An evolutionary-based decision support system for vehicle routing: The case of a public utility
Decision Support Systems
Efficient local search limitation strategies for vehicle routing problems
EvoCOP'08 Proceedings of the 8th European conference on Evolutionary computation in combinatorial optimization
Hi-index | 0.89 |
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).