Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/87942
Citations | ||
Scopus | Web of ScienceĀ® | Altmetric |
---|---|---|
?
|
?
|
Type: | Conference paper |
Title: | Controlling the tradeoff between time and quality by considering the reproductive potential of offspring |
Author: | Parkinson, E. Ghandar, A. Michalewicz, Z. Tuson, A. |
Citation: | Proceedings of the 13th annual conference companion on Genetic and evolutionary computation, 2011 / Krasnogor, N., Lanzi, P.L. (ed./s), pp.135-136 |
Publisher: | ACM |
Publisher Place: | online |
Issue Date: | 2011 |
ISBN: | 9781450306904 |
Conference Name: | Genetic and Evolutionary Computation Conference (GECCO) (12 Jul 2011 - 16 Jul 2011 : Dublin) |
Editor: | Krasnogor, N. Lanzi, P.L. |
Statement of Responsibility: | Eddy Parkinson, Adam Ghandar, Zbigniew Michalewicz, Andrew Tuson |
Abstract: | To improve evolutionary algorithm performance, this paper proposes a strategy to aid ascent and to help avoid premature convergence. Rapid increases in population fitness may result in premature convergence and sub optimal solution. A thresholding mechanism is proposed which discards child solutions only if their fitnesses are either too bad, in which case they are discarded, nor too good, in which case they pose the danger of premature convergence. This strategy is evaluated using two combinatorial optimization problems: the classic TSP benchmark and the more constrained vehicle routing problem (VRP) benchmark. The idea offers a relatively straight forward method for adding value by improving both runtime or solution quality. We consider a stochastic hill climber and a population based heuristic (an evolutionary algorithm). |
DOI: | 10.1145/2001858.2001935 |
Grant ID: | http://purl.org/au-research/grants/arc/DP0985723 |
Published version: | http://dx.doi.org/10.1145/2001858.2001935 |
Appears in Collections: | Aurora harvest 2 Computer Science publications |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.