IDA - Intelligent Data Analysis Research Group

BibTeX Entry

@inproceedings{Kubalik06a,
  category = {ida-publications},
  author = {Kubal{\'i}k J. and Faigl J.},
  title = {Iterative Prototype Optimisation with Evolved Improvement Steps},
  booktitle = {EuroGP},
  year = {2006},
  publisher = {Springer Berlin / Heidelberg},
  pages = {154--165},
  url = {http://www.springerlink.com/content/c48m12376577972t/},
  abstract = {Evolutionary algorithms have already been more or less successfully applied to a wide range of optimisation problems. Typically, they are used to evolve a population of complete candidate solutions to a given problem, which can be further refined by some problem-specific heuristic algorithm. In this paper, we introduce a new framework called Iterative Prototype Optimisation with Evolved Improvement Steps. This is a general optimisation framework, where an initial prototype solution is being improved iteration by iteration. In each iteration, a sequence of actions/operations, which improves the current prototype the most, is found by an evolutionary algorithm. The proposed algorithm has been tested on problems from two different optimisation problem domains - binary string optimisation and the traveling salesman problem. Results show that the concept can be used to solve hard problems of big size reliably achieving comparably good or better results than classical evolutionary algorithms and other selected methods.},
  vvvs = {0},
}


Creative Commons License  Content on this site is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Czech Republic License.