Deterministic oscillatory search: a new meta-heuristic optimization algorithm

5Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The paper proposes a new optimization algorithm that is extremely robust in solving mathematical and engineering problems. The algorithm combines the deterministic nature of classical methods of optimization and global converging characteristics of meta-heuristic algorithms. Common traits of nature-inspired algorithms like randomness and tuning parameters (other than population size) are eliminated. The proposed algorithm is tested with mathematical benchmark functions and compared to other popular optimization algorithms. The results show that the proposed algorithm is superior in terms of robustness and problem solving capabilities to other algorithms. The paradigm is also applied to an engineering problem to prove its practicality. It is applied to find the optimal location of multi-type FACTS devices in a power system and tested in the IEEE 39 bus system and UPSEB 75 bus system. Results show better performance over other standard algorithms in terms of voltage stability, real power loss and sizing and cost of FACTS devices.

Cite

CITATION STYLE

APA

Archana, N., Vidhyapriya, R., Benedict, A., & Chandran, K. (2017). Deterministic oscillatory search: a new meta-heuristic optimization algorithm. Sadhana - Academy Proceedings in Engineering Sciences, 42(6), 817–826. https://doi.org/10.1007/s12046-017-0635-7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free