International Journal of Intelligent Systems and Applications (IJISA)
IJISA Vol. 10, No. 12, 8 Dec. 2018
Cover page and Table of Contents: PDF (size: 1961KB)
Varna-based Optimization: A New Method for Solving Global Optimization
Full Text (PDF, 1961KB), PP.1-15
Views: 0 Downloads: 0
Author(s)
Index Terms
VBO, optimization, constrained benchmark, unconstrained benchmark
Abstract
A new and simple optimization algorithm known as Varna-based Optimization (VBO) is introduced in this paper for solving optimization problems. It is inspired by the human-society structure and human behavior. Varna (a Sanskrit word, which means Class) is decided by people’s Karma (a Sanskrit word, which means Action), not by their birth. The performance of the proposed method is examined by experimenting it on six unconstrained, and five constrained benchmark functions having different characteristics. Its results are compared with other well-known optimization methods (PSO, TLBO, and Jaya) for multi-dimensional numeric problems. Our experimental results show that the VBO outperforms other optimization algorithms and have proved the better effectiveness of the proposed algorithm.
Cite This Paper
Ashutosh Kumar Singh, Saurabh, Shashank Srivastava, "Varna-based Optimization: A New Method for Solving Global Optimization", International Journal of Intelligent Systems and Applications(IJISA), Vol.10, No.12, pp.1-15, 2018. DOI:10.5815/ijisa.2018.12.01
Reference
[1]D. E. Goldberg, “Genetic algorithms,” Pearson Education India, 2006.
[2]R. Storn and K. Price, “Differential evolution–a simple and efficient heuristic for global optimization over continuous spaces,” Journal of global optimization 11(4), 341–359, 1997.
[3]J. D. Farmer, N. H. Packard and A. S. Perelson, “The immune system, adaptation, and machine learning,” Physica D: Nonlinear Phenomena 22 (1-3), 187–204, 1986.
[4]H.G. Beyer and H. P. Schwefel, “Evolution strategies–a comprehensive introduction,” Natural computing 1 (1), 3–52, 2002.
[5]S. Das, A. Biswas, S. Dasgupta and A. Abraham, “Bacterial foraging optimization algorithm: theoretical foundations, analysis, and applications,” Foundations of Computational Intelligence, Volume 3, 23–55, 2009.
[6]T. Back, “Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms,” Oxford university press, 1996.
[7]A. Ahrari and A. A. Atai, “Grenade explosion method a novel tool for optimization of multimodal functions,” Applied Soft Computing 10 (4), 1132–1140, 2010.
[8]R. Eberhart and J. Kennedy, “A new optimizer using particle swarm theory, in: Micro Machine and Human Science (MHS’95),” Proceedings of the Sixth International Symposium on, IEEE, pp. 39–43, 1995.
[9]D. Karaboga and B. Basturk, “A powerful and efficient algorithm for numerical function optimization: artificial bee colony (abc) algorithm,” Journal of global optimization 39(3), 459–471, 2007.
[10]M. Eusuff, K. Lansey and F. Pasha, “Shuffled frog-leaping algorithm: a memetic meta-heuristic for discrete optimization,” Engineering optimization 38 (2) 129–154, 2006.
[11]X.-S. Yang, “Firefly algorithms for multimodal optimization,” International symposium on stochastic algorithms, Springer, pp. 169– 178, 2009.
[12]M. Dorigo, M. Birattari and T. Stutzle, “Ant colony optimization,” IEEE computational intelligence magazine 1 (4), 28–39, 2006.
[13]S. S. Khan, S. M. K. Quadri, and M. A. Peer. "Genetic Algorithm for Biomarker Search Problem and Class Prediction." International Journal of Intelligent Systems and Applications 8, no. 9 (2016): 47.
[14]R. V. Rao, V. J. Savsani and D. Vakharia, “Teaching–learning-based optimization: a novel method for constrained mechanical design optimization problems,” Computer-Aided Design 43 (3), 303–315, 2011.
[15]R. Rao, “Jaya: A simple and new optimization algorithm for solving constrained and unconstrained optimization problems,” International Journal of Industrial Engineering Computations 7 (1), 19–34, 2016.
[16]A. E. Eiben, C. H. van Kemenade and J. N. Kok, “Orgy in the computer: Multi-parent reproduction in genetic algorithms,” European Conference on Artificial Life, Springer, pp. 934–945, 1995.
[17]B. Akay and D. Karaboga, “Artificial bee colony algorithm for large-scale problems and engineering design optimization,” Journal of intelligent manufacturing 23 (4), 2012.
[18]J. Liang, T. P. Runarsson, E. Mezura-Montes, M. Clerc, P. Suganthan, C. C. Coello and K. Deb, “Problem definitions and evaluation criteria for the cec 2006 special session on constrained real-parameter optimization,” Journal of Applied Mechanics 41 (8), 2006.
[19]Liu, H., Cai, Z., & Wang, Y. Hybridizing particle swarm optimization with differential evolution for constrained numerical and engineering optimization. Applied Soft Computing, 10(2), 629-640, 2010