Cited By
View all- Payne JGiacobini MMoore J(2013)Complex and dynamic population structuresSoft Computing - A Fusion of Foundations, Methodologies and Applications10.1007/s00500-013-0994-x17:7(1109-1120)Online publication date: 1-Jul-2013
Polynomial selection scheme with dynamic parameter estimation in cellular genetic algorithm
Pages 1171 - 1178
Abstract
Recent study has introduced the powerful selection scheme in cellular genetic algorithm that can produce all ranges of selective pressure. The parameters used in that study, however, are empirically estimated by numbers of experiments. In this study, we propose the idea of performing a parameter estimation from a theoretical perspective. In the concept of maximizing the probability to find the new best solution together with hill-climbing optimization, enabling search for an optimal parameter in each generation. The selection scheme with the optimal parameter yields the numbers of mating that maximizes the probability of finding better solutions. This optimal parameter changes during run and it is adaptive to the behavior of a particular evolution. In order to confirm the capability of this parameter estimation method, we have conducted experiments to compare the manually tuned static parameter and the estimated dynamic parameter obtained from this method. Result from the experiment shows that the algorithm with estimated parameter performed better than the former method, even with the best tuned parameter. Therefore, by applying this parameter estimation to the selection scheme stated at the beginning, we would be able to create a new universal adaptive paradigm for the cellular evolutionary algorithm.
References
[1]
E. Alba and B. Dorronsoro. The exploration/exploitation tradeoff in dynamic cellular genetic algorithms. IEEE Trans. Evolutionary Computation, 9(2):126--142, 2005.
[2]
E. Alba and J. M. Troya. Cellular evolutionary algorithms: Evaluating the influence of ratio. In PPSN VI: Proceedings of the 6th International Conference on Parallel Problem Solving from Nature, pages 29--38, London, UK, 2000. Springer-Verlag.
[3]
N. Christofides and E. Benavent. An Exact Algorithm for the Quadratic Assignment Problem on a Tree. OPERATIONS RESEARCH, 37(5):760--768, 1989.
[4]
D. E. Goldberg, K. Deb, and J. Horn. Massive multimodality, deception, and genetic algorithms. In PPSN II: Proceedings of the 2th International Conference on Parallel Problem Solving from Nature, pages 37--46. R. Manner and B. Manderick, Eds., 1992.
[5]
T. C. Koopmans and M. J. Beckmann. Assignment problems and the location of economic activities. Cowles Foundation Discussion Papers 4, Cowles Foundation, Yale University, 1957.
[6]
V. V. Migkikh, A. P. Topchy, E. P. Topchy, V. M. Kureichik, and A. Y. Tetelbaum. Combined genetic and local search algorithm for the quadratic assignment problem. In Proceedings of the SecondAsia-Pacific Conference on Genetic Algorithms and Applications (APGA '00, pages 144--151, 2000.
[7]
A. Misevicius. A fast hybrid genetic algorithm for the quadratic assignment problem. In GECCO '06: Proceedings of the 8th annual conference on Genetic and evolutionary computation, pages 1257--1264, New York, NY, USA, 2006. ACM.
[8]
C. E. Nugent, T. E. Vollmann, and J. Ruml. An Experimental Comparison of Techniques for the Assignment of Facilities to Locations. OPERATIONS RESEARCH, 16(1):150--173, 1968.
[9]
J. Sarma and K. D. Jong. An analysis of the effects of neighborhood size and shape on local selection algorithms. In PPSN IV: Proceedings of the 4th International Conference on Parallel Problem Solving from Nature, pages 236--244, London, UK, 1996. Springer-Verlag.
[10]
J. Sarma and K. D. Jong. An analysis of local selection algorithms in a spatially structured evolutionary algorithm. In Proceedings of the Seventh International Conference on Genetic Algorithms, pages 181--186. Morgan Kaufmann, 1997.
[11]
D. Simoncini, P. Collard, S. Vérel, and M. Clergue. On the influence of selection operators on performances in cellular genetic algorithms. CoRR, abs/0804.0852, 2008.
[12]
D. Simoncini, S. Verel, P. Collard, and M. Clergue. Anisotropic selection in cellular genetic algorithms. In GECCO '06: Proceedings of the 8th annual conference on Genetic and evolutionary computation, pages 559--566, New York, NY, USA, 2006. ACM.
[13]
D. Simoncini, S. Verel, P. Collard, and M. Clergue. Centric selection: a way to tune the exploration/exploitation trade-off. In GECCO '09: Proceedings of the 11th Annual conference on Genetic and evolutionary computation, pages 891--898, New York, NY, USA, 2009. ACM.
[14]
M. Tomassini. Spatially Structured Evolutionary Algorithms: Artificial Evolution in Space and Time (Natural Computing Series). Springer-Verlag New York, Inc., Secaucus, NJ, USA, 2005.
[15]
J. Vatanutanon, N. Noman, and H. Iba. Polynomial selection: A new way to tune selective pressure. In NaBIC, pages 597--602. IEEE, 2010.
Index Terms
- Polynomial selection scheme with dynamic parameter estimation in cellular genetic algorithm
Recommendations
Bat-inspired algorithms with natural selection mechanisms for global optimization
In this paper, alternative selection mechanisms in the bat-inspired algorithm for global optimization problems are studied. The bat-inspired algorithm is a recent swarm-based intelligent system which mimics the echolocation system of micro-bats. In the ...
Adaptive cellular memetic algorithms
A cellular genetic algorithm (CGA) is a decentralized form of GA where individuals in a population are usually arranged in a 2D grid and interactions among individuals are restricted to a set neighborhood. In this paper, we extend the notion of ...
Genetic algorithm-based parameter selection approach to single image defogging
Image defogging is widely used in many outdoor working systems. However, owing to the lack of enough information to solve the equation of image degradation model, existing restoration methods generally introduce some parameters and set these values ...
Comments
Information & Contributors
Information
Published In
July 2011
2140 pages
Copyright © 2011 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 12 July 2011
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
GECCO '11
Sponsor:
Acceptance Rates
Overall Acceptance Rate 1,669 of 4,410 submissions, 38%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 111Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 02 Mar 2025
Other Metrics
Citations
Cited By
View all- Payne JGiacobini MMoore J(2013)Complex and dynamic population structuresSoft Computing - A Fusion of Foundations, Methodologies and Applications10.1007/s00500-013-0994-x17:7(1109-1120)Online publication date: 1-Jul-2013
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in