By Topic

Do multiple-objective metaheuristics deliver on their promises? A computational experiment on the set-covering problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Jaszkiewicz, A. ; Inst. of Comput. Sci., Poznan Univ. of Technol., Poland

In this paper, we compare the computational efficiency of three state-of-the-art multiobjective metaheuristics (MOMHs) and their single-objective counterparts on the multiple-objective set-covering problem (MOSCP). We use a methodology that allows consistent evaluation of the quality of approximately Pareto-optimal solutions generated by of both MOMHs and single-objective metaheuristics (SOMHs). Specifically, we use the average value of the scalarization functions over a representative sample of weight vectors. Then, we compare computational efforts needed to generate solutions of approximately the same quality by the two kinds of methods. In the computational experiment, we use two SOHMs - the evolutionary algorithm (EA) and memetic algorithm (MA), and three MOMH-controlled elitist nondominated sorting genetic algorithm, the strength Pareto EA, and the Pareto MA. The methods are compared on instances of the MOSCP with 2, 3, and 4 objectives, 20, 40, 80 and 200 rows, and 200, 400, 800 and 1000 columns. The results of the experiment indicate good computational efficiency of the multiple-objective metaheuristics in comparison to their single-objective counterparts.

Published in:

Evolutionary Computation, IEEE Transactions on  (Volume:7 ,  Issue: 2 )