The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
On the performance of multiple-objective genetic local search on the 0/1 knapsack problem - a comparative experiment
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Genetic algorithms in search, optimization, and machine learning
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0936 · Cited by 49,010
Genetic Algorithms in Search, Optimization and Machine Learning
Goldberg, D. E., & Robson, D. (1988) · Cited by 18,391
Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach
Zitzler, E., & Thiele, L. (1999) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.797969 · Cited by 8,798
Muiltiobjective Optimization Using Nondominated Sorting in Genetic Algorithms
Srinivas, N., & Deb, K. (1994) · Evolutionary Computation · doi:10.1162/evco.1994.2.3.221 · Cited by 6,935
Glover, F. (1990) · ORSA Journal on Computing · doi:10.1287/ijoc.2.1.4 · Cited by 5,647
Glover, F. (1989) · ORSA Journal on Computing · doi:10.1287/ijoc.1.3.190 · Cited by 5,106
Multiple Criteria Optimization: Theory, Computation, and Application
Laundy, R. S. (1989) · Cited by 3,420
Simulated annealing: theory and applications.
(1988) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(88)90023-7 · Cited by 2,966
Multiple Objective Optimization with Vector Evaluated Genetic Algorithms
Schaffer, J. D. (1985) · international conference on Genetic algorithms · Cited by 2,654
A niched Pareto genetic algorithm for multiobjective optimization
Horn, J., Nafpliotis, N., & Goldberg, D. E. (2002) · Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence · doi:10.1109/icec.1994.350037 · Cited by 2,433
Simulated Annealing: Theory and Applications
van Laarhoven, P. J. M., & Aarts, E. H. L. (1987) · Springer eBooks · doi:10.1007/978-94-015-7744-1 · Cited by 2,385
An Overview of Evolutionary Algorithms in Multiobjective Optimization
Fonseca, C. M., & Fleming, P. J. (1995) · Evolutionary Computation · doi:10.1162/evco.1995.3.1.1 · Cited by 2,266
Multiobjective evolutionary algorithms: classifications, analyses, and new innovations
Lamont, G. B., & Veldhuizen, D. A. V. (1999) · Cited by 1,212
A multi-objective genetic local search algorithm and its application to flowshop scheduling
Ishibuchi, H., & Murata, T. (1998) · IEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews) · doi:10.1109/5326.704576 · Cited by 1,019
Czyzżak, P., & Jaszkiewicz, A. (1998) · Journal of Multi‐Criteria Decision Analysis · doi:10.1002/(sici)1099-1360(199801)7:1<34::aid-mcda161>3.0.co;2-6 · Cited by 793
Self-citationA Connectionist Machine for Genetic Hillclimbing
Ackley, D. H. (1987) · The Kluwer International Series in Engineering and Computer Science · doi:10.1007/978-1-4613-1997-9 · Cited by 731
Genetic search strategies in multicriterion optimal design
Hajela, P., & Lin, C. Y.-T. (1992) · Structural and Multidisciplinary Optimization · doi:10.1007/bf01759923 · Cited by 615
Genetic local search for multi-objective combinatorial optimization
Jaszkiewicz, A. (2002) · European Journal of Operational Research · doi:10.1016/s0377-2217(01)00104-7 · Cited by 548
Self-citationHybrid Evolutionary Algorithms for Graph Coloring
Galinier, P., & Hao, J. (1999) · Journal of Combinatorial Optimization · doi:10.1023/a:1009823419804 · Cited by 484
MOSA method: a tool for solving multiobjective combinatorial optimization problems
Ulungu, E. L., Teghem, J., Fortemps, P. H., & Tuyttens, D. (1999) · Journal of Multi-Criteria Decision Analysis · doi:10.1002/(sici)1099-1360(199907)8:4<221::aid-mcda247>3.0.co;2-o · Cited by 385
On the performance assessment and comparison of stochastic multiobjective optimizers
Fonseca, C. M., & Fleming, P. J. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-61723-x_1022 · Cited by 378
M-PAES: a memetic algorithm for multiobjective optimization
Knowles, J. D., & Corne, D. W. (2002) · Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512) · doi:10.1109/cec.2000.870313 · Cited by 359
Comparison of iterative searches for the quadratic assignment problem
Taillard, É. D. (1995) · Location Science · doi:10.1016/0966-8349(95)00008-6 · Cited by 325
Genetic local search for the TSP: new results
Merz, P., & Freisleben, B. (2002) · IEEE International Conference on Evolutionary Computation (ICEC) · doi:10.1109/icec.1997.592288 · Cited by 236
Comparison of local search-based metaheuristics on the multiple objective knapsack problem
Jaszkiewicz, A. (2001) · Foundations of Computing and Decision Sciences · Cited by 56
Self-citation
Cited by
MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition
Zhang, Q., & Li, H. (2007) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2007.892759 · Cited by 10,069
Evolutionary many-objective optimization: A short review
Ishibuchi, H., Tsukamoto, N., & Nojima, Y. (2008) · 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence) · doi:10.1109/cec.2008.4631121 · Cited by 914
Expensive Multiobjective Optimization by MOEA/D With Gaussian Process Model
Zhang, Q., Liu, W., Tsang, E., & Virginas, B. (2010) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2009.2033671 · Cited by 746
The performance of a new version of MOEA/D on CEC09 unconstrained MOP test instances
Zhang, Q., Liu, W., & Li, H. (2009) · 2009 IEEE Congress on Evolutionary Computation · doi:10.1109/cec.2009.4982949 · Cited by 624
Deep reinforcement learning based computation offloading and resource allocation for MEC
Li, J., Gao, H., Lv, T., & Lu, Y. (2018) · 2018 IEEE Wireless Communications and Networking Conference (WCNC) · doi:10.1109/wcnc.2018.8377343 · Cited by 548
Metadata
- Authors
- Jaszkiewicz, A.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2002-08
- Volume
- 6
- Issue
- 4
- Pages
- 402-412
- ISSN
- 1089-778X (ISSN-L)
- OpenAlex
- W2155345556
- Cited by
- 474
- References
- 25
- FWCI
- 15.94
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.