A weight-coded genetic algorithm for the multiple container packing problem
Proceedings of the 1999 ACM symposium on Applied computing
A weight-coded genetic algorithm for the minimum weight triangulation problem
SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
Representing rectilinear Steiner trees in genetic algorithms
SAC '96 Proceedings of the 1996 ACM symposium on Applied Computing
A weighted coding in a genetic algorithm for the degree-constrained minimum spanning tree problem
SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 1
A Tabu Search Heuristic for the Capacitated Arc Routing Problem
Operations Research
A deterministic tabu search algorithm for the capacitated arc routing problem
Computers and Operations Research
Efficient solution of capacitated arc routing problems with a limited computational budget
AI'12 Proceedings of the 25th Australasian joint conference on Advances in Artificial Intelligence
| Hi-index | 0.00 |
In this paper we present a weight coded genetic algorithm (GA) based approach to the capacitated arc routing problem (CARP). In comparison to metaheuristic algorithms, simple constructive heuristic algorithms often produce poor quality solutions to the CARP. Using a novel weight coding model in conjunction with a series of standard CARP heuristics, acting as a solution engine, we demonstrate how these simple heuristic procedures can be `duped' into producing better solutions to the CARP. The algorithm is tested on a set of problem instances drawn from the literature. Initial results for our GA show that it is possible to reliably produce an uplift in solution quality of between 7.3% and 14.3% above the standard heuristics, the GA identifying 47 optimum or best known solutions from the 57 problem instances tested.