Distributing resources in hypercube computers
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
Using the genetic algorithm to find snake-in-the-box codes
IEA/AIE '94 Proceedings of the 7th international conference on Industrial and engineering applications of artificial intelligence and expert systems
A Heuristic Combination Method for Solving Job-Shop Scheduling Problems
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
The snake in the box problem: mathematical conjecture and a genetic algorithm approach
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Toward minimal restriction of genetic encoding and crossovers for the two-dimensional Euclidean TSP
IEEE Transactions on Evolutionary Computation
| Hi-index | 0.00 |
Many complex problems can be solved by a sequence of steps or simple heuristics. In many cases a good solution relies on both good heuristics and proper ordering of their application. Problems such as creating a constrained path through a graph can be solved in this way if we can find a mechanism for ordering the heuristics. We propose using a genetic algorithm (GA) for this purpose to solve the snake-in-the-box problem. However, the additional layer of abstraction created by heuristics weakens the guiding effects of traditional GA operators. We also propose a new set of GA operators that solve this problem by, in the manipulation of the population, applying information from the paths (snakes) produced by the population members. In addition we show the efficacy of this approach by producing a new record length snake of 98 edges in an eight dimensional hypercube. We also compare our new operators with more traditional ones.