Genetic programming: on the programming of computers by means of natural selection
Genetic programming: on the programming of computers by means of natural selection
Routing winter gritting vehicles
CO89 Selected papers of the conference on Combinatorial Optimization
Communications of the ACM
Grammatical Evolution: Evolving Programs for an Arbitrary Language
EuroGP '98 Proceedings of the First European Workshop on Genetic Programming
A Tabu Search Heuristic for the Capacitated Arc Routing Problem
Operations Research
Grammatical Evolution: Evolutionary Automatic Programming in an Arbitrary Language
Grammatical Evolution: Evolutionary Automatic Programming in an Arbitrary Language
Dynamical blueprints: exploiting levels of system-environment interaction
Proceedings of the 9th annual conference on Genetic and evolutionary computation
A deterministic tabu search algorithm for the capacitated arc routing problem
Computers and Operations Research
A Simple Modification in CMA-ES Achieving Linear Time and Space Complexity
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
A global repair operator for capacitated arc routing problem
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Memetic algorithm with extended neighborhood search for capacitated arc routing problems
IEEE Transactions on Evolutionary Computation
A genetic programming hyper-heuristic approach for evolving 2-D strip packing heuristics
IEEE Transactions on Evolutionary Computation
Dynamic scheduling with genetic programming
EuroGP'06 Proceedings of the 9th European conference on Genetic Programming
Robust route optimization for gritting/salting trucks: a CERCIA experience
IEEE Computational Intelligence Magazine
Decomposition-Based Memetic Algorithm for Multiobjective Capacitated Arc Routing Problem
IEEE Transactions on Evolutionary Computation
Robustness and the Halting Problem for Multicellular Artificial Ontogeny
IEEE Transactions on Evolutionary Computation
A study on scalable representations for evolutionary optimization of ground structures
Evolutionary Computation
Hi-index | 0.00 |
A developmental, ontogenic approach to Capacitated Arc Routing Problems (CARPs) is introduced. The genotypes of this method are constructive heuristics specified as trees of mathematical functions which are evolved with Genetic Programming (GP). In a genotype-phenotype mapping, they guide a virtual vehicle which starts at the depot. The genotype is used to compute a heuristic value for each edge with unsatisfied demands. Local information such as the visiting costs from the current position, the remaining load of the vehicle, and the edge demands are available to the heuristic. The virtual vehicle then serves the edge with the lowest heuristic value and is located at its end. This process is repeated until all requirements have been satisfied. The resulting phenotypes are sets of tours which, in turn, are sequences of edges. We show that our method has three advantages: 1) The genotypes can be reused to seed the population in new GP runs. 2) The size of the genotypes is independent from the problem scale. 3) The evolved heuristics even work well in modified or dynamic scenarios and are robust in the presence of noise.