A Hybrid Multi-objective Extremal Optimisation Approach for Multi-objective Combinatorial Optimisation Problems
MetadataShow full item record
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.
2010 IEEE World Congress on Computational Intelligence (WCCI 2010) Proceedings (CEC 2010)
© 2010 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Computer Software not elsewhere classified