Abstract
Multiple-objective metaheuristics, e.g., multiple-objective evolutionary algorithms, constitute one of the most active fields of multiple-objective optimization. Since 1985, a significant number of different methods have been proposed. However, only few comparative studies of the methods were performed on large-scale problems. We continue two comparative experiments on the multiple-objective 0/1 knapsack problem reported in the literature. We compare the performance of two multiple-objective genetic local search (MOGLS) algorithms to the best performers in the previous experiments using the same test instances. The results of our experiment indicate that our MOGLS algorithm generates better approximations to the nondominated set in the same number of functions evaluations than the other algorithms.
Keywords
Knapsack problemContinuous knapsack problemMetaheuristicMathematical optimizationLocal search (optimization)MathematicsGenetic algorithmSet (abstract data type)Evolutionary algorithmComputer science
Affiliated Institutions
Related Publications
MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition
Decomposition is a basic strategy in traditional multiobjective optimization. However, it has not yet been widely used in multiobjective evolutionary optimization. This paper pr...
Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach
Evolutionary algorithms (EAs) are often well-suited for optimization problems involving several, often conflicting objectives. Since 1985, various evolutionary approaches to mul...
A New Evolutionary Algorithm for Solving Many-Objective Optimization Problems
In this paper, we focus on the study of evolutionary algorithms for solving multiobjective optimization problems with a large number of objectives. First, a comparative study of...
A multi-objective genetic local search algorithm and its application to flowshop scheduling
We propose a hybrid algorithm for finding a set of nondominated solutions of a multi objective optimization problem. In the proposed algorithm, a local search procedure is appli...
An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box Constraints
Having developed multiobjective optimization algorithms using evolutionary optimization methods and demonstrated their niche on various practical problems involving mostly two a...
Publication Info
- Year
- 2002
- Type
- article
- Volume
- 6
- Issue
- 4
- Pages
- 402-412
- Citations
- 465
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
465
OpenAlex
18
Influential
397
CrossRef
Cite This
Andrzej Jaszkiewicz
(2002).
On the performance of multiple-objective genetic local search on the 0/1 knapsack problem - a comparative experiment.
IEEE Transactions on Evolutionary Computation
, 6
(4)
, 402-412.
https://doi.org/10.1109/tevc.2002.802873
Identifiers
- DOI
- 10.1109/tevc.2002.802873