A Comparative Study of Multiple-Objective Metaheuristics on the Bi-Objective Set Covering Problem and the Pareto Memetic Algorithm

The paper describes a comparative study of multiple-objective metaheuristics on the bi-objective set covering problem. Ten representative methods based on genetic algorithms, multiple start local search, hybrid genetic algorithms and simulated annealing are evaluated in the computational experiment....

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Annals of operations research Ročník 131; číslo 1-4; s. 135 - 158
Hlavní autor: Jaszkiewicz, Andrzej
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer Nature B.V 01.10.2004
Témata:
Algorithms
Experiments
Genetic algorithms
Heuristic
Operations research
Optimization
Pareto optimum
Studies
ISSN:0254-5330, 1572-9338
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The paper describes a comparative study of multiple-objective metaheuristics on the bi-objective set covering problem. Ten representative methods based on genetic algorithms, multiple start local search, hybrid genetic algorithms and simulated annealing are evaluated in the computational experiment. Nine of the methods are well known from the literature. The paper introduces also a new hybrid genetic algorithm called Pareto memetic algorithm. The results of the experiment indicate very good performance of hybrid genetic algorithms, however, no algorithm was able to outperform all other methods on all instances. Furthermore, the results indicate that the performance of multiple-objective metaheuristics may differ radically even if the methods are based on the same single objective algorithm and use exactly the same problem-specific operators.[PUBLICATION ABSTRACT]
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0254-5330
1572-9338
DOI:10.1023/B:ANOR.0000039516.50069.5b