| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6905072 | Applied Soft Computing | 2015 | 12 Pages |
Abstract
- In a D-dimensional space, a random search algorithm called VBSO is introduced.
- Vectors with appropriate orientation gradually converge to a global optimum point.
- 29 unimodal and multimodal benchmark functions are considered.
- The performance of VBSO is compared with that of a number of well-known algorithms.
- Simulations show that VBSO performs better than CEP, FEP, GA, PSO, GSA, DE and ODE.
- For several challenging cases, the performance of VBSO remains good enough.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science Applications
Authors
Amir Afroomand, Saeed Tavakoli,