Research Repository

MOEA/D with Tabu Search for multiobjective permutation flow shop scheduling problems

Alhindi, A and Zhang, Q (2014) MOEA/D with Tabu Search for multiobjective permutation flow shop scheduling problems. In: UNSPECIFIED, ? - ?.

[img]
Preview
Text
MOEAD_TS_WCCI2014.pdf

Download (709kB) | Preview

Abstract

© 2014 IEEE. Multiobjective Evolutionary Algorithm based on Decomposition (MOEA/D) decomposes a multiobjective optimisation problem into a number of single-objective problems and optimises them in a collaborative manner. This paper investigates how to use Tabu Search (TS), a well-studied single objective heuristic to enhance MOEA/D performance. In our proposed approach, the TS is applied to these subproblems with the aim to escape from local optimal solutions. The experimental studies have shown that MOEA/D with TS outperforms the classical MOEA/D on multiobjective permutation flow shop scheduling problems. It also have demonstrated that use of problem specific knowledge can significantly improve the algorithm performance.

Item Type: Conference or Workshop Item (Paper)
Additional Information: Published proceedings: Proceedings of the 2014 IEEE Congress on Evolutionary Computation, CEC 2014
Subjects: 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: 10 Jun 2014 13:48
Last Modified: 17 Aug 2017 17:51
URI: http://repository.essex.ac.uk/id/eprint/9694

Actions (login required)

View Item View Item