Improving convergence of evolutionary multi-objective optimization with local search: a concurrent-hybrid algorithm
2011 (English)In: Natural Computing, ISSN 1567-7818, E-ISSN 1572-9796, Vol. 10, no 4, 1407-1430 p.Article in journal (Refereed) Published
A local search method is often introduced in an evolutionary optimization algorithm, to enhance its speed and accuracy of convergence to optimal solutions. In multi-objective optimization problems, the implementation of local search is a non-trivial task, as determining a goal for local search in presence of multiple conflicting objectives becomes a difficult task. In this paper, we borrow a multiple criteria decision making concept of employing a reference point based approach of minimizing an achievement scalarizing function and integrate it as a search operator with a concurrent approach in an evolutionary multi-objective algorithm. Simulation results of the new concurrent-hybrid algorithm on several two to four-objective problems compared to a serial approach, clearly show the importance of local search in aiding a computationally faster and accurate convergence to the Pareto optimal front.
Place, publisher, year, edition, pages
Springer, 2011. Vol. 10, no 4, 1407-1430 p.
Multicriteria optimization; Multiple criteria decision making; Pareto optimality; Evolutionary algorithms; Hybrid algorithms; Achievement scalarizing functions; NSGA-II
IdentifiersURN: urn:nbn:se:kth:diva-70135DOI: 10.1007/s11047-011-9250-4ISI: 000297243700011OAI: oai:DiVA.org:kth-70135DiVA: diva2:485952
Qc 201202072012-02-072012-01-302012-02-07Bibliographically approved