Solving Three-Objective Flow Shop Problem with Fast Hypervolume-Based Local Search Algorithm

In this paper, we present a fast hypervolume-based multi-objective local search algorithm, where the fitness assignment is realized by the approximating computation of hypervolume contribution. In the algorithm, we define an approximate hypervolume contribution indicator as the selection mechanism a...

Full description

Saved in:
Bibliographic Details
Published inIntelligent Computing Methodologies pp. 11 - 25
Main Authors Zeng, Rong-Qiang, Shang, Ming-Sheng
Format Book Chapter
LanguageEnglish
Published Cham Springer International Publishing 2014
SeriesLecture Notes in Computer Science
Subjects
approximate hypervolume contribution
flow shop problem
local search
multi-objective optimization
Online AccessGet full text

Cover

More Information
Summary:In this paper, we present a fast hypervolume-based multi-objective local search algorithm, where the fitness assignment is realized by the approximating computation of hypervolume contribution. In the algorithm, we define an approximate hypervolume contribution indicator as the selection mechanism and apply this indicator to an iterated local search. We carry out a range of experiments on three-objective flow shop problem. Experimental results indicate that our algorithm is highly effective in comparison with the algorithms based on the binary indicators and the exact hypervolume contribution indicator.
ISBN:9783319093383
331909338X
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-319-09339-0_2