Computer Science – Neural and Evolutionary Computing
Scientific paper
2007-07-04
ECAI'2004 (27/08/2004) 166-170
Computer Science
Neural and Evolutionary Computing
Scientific paper
We proposed a new search heuristic using the scuba diving metaphor. This approach is based on the concept of evolvability and tends to exploit neutrality which exists in many real-world problems. Despite the fact that natural evolution does not directly select for evolvability, the basic idea behind the scuba search heuristic is to explicitly push evolvability to increase. A comparative study of the scuba algorithm and standard local search heuristics has shown the advantage and the limitation of the scuba search. In order to tune neutrality, we use the NKq fitness landscapes and a family of travelling salesman problems (TSP) where cities are randomly placed on a lattice and where travel distance between cities is computed with the Manhattan metric. In this last problem the amount of neutrality varies with the city concentration on the grid ; assuming the concentration below one, this TSP reasonably remains a NP-hard problem.
Clergue Manuel
Collard Philippe
Verel Sébastien
No associations
LandOfFree
How to use the Scuba Diving metaphor to solve problem with neutrality ? does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with How to use the Scuba Diving metaphor to solve problem with neutrality ?, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and How to use the Scuba Diving metaphor to solve problem with neutrality ? will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-547743