이 제출물을 팔로우합니다
- 팔로우하는 게시물 피드에서 업데이트를 확인할 수 있습니다
- 정보 수신 기본 설정에 따라 이메일을 받을 수 있습니다
The Greedy Man Optimization Algorithm (GMOA), developed by Hamed Nozari, is a novel bio-inspired metaheuristic designed to solve complex single and multi-objective optimization problems. GMOA draws inspiration from human behavior, specifically the metaphor of individuals who tenaciously hold on to their positions, modeled as resistant solutions influenced by metaphorical parasites (MMOs). The algorithm introduces two unique mechanisms: MMO resistance, which prevents premature replacement of solutions, ensuring stability and diversity, and periodic parasite removal, which promotes mutation and prevents stagnation. By balancing exploration and exploitation dynamically, GMOA effectively navigates complex, multimodal search spaces, making it highly robust against local optima. This algorithm has been successfully applied to various benchmark functions and can handle constrained and unconstrained optimization problems. GMOA’s ability to maintain a Pareto archive also makes it suitable for multi-objective optimization, offering a promising new approach in the field of evolutionary computation.
인용 양식
Hamed Nozari (2026). Greedy Man Optimization Algorithm (GMOA) (https://kr.mathworks.com/matlabcentral/fileexchange/178869-greedy-man-optimization-algorithm-gmoa), MATLAB Central File Exchange. 검색 날짜: .
| 버전 | 퍼블리시됨 | 릴리스 정보 | Action |
|---|---|---|---|
| 1.0.0 |
