Abstract
AbstractIn 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.Keywordsmulti-objective optimizationapproximate hypervolume contributionlocal searchflow shop problem
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
