Abstract
In this paper, uego, a new general technique for accelerating and/or parallelizing existing search methods is suggested. uego is a generalization and simplification of gas, a genetic algorithm (ga) with subpopulation support. With these changes, the niching technique of gas can be applied along with any kind of optimizers. Besides this, uego can be effectively parallelized. Empirical results are also presented which include an analysis of the effects of the user-given parameters and a comparison with a hill climber and a ga.
This work was supported by the Hungarian Soros Pundation and FKFP 1354/1997.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Thomas Bäck, editor. Proceedings of the Seventh International Conference on Genetic Algorithms, San Francisco, California, 1997. Morgan Kaufmann.
D. Beasley, D. R. Bull, and R. R. Martin. A sequential niche technique for multimodal function optimization. Evolutionary Computation, 1(2):101–125, 1993.
K. Deb. Genetic algorithms in multimodal function optimization. TCGA report no. 89002, The University of Alabama, Dept. of Engineering mechanics, 1989.
K. Deb and David E. Goldberg. An investegation of niche and species formation in genetic function optimization. In J. D. Schaffer, editor, The Proceedings of the Third International Conference on Genetic Algorithms. Morgan Kaufmann, 1989.
A. E. Eiben and J. K. van der Hauw. Graph coloring with adaptive genetic algorithms. Journal of Heuristics, 4(1), 1998.
J. J. Grefenstette. Genesis: A system for using genetic search procedures. In Proceedings of the 1984 Conference on Intelligent Systems and Machines, pages 161–165, 1984.
Hisao Ishibuchi, Tadahiko Murata, and Shigemitsu Tomioka. Effectiveness of genetic local search algorithms. In Bäck [1], pages 505–512.
Márk Jelasity. A wave analysis of the subset sum problem. In Bäck [1], pages 89–96.
Márk Jelasity and József Dombi. GAS, a concept on modeling species in genetic algorithms. Artificial Intelligence, 99(1):1–19, 1998.
A. Juels and M. Wattenberg. Stochastic hillclimbing as a baseline method for evaluating genetic algorithms. Technical report, UC Berkeley, 1994.
S. Khuri, T. Bäck, and J. Heitkötter. An evolutionary approach to combinatorial optimization problems. In The Proceedings of CSC'94, 1993.
M. Mitchell, J. H. Holland, and S. Forrest. When will a genetic algorithm outper-form hillclimbing? In J. D. Cowan et al., editors, Advances in Neural Information Processing Systems 6. Morgan Kaufmann, 1994.
Mutsunori Yagiura and Toshihide Ibaraki. Genetic and local search algorithms as robust and simple optimization tools. In Ibrahim H. Osman and James P. Kelly, editors, Meta-Heuristics: Theory and Application, pages 63–82. Kluwer Academic Publishers, 1996.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jelasity, M. (1998). UEGO, an abstract niching technique for global optimization. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, HP. (eds) Parallel Problem Solving from Nature — PPSN V. PPSN 1998. Lecture Notes in Computer Science, vol 1498. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0056880
Download citation
DOI: https://doi.org/10.1007/BFb0056880
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65078-2
Online ISBN: 978-3-540-49672-4
eBook Packages: Springer Book Archive