| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428910 | Information Processing Letters | 2006 | 6 Pages |
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).
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
