Ordered Incremental Multi-Objective Problem Solving Based on Genetic Algorithms

Ordered Incremental Multi-Objective Problem Solving Based on Genetic Algorithms

Wenting Mo (IBM, China), Sheng-Uei Guan (Xian Jiaotong-Liverpool University, China) and Sadasivan Puthusserypady (Technical University of Denmark, Denmark)
DOI: 10.4018/978-1-4666-1749-0.ch005
OnDemand PDF Download:
List Price: $37.50
10% Discount:-$3.75


Many Multiple Objective Genetic Algorithms (MOGAs) have been designed to solve problems with multiple conflicting objectives. Incremental approach can be used to enhance the performance of various MOGAs, which was developed to evolve each objective incrementally. For example, by applying the incremental approach to normal MOGA, the obtained Incremental Multiple Objective Genetic Algorithm (IMOGA) outperforms state-of-the-art MOGAs, including Non-dominated Sorting Genetic Algorithm-II (NSGA-II), Strength Pareto Evolutionary Algorithm (SPEA) and Pareto Archived Evolution Strategy (PAES). However, there is still an open question: how to decide the order of the objectives handled by incremental algorithms? Due to their incremental nature, it is found that the ordering of objectives would influence the performance of these algorithms. In this paper, the ordering issue is investigated based on IMOGA, resulting in a novel objective ordering approach. The experimental results on benchmark problems showed that the proposed approach can help IMOGA reach its potential best performance.
Chapter Preview

Complete Chapter List

Search this Book: