An Enhanced Genetic Algorithm using Directional-Based Crossover and normal mutation For Global Optimization Problems
Abstract
Global optimization has been employed in many practical modeling processes. Using gradient methods to solve optimization problems may be computationally inefficient and time-consuming, particularly when convexity or differentiability is not guaranteed. On the other hand, nature-inspired techniques offer an effective gradient-free approach for solving complex, non-convex, or non-differentiable problems. Genetic algorithms are one of the most effective and widely used nature-inspired techniques. However, canonical genetic algorithms do not always guarantee convergence to the optimum point owing to the stochastic nature of the genetic operators, and typically require more work to ensure convergence and increase performance. Improving the genetic operators remains an open issue and usually involves a trade-off between the speed of convergence and searchability. In this study, we propose an enhanced genetic algorithm that relies on directional-based crossover and normal mutation operators to increase the speed of convergence while preserving searchability. The proposed algorithm is evaluated using a set of 40 typical benchmark functions in two dimensions. In addition, to examine its performance at higher dimensions, 16 functions from the test set were tested at 10 and 100 dimensions. The evaluation results of the proposed algorithm are compared to the outcomes of three modern optimization algorithms, namely (Whale optimization algorithm, Teacher-Learner based algorithm, and Covariance matrix adaptation evolution strategy). The results revealed that the proposed algorithm outperformed the conventional algorithms at lower dimensions in all test functions and showed a relatively better performance than the other algorithms at higher dimensions.References
Jasbir Singh Arora. Introduction to optimum design fourth edition, 2017.
Michael D Intriligator. Mathematical optimization and economic theory. SIAM, 2002.
Abdur Rais and Ana Viana. Operations research in healthcare: a survey. International transactions in operational research, 18(1):1–31, 2011.
Ashok D Belegundu and Tirupathi R Chandrupatla. Optimization concepts and applications in engineering. Cambridge University Press, 2019.
Sebastian Ruder. An overview of gradient descent optimization algorithms. arXiv preprint arXiv:1609.04747, 2016.
Ersan Yazan and M Fatih Talu. Comparison of the stochastic gradient descent based optimization techniques. In 2017 International Artificial Intelligence and Data Processing Symposium (IDAP), pages 1–5. IEEE, 2017.
AM Bagirov, N Hoseini Monjezi, and S Taheri. An augmented subgradient method for minimizing nonsmooth dc functions. Computational Optimization and Applications, pages 1–28, 2021.
James V Burke, Frank E Curtis, Adrian S Lewis, Michael L Overton, and Lucas EA Sim˜oes. Gradient sampling methods for nonsmooth optimization. Numerical nonsmooth optimization: State of the art algorithms, pages 201–225, 2020.
Crina Grosan and Ajith Abraham. A novel global optimization technique for high dimensional functions. International Journal of Intelligent Systems, 24(4):421–440, 2009.
Christodoulos A Floudas and Panos M Pardalos. Recent advances in global optimization. 2014.
Mykel J Kochenderfer and Tim A Wheeler. Algorithms for optimization. Mit Press, 2019.
Zahra Beheshti and Siti Mariyam Hj Shamsuddin. A review of population-based meta-heuristic algorithms. Int. J. Adv. Soft Comput. Appl, 5(1):1–35, 2013.
Sinem Akyol and Bilal Alatas. Plant intelligence based metaheuristic optimization algorithms. Artificial Intelligence Review, 47(4):417–462, 2017.
Bilal Alatas and Harun Bingol. Comparative assessment of light-based intelligent search and optimization algorithms. Light & Engineering, 28(6), 2020.
Harun Bingol and Bilal Alatas. Chaos based optics inspired optimization algorithms as global solution search approach. Chaos, Solitons & Fractals, 141:110434, 2020.
John Henry Holland et al. Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence. MIT press, 1992.
Fan-Hsun Tseng, Xiaofei Wang, Li-Der Chou, Han-Chieh Chao, and Victor CM Leung. Dynamic resource prediction and allocation for cloud data center using the multiobjective genetic algorithm. IEEE Systems Journal, 12(2):1688–1699, 2017.
Carlos Guerrero, Isaac Lera, and Carlos Juiz. Genetic algorithm for multi-objective optimization of container allocation in cloud architecture. Journal of Grid Computing, 16(1):113–135, 2018.
Hongqiang Li, Danyang Yuan, Xiangdong Ma, Dianyin Cui, and Lu Cao. Genetic algorithm for the optimization of features and neural networks in ecg signals classification. Scientific reports, 7(1):1–12, 2017.
Amit Kumar Gupta, Sharath Chandra Guntuku, Raghuram Karthik Desu, and Aditya Balu. Optimisation of turning parameters by integrating genetic algorithm with support vector regression and artificial neural networks. The International Journal of Advanced Manufacturing Technology, 77(1-4):331–339, 2015.
Arash Rikhtegar, Mohammad Pooyan, and Mohammad Taghi Manzuri-Shalmani. Genetic algorithm-optimised structure of convolutional neural network for face recognition applications. IET Computer Vision, 10(6):559–566, 2016.
Tengku Ahmad Faris Ku Yusoff, Mohd Farid Atan, Nazeri Abdul Rahman, Shanti Faridah Salleh, and Noraziah Abdul Wahab. Optimization of pid tuning using genetic algorithm. Journal of Applied Science & Process Engineering, 2(2), 2015.
Qifeng Lin, Wei Liu, Hongxin Peng, and Yuxing Chen. Efficient genetic algorithm for high-dimensional function optimization. In 2013 Ninth International Conference on Computational Intelligence and Security, pages 255–259. IEEE, 2013.
Oliver Kramer. Genetic algorithms. In Genetic algorithm essentials, pages 11–19. Springer, 2017.
Ahmad Hassanat, Khalid Almohammadi, Esra’a Alkafaween, Eman Abunawas, Awni Hammouri, and VB Surya Prasath. Choosing mutation and crossover ratios for genetic algorithms—a review with a new dynamic approach. Information, 10(12):390, 2019.
Matej ˇCrepinˇsek, Shih-Hsi Liu, and Marjan Mernik. Exploration and exploitation in evolutionary algorithms: A survey. ACM computing surveys (CSUR), 45(3):1–33, 2013.
Yingying Song, Fulin Wang, and Xinxin Chen. An improved genetic algorithm for numerical function optimization. Applied Intelligence, 49(5):1880–1902, 2019.
Olympia Roeva, Stefka Fidanova, and Marcin Paprzycki. Population size influence on the genetic and ant algorithms performance in case of cultivation process modeling. In Recent Advances in Computational Optimization: Results of the Workshop on Computational Optimization WCO 2013, pages 107–120. Springer, 2015.
Yao-Chen Chuang, Chyi-Tsong Chen, and Chyi Hwang. A simple and efficient real-coded genetic algorithm for constrained optimization. Applied Soft Computing, 38:87–105, 2016.
RO Oladele and JS Sadiku. Genetic algorithm performance with different selection methods in solving multi-objective network design problem. International Journal of Computer Applications, 70(12), 2013.
Anupriya Shukla, Hari Mohan Pandey, and Deepti Mehrotra. Comparative review of selection techniques in genetic algorithm. In 2015 international conference on futuristic trends on computational analysis and knowledge management (ABLAZE), pages 515–519. IEEE, 2015.
Hsin-Chuan Kuo and Ching-Hai Lin. A directed genetic algorithm for global optimization. Applied Mathematics and Computation, 219(14):7348–7364, 2013.
Farah Ayiesya Zainuddin, Md Fahmi Abd Samad, and Durian Tunggal. A review of crossover methods and problem representation of genetic algorithm in recent engineering applications. International Journal of Advanced Science and Technology, 29(6s):759–769, 2020.
Na Sun and Yong Lu. A self-adaptive genetic algorithm with improved mutation mode based on measurement of population diversity. Neural Computing and Applications, 31:1435–1443, 2019.
Driss Saadaoui, Mustapha Elyaqouti, Khalid Assalaou, Souad Lidaighbi, et al. Parameters optimization of solar pv cell/module using genetic algorithm based on non-uniform mutation. Energy Conversion and Management: X, 12:100129, 2021.
Zbigniew Michalewicz, Thomas Logan, and Swarnalatha Swaminathan. Evolutionary operators for continuous convex parameter spaces. In Proceedings of the 3rd Annual conference on Evolutionary Programming, pages 84–97. World Scientific, 1994.
Monique Simplicio Viana, Orides Morandin Junior, and Rodrigo Colnago Contreras. A modified genetic algorithm with local search strategies and multi-crossover operator for job shop scheduling problem. Sensors, 20(18):5440, 2020.
Seyedali Mirjalili and Andrew Lewis. The whale optimization algorithm. Advances in engineering software, 95:51–67, 2016.
R Venkata Rao, Vimal J Savsani, and DP Vakharia. Teaching–learning-based optimization: an optimization method for continuous non-linear large scale problems. Information sciences, 183(1):1–15, 2012.
Nikolaus Hansen and Anne Auger. Cma-es: evolution strategies and covariance matrix adaptation. In Proceedings of the 13th annual conference companion on Genetic and evolutionary computation, pages 991–1010, 2011.
Felipe AC Viana. A tutorial on latin hypercube design of experiments. Quality and reliability engineering international, 32(5):1975–1985, 2016.
Mario A Navarro, Diego Oliva, Alfonso Ramos-Michel, Bernardo Morales-Casta˜neda, Daniel Zald´ıvar, and Alberto Luque-Chang. A review of the use of quasi-random number generators to initialize the population in meta-heuristic algorithms. Archives of Computational Methods in Engineering, 29(7):5149–5184, 2022.
V Roshan Joseph. Space-filling designs for computer experiments: A review. Quality Engineering, 28(1):28–35, 2016.
Vlasis K Koumousis and Christos P Katsaras. A saw-tooth genetic algorithm combining the effects of variable population size and reinitialization to enhance performance. IEEE Transactions on Evolutionary Computation, 10(1):19–28, 2006.
M Montaz Ali, Charoenchai Khompatraporn, and Zelda B Zabinsky. A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems. Journal of global optimization, 31(4):635–672, 2005.
Qunfeng Liu, Wei-Neng Chen, Jeremiah D Deng, Tianlong Gu, Huaxiang Zhang, Zhengtao Yu, and Jun Zhang. Benchmarking stochastic algorithms for global optimization problems by visualizing confidence intervals. IEEE Transactions on Cybernetics, 47(9):2924–2937, 2017.
Elizabeth D Dolan and Jorge J Mor´e. Benchmarking optimization software with performance profiles. Mathematical programming, 91(2):201–213, 2002.
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).