본문 바로가기
  • 학술저널

표지

DBpia에서 서비스 중인 논문에 한하여 피인용 수가 반영됩니다. 내서재에 논문을 담은 이용자 수의 총합입니다.

발행기관의 요청으로 개인이 구매하실 수 없습니다.

초록·키워드 목차

This paper adopts and investigates the non-dominated sorting approach for extending the single-objective Cuckoo Search (CS) into a multi-objective framework. The proposed approach uses an archive composed of primary and secondary population to select and keep the non-dominated solutions at each generation instead of pairwise analogy used in the original Multi-objective Cuckoo Search (MOCS). Our simulations show that such a low computational complexity approach can enrich CS to incorporate multi-objective needs instead of considering multiple eggs for cuckoos used in the original MOCS. The proposed MOCS is tested on a set of multi-objective optimization problems and two well-studied engineering design optimization problems. Compared to MOCS and some other available multi-objective algorithms such as NSGA-II, our approach is found to be competitive while benefiting simplicity. Moreover, the proposed approach is simpler and is capable of finding a wide spread of solutions with good coverage and convergence to true Pareto optimal fronts. #multi-objective optimization #engineering design #cuckoo search #metaheuristic

등록된 정보가 없습니다.

저자의 논문

DBpia에서 서비스 중인 논문에 한하여 피인용 수가 반영됩니다.
Insert title here
논문의 정보가 복사되었습니다.
붙여넣기 하세요.