A Real-Value Parameter Function Optimization Algorithm using Repeated Adaptive Local Search
DOI:
https://doi.org/10.47839/ijc.21.1.2519Keywords:
Real-value Parameters, Function Optimization, Repeated Adaptive Local Search, Shrunk SubregionAbstract
A simple and easy to implement but very effective algorithm for solving real-value parameter optimization problems is introduced in this paper. The main idea of the algorithm is to perform a local search repeatedly on a prospective subregion where the optimal solution may be located. The local search randomly samples a number of solutions in a given subregion. If a new best-so- far solution has been found, the center of the search subregion is moved based on the new best-so-far solution and the size of the search subregion is gradually reduced by a predefined shrinking rate. Otherwise, the center of the search is not moved and the size of the search subregion is reduced using a predefined shrinking rate. This process is repeated for a number of instances so that the search is focused on a gradually smaller and smaller prospective subregion. To enhance the likelihood of achieving an optimal solution, many rounds of this repeated local search are performed. Each round starts with a smaller and smaller initial search space. According to the experiment results, the proposed algorithm, though very simple, can outperform some well-known optimization algorithms on some testing functions.
References
X. Li, M. Yin, “A particle swarm inspired cuckoo search algorithm for real parameter optimization,” Soft Computing, vol. 20, pp. 1389-1413, 2016.
E. K. Nyarko, R. Cupec, D. Filko, “A comparison of several heuristic algorithms for solving high dimensional optimization problems,” International Journal of Electrical and Computer Engineering Systems, vol. 5, no. 1, pp. 1-8, 2014.
X. Xia, J. Liu, Z. Hu, “An improved particle swarm optimizer based on tabu detecting and local learning strategy in a shrunk search space,” Applied Soft Computing, vol. 23, pp. 76-90, 2014.
S. Das, S. S. Mullick, P. N. Suganthan, “Recent advances in differential evolution – An updated survey,” Swarm and Evolutionary Computation, vol. 27, pp. 1-30, 2016.
J. F. Qiu, J. W. Wang, D. Y., J. Xie, and N. Z. Yao, “A parameter adaptive artificial bee colony algorithm for real-parameter optimization,” International Journal of Online and Biomedical Engineering (iJOE), vol. 9, pp. 34-39, 2013.
F. Luo, J. Zhao, Z. Y. Dong, “A new metaheuristic algorithm for real parameter optimization: Natural aggregation algorithm,” Proceedings of the 2016 IEEE Congress on Evolutionary Computation (CEC), 2016, pp. 94-103.
M. Duan, H. Yang, S. Wang, Y. Liu, “Self-adaptive dual-strategy differential evolution algorithm,” PLoS ONE, vol. 14, e0222706, 2019.
T. Eltaeib, A. Mahmood, “Differential evolution: A survey and analysis,” Applied Sciences, vol. 8, issue 10, 1945, 2018.
K. R. Opara, J. Arabas, “Differential evolution: A survey of theoretical analyses,” Swarm and Evolutionary Computation, vol. 44, pp. 546-558, 2018.
P. Agarwal, S. Mehta, “Empirical analysis of five nature-inspired algorithms on real parameter optimization problems,” Artificial Intelligence Review, vol. 50, pp. 383-439, 2018.
M. Mavrovouniotis, F. M. Muller, S. Yang, “Ant colony optimization with local search for dynamic traveling salesman problems,” IEEE Transactions on Cybernetics, vol. 47, no. 7, pp. 1743-1756, 2017.
D. Zhan, J. Qian, Y. Cheng, “Balancing global and local search in parallel efficient global optimization algorithms,” Journal of Global Optimization, vol. 67, pp. 873-892, 2017.
W. Deng, H. Zhao, L. Zou, G. Li, X. Yang, D. Wu, “A novel collaborative optimization algorithm in solving problems,” Soft Computing, vol. 21, pp. 4387-4398, 2017.
A. Nakib, S. Ouchraa, N. Shvai, L. Souquet, and E.-G. Talbi, “Deterministic metaheuristic based on fractal decomposition for large-scale optimization,” Applied Soft Computing, vol. 61, pp. 468–485, 2017.
S. Tuo, J. Zhang, X. Yuan, L. Yong, “A new differential evolution algorithm for solving multimodal optimization problems with high dimensionality,” Soft Computing – A Fusion of Foundations, Methodologies and Applications, vol. 22, issue 13, pp. 4361-4388, 2018.
P. Caamano, F. Bellas, J. A. Bacerra, and R. J. Duro, “Evolutionary algorithm characterization in real parameter optimization problems,” Applied Soft Computing, vol. 13, pp. 1902-1921, 2013.
H. Zhang, J. Sun, T. Liu, K. Zhang, Q. Zhang, “Balancing exploration and exploitation in multi-objective evolutionary optimization,” Information Sciences, vol. 497, pp. 129-148, 2019.
G. Kaur, S. Arora, “Chaotic whale optimization algorithm,” Journal of Computational Design and Engineering, vol. 5, issue 3, pp. 275-284, 2018.
M. Crepinsek, S.-H. Liu, M. Mernik, “Exploration and exploitation in evolutionary algorithm: A survey,” ACM Computing Surveys, vol. 45, issue 3, pp. 1-33, 2013.
X.-S. Yang, “Nature-inspired optimization algorithms: Challenges and open problems,” Journal of Computational Science, vol. 46, article 101104, 2020.
J. Brest, M. S. Maucec, B. Boskovic, “Single objective real-parameter optimization: Algorithm JSO,” Proceedings of the 2017 IEEE Congress on Evolutionary Computation, 2017, pp. 1311-1318.
H. Peng, C. Deng, Z. Wu, “Best neighbor-guided artificial bee colony algorithm for continuous optimization problems,” Soft Computing, vol. 23, pp. 8723–8740, 2019.
J. Ding, J. Liu, K. R. Chowdhury, W. Zhang, Q. Hu, J. Lei, “A particle swarm optimization using local stochastic search and enhancing diversity for continuous optimization,” Neurocomputing, vol. 137, pp. 261-267, 2014.
I. Ciornei, E. Kyriakides, “Hybrid ant colony-genetic algorithm (GAAPI) for global continuous optimization,” IEEE Transactions on Systems, Man, and Cybernetics – Part B: Cybernetics, vol. 42, n. 1, pp. 234-245, 2012.
M. Kaedi, “Fractal-based algorithm: a new metaheuristic method for continuous optimization,” International Journal of Artificial Intelligence, vol. 15, issue 1, pp.76-92, 2017.
B. Akay, D. Karaboga, “A modified artificial bee colony algorithm for real-parameter optimization,” Information Sciences, vol. 192, pp.120-142, 2012.
M. El-Abd, “Generalized opposition-based artificial bee colony algorithm,” Proceedings of the IEEE Congress on Evolution Computation (CEC), 2012, pp. 1-4.
Y. Wang, Z. Cai, Q. Zhang, “Enhancing the search ability of differential evolution through orthogonal crossover,” Information Sciences, vol. 18, issue 1, pp.153–177, 2012.
Y. Wang, Z. Cai, Q. Zhang, “Differential evolution with composite trial vector generation strategies and control parameters,” IEEE Transactions on Evolution Computations, vol. 15, issue 1, pp. 55-66, 2011.
X. S. Yang, “Firefly algorithms for multimodal optimization,” Stochastic algorithms: foundations and applications, SAGA 2009, Lecture Notes in Computer Sciences, vol. 5792, pp. 169-178.
X. S. Yang, H. Gandomi Amir, “Bat algorithm: A novel approach for global engineering optimization,” Engineering Computations, vol. 29, no. 5, 2012, pp. 464-483.
P. Civicioglu, “Transforming geocentric cartesian coordinates to geodetic coordinates by using differential search algorithm,” Computers and Geosciences, vol. 46, pp. 229-247, 2012.
P. Civicioglu, “Backtracking search optimization algorithm for numerical optimization problems,” Applied Mathematics and Computation, vol. 219, issue 15, pp. 8121-8144, 2013.
P. Civicioglu, “Circular antenna array design by using evolutionary search algorithms,” Progress Electromagnetics Research B, vol. 54, pp. 265-284, 2013.
Downloads
Published
How to Cite
Issue
Section
License
International Journal of Computing is an open access journal. Authors who publish with this journal agree to the following terms:• 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.
