The non-monopolize search (NO)
The non-monopolize search (NO): a novel single-based local search optimization algorithm
You are now following this Submission
- You will see updates in your followed content feed
- You may receive emails, depending on your communication preferences
The non-monopolize search (NO): a novel single-based local search optimization algorithm
A novel single-based local search optimization algorithm called the Non-Monopolize Search (NO). The NO is a single solution metaphor-free algorithm, and its operators are designed based to explore and exploit along the iterative process. The NO works only with a candidate solution, and the operators modify the dimension to move the current solution along the search space.
Abualigah, L., Al-qaness, M. A., Abd Elaziz, M., Ewees, A. A., Oliva, D., & Cuong-Le, T. (2023). The non-monopolize search (NO): a novel single-based local search optimization algorithm. Neural Computing and Applications, 1-28.
https://link.springer.com/article/10.1007/s00521-023-09120-9
Cite As
Laith Abualigah (2026). The non-monopolize search (NO) (https://se.mathworks.com/matlabcentral/fileexchange/156154-the-non-monopolize-search-no), MATLAB Central File Exchange. Retrieved .
General Information
- Version 1.0.1 (5.92 KB)
MATLAB Release Compatibility
- Compatible with any release
Platform Compatibility
- Windows
- macOS
- Linux
