Abstract
Extremal optimisation (EO) is a relatively recent nature-inspired heuristic whose search method is especially suitable to solve combinatorial optimisation problems. To date, most of the research in EO has been applied for solving single-objective problems and only a relatively small number of attempts to extend EO toward multi-objective problems. This paper presents a hybrid multi-objective version of EO (HMEO) to solve multi-objective combinatorial problems. This new approach consists of a multi-objective EO framework, for the coarse-grain search, which contains a novel multi-objective combinatorial local search framework for the fine-grain search. The chosen problems to test the proposed method are the multi-objective knapsack problem and the multi-objective quadratic assignment problem. The results show that the new algorithm is able to obtain competitive results to SPEA2 and NSGA-II. The non-dominated points found are well-distributed and similar or very close to the Pareto-front found by previous works.
Original language | English |
---|---|
Title of host publication | 2010 IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010 |
DOIs | |
Publication status | Published - 2010 |
Event | 2010 6th IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010 - Barcelona, Spain Duration: 18 Jul 2010 → 23 Jul 2010 |
Conference
Conference | 2010 6th IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010 |
---|---|
Country/Territory | Spain |
City | Barcelona |
Period | 18/07/10 → 23/07/10 |