The DOI matches its Crossref record; 39 of the 39 references it cites were found in a registry or an index.
Considerations in engineering parallel multiobjective evolutionary algorithms
Abstract
Developing multiobjective evolutionary algorithms (MOEAs) involves thoroughly addressing the issues of efficiency and effectiveness. Once convinced of an MOEA's effectiveness the researcher often desires to reduce execution time and/or resource expenditure, which naturally leads to considering the MOEA's parallelization. Parallel MOEAs (pMOEAs) or distributed MOEAs are relatively new developments with few associated publications. pMOEA creation is not a simple task, involving analyzing various parallel paradigms and associated parameters. Thus, a thorough discussion of the major parallelized MOEA paradigms is included in this paper and succinct observations are made regarding an analysis of the current literature. Specifically, a previous MOEA notation is extended into the pMOEA domain to enable precise description and identification of various sets of interest. Innovative concepts for pMOEA migration, replacement and niching schemes are discussed, as well as presenting the first known generic pMOEA formulation. Taken together, this paper's analyses in conjunction with an original pMOEA design serve as a pedagogical framework and example of the necessary process to implement an efficient and effective pMOEA.
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
A fast and elitist multiobjective genetic algorithm: NSGA-II
Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.996017 · Cited by 50,053
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
Multi-Objective Optimization Using Evolutionary Algorithms
Deb, K., & Kalyanmoy, D. (2001) · Andalas University Repository (Andalas University) · Cited by 14,918
No free lunch theorems for optimization
Wolpert, D. H., & Macready, W. G. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585893 · Cited by 14,237
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
The Anatomy of the Grid: Enabling Scalable Virtual Organizations
Foster, I., Kesselman, C., & Tuecke, S. (2001) · The International Journal of High Performance Computing Applications · doi:10.1177/109434200101500302 · Cited by 6,547
Comparison of Multiobjective Evolutionary Algorithms: Empirical Results
Zitzler, E., Deb, K., & Thiele, L. (2000) · Evolutionary Computation · doi:10.1162/106365600568202 · Cited by 5,697
Evolutionary Algorithms for Solving Multi-Objective Problems
(2007) · Genetic and Evolutionary Computation Series · doi:10.1007/978-0-387-36797-2 · Cited by 5,686
Bäck, T. (1996) · Oxford University Press eBooks · doi:10.1093/oso/9780195099713.001.0001 · Cited by 5,113
Genetic Algorithms + Data Structures = Evolution Programs
Michalewicz, Z. (1996) · Springer eBooks · doi:10.1007/978-3-662-03315-9 · Cited by 5,095
SPEA2: Improving the strength pareto evolutionary algorithm
Zitzler, E., Laumanns, M., & Thiele, L. (2001) · doi:10.3929/ethz-a-004284029 · Cited by 5,008
Evolutionary Algorithms for Solving Multi-Objective Problems
Coello Coello, C. A., Van Veldhuizen, D. A., & Lamont, G. B. (2002) · Genetic Algorithms and Evolutionary Computation · doi:10.1007/978-1-4757-5184-0 · Cited by 2,663
Self-citationGENETIC ALGORITHMS FOR MULTI-OBJECTIVE OPTIMIZATION: FORMULATION, DISCUSSION, AND GENERALIZATION
Fonseca, C. M., & Fleming, P. J. (1993) · Cited by 2,056
Evolutionary algorithms for multiobjective optimization: methods and applications
Zitzler, E. (1999) · doi:10.3929/ethz-a-003856832 · Cited by 1,965
Mathematical Statistics With Applications
Meek, G. E. (1987) · Technometrics · doi:10.1080/00401706.1987.10488256 · Cited by 1,425
PVM: A Users' Guide and Tutorial for Network Parallel Computing
Geist, A., Beguelin, A., Dongarra, J., Jiang, W., Manchek, R., & Sunderam, V. S. (1994) · The MIT Press eBooks · doi:10.7551/mitpress/5712.001.0001 · Cited by 1,397
Parallel programming in OpenMP
Chandra, R., Dagum, L., Kohr, D., Maydan, D. E., & McDonald, J. (2001) · Cited by 1,293
Multiobjective evolutionary algorithms: classifications, analyses, and new innovations
Lamont, G. B., & Veldhuizen, D. A. V. (1999) · Cited by 1,212
Self-citationIntroduction to parallel computing: design and analysis of algorithms
Kumar, V., Grama, A. Y., Gupta, A., & Karypis, G. (1994) · Benjamin-Cummings Publishing Co., Inc. eBooks · Cited by 1,210
Multiobjective Evolutionary Algorithms: Analyzing the State-of-the-Art
Veldhuizen, D. A. V., & Lamont, G. B. (2000) · Evolutionary Computation · doi:10.1162/106365600568158 · Cited by 1,201
Self-citationMessy genetic algorithms: motivation, analysis, and first results
Goldberg, D. E., Korb, B., & Deb, K. (1989) · Complex Systems · Cited by 1,127
Gropp, W., & Lusk, E. (2001) · Beowulf Cluster Computing with Linux · doi:10.7551/mitpress/1556.003.0013 · Cited by 1,124
The anatomy of the grid: enabling scalable virtual organizations
Foster, I. T. (2005) · IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGrid) · doi:10.1109/ccgrid.2001.923162 · Cited by 1,097
Efficient and Accurate Parallel Genetic Algorithms
Cantú‐Paz, E. (2001) · Genetic algorithms and evolutionary computation · doi:10.1007/978-1-4615-4369-5 · Cited by 869
Parallelism and evolutionary algorithms
Alba, E., & Tomassini, M. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2002.800880 · Cited by 823
Multiobjective optimization using dynamic neighborhood particle swarm optimization
Hu, X., & Eberhart, R. (2003) · Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600) · doi:10.1109/cec.2002.1004494 · Cited by 613
On metrics for comparing nondominated sets
Knowles, J., & Corne, D. (2003) · Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600) · doi:10.1109/cec.2002.1007013 · Cited by 560
Genetic algorithms + data structures = evolution programs (3rd ed.)
Michalewicz, Z. (1996) · Springer eBooks · Cited by 553
High Performance Cluster Computing: Architectures and Systems
Buyya, R. (1999) · Prentice Hall PTR eBooks · Cited by 511
Multiobjective evolutionary algorithm test suites
van Veldhuizen, D. A., & Lamont, G. B. (1999) · Proceedings of the 1999 ACM symposium on Applied computing · doi:10.1145/298151.298382 · Cited by 447
Self-citationEvaluating evolutionary algorithms
Whitley, D., Rana, S., Dzubera, J., & Mathias, K. E. (1996) · Artificial Intelligence · doi:10.1016/0004-3702(95)00124-7 · Cited by 406
RapidAccurate Optimization of Difficult Problems Using Fast Messy Genetic Algorithms
Goldberg, D. E., Deb, K., Kargupta, H., & Harik, G. R. (1993) · Cited by 326
Building Blocks, Cohort Genetic Algorithms, and Hyperplane-Defined Functions
Holland, J. H. (2000) · Evolutionary Computation · doi:10.1162/106365600568220 · Cited by 180
Analyzing synchronous and asynchronous parallel distributed genetic algorithms
Alba, E., & Troya, J. M. (2001) · Future Generation Computer Systems · doi:10.1016/s0167-739x(99)00129-6 · Cited by 167
Improving flexibility and efficiency by adding parallelism to genetic algorithms
Alba, E., & Troya, J. M. (2002) · Statistics and Computing · doi:10.1023/a:1014803900897 · Cited by 98
An Indexed Bibliography of Genetic Algorithms
Alander, J. T. (1995) · CRC Press eBooks · doi:10.1201/9781420050073.ax1 · Cited by 58
DIVIDED RANGE GENETIC ALGORITHMS IN MULTIOBJECTIVE OPTIMIZATION PROBLEMS
Hiroyasu, T., Miki, M., & Watanabe, S. (1999) · Cited by 24
Cited by
Multi-objective optimization using genetic algorithms: A tutorial
Konak, A., Coit, D. W., & Smith, A. E. (2006) · Reliability Engineering & System Safety · doi:10.1016/j.ress.2005.11.018 · Cited by 3,440
Liu, H.-L., Gu, F., & Zhang, Q. (2014) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2281533 · Cited by 813
Distributed evolutionary algorithms and their models: A survey of the state-of-the-art
Gong, Y.-J., Chen, W.-N., Zhan, Z.-H., Zhang, J., Li, Y., Zhang, Q., & Li, J.-J. (2015) · Applied Soft Computing · doi:10.1016/j.asoc.2015.04.061 · Cited by 393
Metadata
- Authors
- Van Veldhuizen, D. A., Zydallis, J. B., & Lamont, G. B.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2003-04
- Volume
- 7
- Issue
- 2
- Pages
- 144-173
- ISSN
- 1089-778X (ISSN-L)
- OpenAlex
- W2146531337
- Cited by
- 260
- References
- 39
- FWCI
- 18.57
- 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.