New Sail fish optimizer(NSFO) for EDP

Version 1.0.0 (3.14 KB) by praveen kumar

Economic dispatch problem with valve point loading is solved by sail fish optimizer

0.0

(0)

6 Downloads

Updated 16 Nov 2024

View License

Share
Open in MATLAB Online
Download

3,13,40 units are avialable for simulation.

Cite As

Shadravan, S., et al. “The Sailfish Optimizer: A Novel Nature-Inspired Metaheuristic Algorithm for Solving Constrained Engineering Optimization Problems.” Engineering Applications of Artificial Intelligence, vol. 80, Elsevier BV, Apr. 2019, pp. 20–34, doi:10.1016/j.engappai.2019.01.001.

View more styles

MATLAB Release Compatibility

Created with R2022b

Compatible with any release

Platform Compatibility

Windows macOS Linux

Tags Add Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Newsailfisheco

Version	Published	Release Notes
1.0.0	16 Nov 2024		Download

MLA	Shadravan, S., et al. “The Sailfish Optimizer: A Novel Nature-Inspired Metaheuristic Algorithm for Solving Constrained Engineering Optimization Problems.” Engineering Applications of Artificial Intelligence, vol. 80, Elsevier BV, Apr. 2019, pp. 20–34, doi:10.1016/j.engappai.2019.01.001.
APA	Shadravan, S., Naji, H. R., & Bardsiri, V. K. (2019). The Sailfish Optimizer: A novel nature-inspired metaheuristic algorithm for solving constrained engineering optimization problems. Engineering Applications of Artificial Intelligence, 80, 20–34. Elsevier BV. Retrieved from http://dx.doi.org/10.1016/j.engappai.2019.01.001
BibTeX	@article{Shadravan_2019, title={The Sailfish Optimizer: A novel nature-inspired metaheuristic algorithm for solving constrained engineering optimization problems}, volume={80}, ISSN={0952-1976}, url={http://dx.doi.org/10.1016/j.engappai.2019.01.001}, DOI={10.1016/j.engappai.2019.01.001}, journal={Engineering Applications of Artificial Intelligence}, publisher={Elsevier BV}, author={Shadravan, S. and Naji, H.R. and Bardsiri, V.K.}, year={2019}, month=apr, pages={20–34} }