Scholay

学术搜索 · AI 审稿 · LaTeX 协作

Solving Two Multi-Objective Optimization Problems Using Evolutionary Algorithm

作者:Ruhul Sarker, Hussein A. Abbass, Charles Newton · 发表于:IGI Global eBooks · 年份:2003 · DOI:10.4018/978-1-59140-037-0.ch013 · 被引用次数:14 · 研究领域:Advanced Multi-Objective Optimization Algorithms、Metaheuristic Optimization Algorithms Research、Evolutionary Algorithms and Applications

Being capable of finding a set of pareto-optimal solutions in a single run is a necessary feature for multi-criteria decision making, Evolutionary algorithms (EAs) have attracted many researchers and practitioners to address the solution of Multi-objective Optimization Problems (MOPs). In a previous work, we developed a Pareto Differential Evolution (PDE) algorithm to handle multi-objective optimization problems. Despite the overwhelming number of Multi-objective Evolutionary Algorithms (MEAs) in the literature, little work has been done to identify the best MEA using an appropriate assessment methodology. In this chapter, we compare our algorithm with twelve other well-known MEAs, using a popular assessment methodology, by solving two benchmark problems. The comparison shows the superiority of our algorithm over others.