Research Repository

Hybridization of decomposition and local search for multiobjective optimization

Ke, L and Zhang, Q and Battiti, R (2014) 'Hybridization of decomposition and local search for multiobjective optimization.' IEEE Transactions on Cybernetics, 44 (10). 1808 - 1820. ISSN 2168-2267

[img]
Preview
Text
KeZhangBattiti2013a.pdf

Download (201kB) | Preview

Abstract

Combining ideas from evolutionary algorithms, decomposition approaches, and Pareto local search, this paper suggests a simple yet efficient memetic algorithm for combinatorial multiobjective optimization problems: memetic algorithm based on decomposition (MOMAD). It decomposes a combinatorial multiobjective problem into a number of single objective optimization problems using an aggregation method. MOMAD evolves three populations: 1) population P for recording the current solution to each subproblem; 2) population P for storing starting solutions for Pareto local search; and 3) an external population P for maintaining all the nondominated solutions found so far during the search. A problem-specific single objective heuristic can be applied to these subproblems to initialize the three populations. At each generation, a Pareto local search method is first applied to search a neighborhood of each solution in P to update P and P . Then a single objective local search is applied to each perturbed solution in P for improving P and P , and reinitializing P . The procedure is repeated until a stopping condition is met. MOMAD provides a generic hybrid multiobjective algorithmic framework in which problem specific knowledge, well developed single objective local search and heuristics and Pareto local search methods can be hybridized. It is a population based iterative method and thus an anytime algorithm. Extensive experiments have been conducted in this paper to study MOMAD and compare it with some other state-of-the-art algorithms on the multiobjective traveling salesman problem and the multiobjective knapsack problem. The experimental results show that our proposed algorithm outperforms or performs similarly to the best so far heuristics on these two problems. L P E P L E L L E P

Item Type: Article
Subjects: Q Science > QA Mathematics
Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions: Faculty of Science and Health > Computer Science and Electronic Engineering, School of
Depositing User: Jim Jamieson
Date Deposited: 12 Nov 2014 20:14
Last Modified: 07 Apr 2021 10:15
URI: http://repository.essex.ac.uk/id/eprint/11565

Actions (login required)

View Item View Item