arrow
Return

Victoria Amazonica optimization algorithm based on adaptive mutation factor and mathematical distribution for solving minimum spanning tree problem

delete2025-02-25
delete0
PRE
AI
X
Xin-Ru Ma
J
Jie‐Sheng Wang *
Y
Yongcheng Sun
Y
Yixuan Li
张斯文 cover
张斯文 (Siwen Zhang)
S
Shihui Zhang
DOI:10.1007/s10586-024-04895-5delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
The minimum spanning tree problem is of great importance in the field of graph theory and optimization, which can be regarded as an optimization problem itself, and thus can be solved by intelligent optimization algorithms. Victoria Amazonica Optimization (VAO) algorithm is a meta-heuristic algorithm that performs well and solves optimization problems with varying degrees of complexity. To obtain better optimization performance, a VAO algorithm based on adaptive mutation factor and mathematical distribution (RODVAO) is proposed. Adaptive mutation factors are introduced to dynamically adjust the exploration and exploitation of the algorithm, which is conducive to the algorithm jumping out of the local optimum; Mathematical distributions are employed to guide the search direction of the improved algorithm, which expands the search scope while exploring the solution space more efficiently by varying the ranges and trends of the elements of the stochastic matrices and thus practically altering the directions and magnitudes used by the individuals in adjusting the positions. To assess the optimization performance of the proposed improved algorithm, it is subjected to optimization comparison experiments with six different categories of meta-heuristic algorithms on the CEC 2022 test functions. To assess the practicality of the RODVAO algorithm, it is compared with other algorithms for solving fixed-vertices and random-vertices MST problems. The results of the simulation experiments show that the Victoria Amazonica Optimization algorithm based on adaptive mutation factors and mathematical distributions enhances the algorithm's global and local search capabilities, facilitates the jumping out of local optimal solutions, and shows good performance in solving MST problems.
Keywords:
Minimum spanning tree
Victoria Amazonica optimization algorithm
Adaptive mutation factor
Mathematical distribution
Function optimization

Journal

C
Cluster Computing-The Journal of Networks Software Tools and Applications
IF:
4.1
Papers:
5.1K
Citations:
7.5K

Organization

U
university of science & technology liaoning
Scholars:
3.3K
Papers: 2.2K
Citations: 4
Cited Papers

Cited Papers

210Polonium and 210lead content of marine birds from Southeastern Brazil
err2014-09-01
err0
PREAI
errJosé Marcus Godoy; Salvatore Siciliano; Zenildo Lara de Carvalho; Davi C. Tavares; Jaílson Fulgencio de Moura; Maria Luiza D.P. Godoy
errShare
errSave
A Cost-Efficient-Based Cooperative Allocation of Mining Devices and Renewable Resources Enhancing Blockchain Architecture
err2021-09-17
err22
errOAAI
errMohamed, Mohamed A.; Mirjalili, Seyedali; Dampage, Udaya; Salmen, Saleh H.; Obaid, Sami Al; Annuk, Andres
errShare
errSave
errShare
errSave
errShare
errSave
err
IF0
err
err0
PREAI
err
errShare
errSave
Partial shading shading mitigation of PV systems via different meta -heuristic techniques
err2019-01-01
err138
PREAI
errMohamed, Mohamed A.; Diab, Ahmed A. Zaki; Rezk, Hegazy
errShare
errSave
researcher View more