Loading...
Volcano eruption algorithm for solving optimization problems
Hosseini, Eghbal ; Al-Shakarchi, Ali ; Ghafoor, Kayhan Zrar ; Rawat, Danda B ; Saif, Mehrdad ; Yang, Xinan
Hosseini, Eghbal
Al-Shakarchi, Ali
Ghafoor, Kayhan Zrar
Rawat, Danda B
Saif, Mehrdad
Yang, Xinan
Editors
Other contributors
Affiliation
Epub Date
Issue Date
2020-06-30
Submitted date
Alternative
Abstract
Meta-heuristic algorithms have been proposed to solve several optimization problems in different research areas due to their unique attractive features. Traditionally, heuristic approaches are designed separately for discrete and continuous problems. This paper leverages the meta-heuristic algorithm for solving NP-hard problems in both continuous and discrete optimization fields, such as nonlinear and multi-level programming problems through extensive simulations of volcano eruption process. In particular, a new optimization solution named Volcano Eruption Algorithm (VEA) proposed in this paper, which is inspired from the nature of volcano eruption. The feasibility and efficiency of the algorithm are evaluated using numerical results obtained through several test problems reported in the state-of-theart literature. Based on the solutions and number of required iterations, we observed that the proposed meta-heuristic algorithm performs remarkably well to solve NP-hard problem. Furthermore, the proposed algorithm is applied to solve some large-size benchmarking LP and Internet of Vehicles (IoV) problems efficiently.
Citation
Hosseini, E., Safaa Sadiq, A., Ghafoor, K.Z., Rawat, D.B., Saif, M. and Yang, X. (2020) Volcano eruption algorithm for solving optimization problems, Neural Computing and Applications 33, pp. 2321–2337
Publisher
Research Unit
PubMed ID
PubMed Central ID
Embedded videos
Additional Links
Type
Journal article
Language
en
Description
This is an accepted manuscript of an article published by Springer in Neural Computing and Applications on 30/06/2020, available online at https://doi.org/10.1007/s00521-020-05124-x
The accepted version of the publication may differ from the final published version.
Series/Report no.
ISSN
0941-0643