DMCA
Dynamic Hill Climbing: Overcoming the limitations of optimization techniques (1993)
| Venue: | In The Second Turkish Symposium on Artificial Intelligence and Neural Networks |
| Citations: | 6 - 2 self |
BibTeX
@INPROCEEDINGS{Yuret93dynamichill,
author = {Deniz Yuret and Michael de la Maza},
title = {Dynamic Hill Climbing: Overcoming the limitations of optimization techniques},
booktitle = {In The Second Turkish Symposium on Artificial Intelligence and Neural Networks},
year = {1993},
pages = {208--212}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
This paper describes a novel search algorithm, called dynamic hill climbing, that borrows ideas from genetic algorithms and hill climbing techniques. Unlike both genetic and hill climbing algorithms, dynamic hill climbing has the ability to dynamically change its coordinate frame during the course of an optimization. Furthermore, the algorithm moves from a coarse-grained search to a fine-grained search of the function space by changing its mutation rate and uses a diversity-based distance metric to ensure that it searches new regions of the space. Dynamic hill climbing is empirically compared to a traditional genetic algorithm using De Jong's well-known five function test suite [4] and is shown to vastly surpass the performance of the genetic algorithm, often finding better solutions using only 1% as many function evaluations. 1 Introduction Genetic algorithms [13, 10] have been applied to a wide variety of optimization problems ranging from the traveling salesman problem [12, 16] to ...
Keyphrases
optimization technique dynamic hill climbing dynamic hill genetic algorithm fine-grained search coordinate frame novel search algorithm function space salesman problem de jong mutation rate coarse-grained search traditional genetic algorithm optimization problem diversity-based distance wide variety new region many function evaluation function test suite introduction genetic
