Volume 2, Issue 6, November 2017, Page: 89-97
Performance Evaluation of Best-Worst Selection Criteria for Genetic Algorithm
Abid Hussain, Department of Statistics, Quaid-i-Azam University, Islamabad, Pakistan
Yousaf Shad Muhammad, Department of Statistics, Quaid-i-Azam University, Islamabad, Pakistan
Muhammad Nauman Sajid, Department of Software Engineering, Foundation University, Islamabad, Pakistan
Received: Sep. 27, 2017;       Accepted: Oct. 19, 2017;       Published: Nov. 20, 2017
DOI: 10.11648/j.mcs.20170206.12      View  2441      Downloads  194
Abstract
Genetic algorithm’s performance is based on three major factors, which are selection criteria, crossover and mutation operators. Each factor has its own significant role but the selection criteria to choose parents from the population is the key role to running the genetic algorithm. There is a number of selection schemes that have been introduced in literature and all have their own advantages. Most of the selection criterion is chose the parents which give highly optimum values based on the theory that healthy parents produce healthy offspring. In the current study, we proposed a new selection scheme which selects healthy parents as well as unhealthy parents. The novel selection scheme is simple to implement, and it has notable ability to reduce the effected of premature convergence compared to other selection schemes. We apply this new technique along with some traditional selection schemes on six benchmark problems and Simulation studies show a remarkable performance of the proposed selection scheme.
Keywords
Genetic Algorithm, Genetic Operators, Selection Criterion, Benchmark Problems
To cite this article
Abid Hussain, Yousaf Shad Muhammad, Muhammad Nauman Sajid, Performance Evaluation of Best-Worst Selection Criteria for Genetic Algorithm, Mathematics and Computer Science. Vol. 2, No. 6, 2017, pp. 89-97. doi: 10.11648/j.mcs.20170206.12
Copyright
Copyright © 2017 Authors retain the copyright of this article.
This article is an open access article distributed under the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0/) which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Reference
[1]
John H Holland. Adaptation in natural and artificial systems: An introductory analysis with application to biology, control, and artificial intelligence. Ann Arbor: University of Michigan Press, 1975.
[2]
DE Golberg. Genetic algorithms in search, optimization and machine learning. Addison-Wesley Publishing Company, 1989.
[3]
Kenneth A De Jong. Evolutionary computation: a unified approach. MIT press, 2007.
[4]
Zbigniew Michalewicz. Genetic Algorithms+ Data Structures= Evolution Programs. Springer, 3rd edition, 1996.
[5]
Thomas Back. Selective pressure in evolutionary algorithms: A characterization of selection mechanisms. In Evolutionary Computation, 1994. IEEE World Congress on Computational Intelligence., Proceedings of the First IEEE Conference on, pages 57–62. IEEE, 1994.
[6]
Thomas Back and Frank Hoffmeister. Extended selection mechanisms in genetic algorithms. Citeseer, pages 92–99, 1991.
[7]
David E Goldberg and Kalyanmoy Deb. A comparative analysis of selection schemes used in genetic algorithms. Foundations of genetic algorithms, 1:69–93, 1991.
[8]
Tobias Blickle and Lothar Thiele. A comparison of selection schemes used in genetic algorithms. TIK-Report 11, TIK Institut fur Technische und Kommunikationsnetze, Swiss Federal Institute of Technology, 1995.
[9]
Rakesh Kumar. Blending roulette wheel selection & rank selection in genetic algorithms. International Journal of Machine Learning and Computing, 2 (4): 365, 2012.
[10]
Khalid Jebari and Mohammed Madiafi. Selection methods for genetic algorithms. International Journal of Emerging Sciences, 3 (4): 333–344, 2013.
[11]
Smit Anand, Nishat Afreen, and Shama Yazdani. A novel and efficient selection method in genetic algorithm. International Journal of Computer Applications, 129 (15): 7–12, 2015.
[12]
Hari Mohan Pandey. Performance evaluation of selection methods of genetic algorithm and network security concerns. Procedia Computer Science, 78:13–18, 2016.
[13]
James E Baker. Reducing bias and inefficiency in the selection algorithm. In Proceedings of the second international conference on genetic algorithms, pages 14–21, 1987.
[14]
Anne Brindle. Genetic algorithms for function optimization. Ph. D. Thesis, University of Alberta, Edmonton, 1981.
[15]
James Edward Baker. Adaptive selection methods for genetic algorithms. In Proceedings of an International Conference on Genetic Algorithms and their applications, pages 101–111. Hillsdale, New Jersey, 1985.
[16]
Ingo Rechenberg. Cybernetic solution path of an experimental problem. Ministry of Aviation, Royal Aircraft Establishment, 1965.
[17]
Kalyanmoy Deb and David E Goldberg. An investigation of niche and species formation in genetic function optimization. In Proceedings of the 3rd international conference on genetic.
[18]
Algorithms, pages 42–50. Morgan Kaufmann Publishers Inc., 1989.
[19]
Heinz Mu hlenbein. Parallel genetic algorithms, population genetics and combinatorial optimization. In Workshop on Parallel Processing: Logic, Organization, and Technology, pages 398–406. Springer, 1989.
[20]
Jung Y Suh and Dirk Van Gucht. Distributed genetic algorithms. Computer Science Department, Indiana Univ., 1987.
[21]
Thomas Back. Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms. Oxford university press, 1996.
[22]
Kenneth DeJong. An analysis of the behavior of a class of genetic adaptive systems. Ph. D. Thesis, University of Michigan, 1975.
[23]
AA Goldstein and JF Price. On descent from local minima. Mathematics of Computation, 25 (115): 569–574, 1971.
[24]
Eric E Easom. A survey of global optimization techniques. PhD thesis, University of Louisville, 1990.
Browse journals by subject