The DOI matches its Crossref record; 36 of the 36 references it cites were found in a registry or an index.
Multifactorial Evolution: Toward Evolutionary Multitasking
Open accessAbstract
The design of evolutionary algorithms has typically been focused on efficiently solving a single optimization problem at a time. Despite the implicit parallelism of population-based search, no attempt has yet been made to multitask, i.e., to solve multiple optimization problems simultaneously using a single population of evolving individuals. Accordingly, this paper introduces evolutionary multitasking as a new paradigm in the field of optimization and evolutionary computation. We first formalize the concept of evolutionary multitasking and then propose an algorithm to handle such problems. The methodology is inspired by biocultural models of multifactorial inheritance, which explain the transmission of complex developmental traits to offspring through the interactions of genetic and cultural factors. Furthermore, we develop a cross-domain optimization platform that allows one to solve diverse problems concurrently. The numerical experiments reveal several potential advantages of implicit genetic transfer in a multitasking environment. Most notably, we discover that the creation and transfer of refined genetic material can often lead to accelerated convergence for a variety of complex optimization functions.
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
Pan, S. J., & Yang, Q. (2010) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2009.191 · Cited by 23,387
Multi-Objective Optimization Using Evolutionary Algorithms
Deb, K., & Kalyanmoy, D. (2001) · Andalas University Repository (Andalas University) · Cited by 14,918
(1976) · Cited by 10,423
Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
Solomon, M. M. (1987) · Operations Research · doi:10.1287/opre.35.2.254 · Cited by 4,298
Simulated Binary Crossover for Continuous Search Space.
Deb, K., & Agrawal, R. B. (1995) · Complex Systems · Cited by 2,976
(2005) · Springer eBooks · doi:10.1007/3-540-27659-9 · Cited by 2,370
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
Srinivas, M., & Patnaik, L. M. (1994) · Computer · doi:10.1109/2.294849 · Cited by 2,180
Genetic Algorithms and Random Keys for Sequencing and Optimization
Bean, J. C. (1994) · INFORMS journal on computing · doi:10.1287/ijoc.6.2.154 · Cited by 1,543
Evolutionary computation: Comments on the history and current state
Back, T., Hammel, U., & Schwefel, H.-P. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585888 · Cited by 1,536 · cited 3×
“Let wi = uniformly random [1, 10] and qi = wi + 5.”
BackgroundEvolutionary multi-objective optimization: a historical view of the field
Coello Coello, C. A. (2006) · IEEE Computational Intelligence Magazine · doi:10.1109/mci.2006.1597059 · Cited by 1,446
A simple and effective evolutionary algorithm for the vehicle routing problem
Prins, C. (2004) · Computers & Operations Research · doi:10.1016/s0305-0548(03)00158-8 · Cited by 1,058
Meta-Lamarckian Learning in Memetic Algorithms
Ong, Y. S., & Keane, A. J. (2004) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2003.819944 · Cited by 657
Self-citationAn Efficient Approach to Nondominated Sorting for Evolutionary Multiobjective Optimization
Zhang, X., Tian, Y., Cheng, R., & Jin, Y. (2015) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2014.2308305 · Cited by 531
A Multi-Facet Survey on Memetic Computation
Chen, X., Ong, Y.-S., Lim, M.-H., & Tan, K. C. (2011) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2011.2132725 · Cited by 512
Self-citationMemetic Computation—Past, Present & Future [Research Frontier
Ong, Y.-S., Lim, M., & Chen, X. (2010) · IEEE Computational Intelligence Magazine · doi:10.1109/mci.2010.936309 · Cited by 419
Self-citationLi, K., Fialho, A., Kwong, S., & Zhang, Q. (2014) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2239648 · Cited by 418
A Decomposition-Based Evolutionary Algorithm for Many Objective Optimization
Asafuddoula, M., Ray, T., & Sarker, R. (2015) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2014.2339823 · Cited by 403
Gene-culture coevolutionary theory
Feldman, M. W., & Laland, K. N. (1996) · Trends in Ecology & Evolution · doi:10.1016/0169-5347(96)10052-5 · Cited by 383
Cavalli-Sforza, L. L., & Feldman, M. W. (1973) · Europe PMC (PubMed Central) · Cited by 298
The zero/one multiple knapsack problem and genetic algorithms
Khuri, S., Bäck, T., & Heitkötter, J. (1994) · Proceedings of the 1994 ACM symposium on Applied computing - SAC '94 · doi:10.1145/326619.326694 · Cited by 259
Enhancing Differential Evolution Utilizing Eigenvector-Based Crossover Operator
Guo, S.-M., & Yang, C.-C. (2015) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2297160 · Cited by 237
A Revised Discrete Particle Swarm Optimization for Cloud Workflow Scheduling
Wu, Z., Ni, Z., Gu, L., & Liu, X. (2010) · 2010 International Conference on Computational Intelligence and Security · doi:10.1109/cis.2010.46 · Cited by 221
Cloninger, C. R., Rice, J. P., & Reich, T. (1979) · Europe PMC (PubMed Central) · Cited by 195
Rice, J. P., Cloninger, C. R., & Reich, T. (1978) · Europe PMC (PubMed Central) · Cited by 183
Gaussian mutation and self-adaption for numeric genetic algorithms
Hinterding, R. (2002) · IEEE International Conference on Evolutionary Computation (ICEC) · doi:10.1109/icec.1995.489178 · Cited by 176
Scheduling Scientific Workflows Elastically for Cloud Computing
Lin, C., & Lu, S. (2011) · IEEE ... International Conference on Cloud Computing · doi:10.1109/cloud.2011.110 · Cited by 166
A Hybrid Multiobjective Evolutionary Algorithm for Multiobjective Optimization Problems
Tang, L., & Wang, X. (2013) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2012.2185702 · Cited by 165
Memetic Search With Interdomain Learning: A Realization Between CVRP and CARP
Feng, L., Ong, Y.-S., Lim, M., & Tsang, I. W.-H. (2015) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2014.2362558 · Cited by 156
Self-citationBonyadi, M. R., Michalewicz, Z., & Barone, L. (2013) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2013.6557681 · Cited by 140
A proposition on memes and meta-memes in computing for higher-order learning
Meuth, R. J., Lim, M., Ong, Y.-S., & Wunsch, D. C. (2009) · Memetic Computing · doi:10.1007/s12293-009-0011-1 · Cited by 122
Self-citationOn the Landscape of Combinatorial Optimization Problems
Tayarani-N., M.-H., & Prügel‐Bennett, A. (2013) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2281502 · Cited by 67
Curse and Blessing of Uncertainty in Evolutionary Algorithm Using Approximation
Ong, Y.-S., Zhou, Z., & Lim, D. (2006) · doi:10.1109/cec.2006.1688677 · Cited by 60
Self-citationEvolutionary Computation for Multicomponent Problems: Opportunities and Future Directions
Bonyadi, M. R., Michalewicz, Z., Wagner, M., & Neumann, F. (2018) · Management and industrial engineering · doi:10.1007/978-3-030-01641-8_2 · Cited by 38
Cited by
A Coevolutionary Framework for Constrained Multiobjective Optimization Problems
Tian, Y., Zhang, T., Xiao, J., Zhang, X., & Jin, Y. (2021) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2020.3004012 · Cited by 735
Rajwar, K., Deep, K., & Das, S. (2023) · Artificial Intelligence Review · doi:10.1007/s10462-023-10470-y · Cited by 687
Data-Driven Evolutionary Optimization: An Overview and Case Studies
Jin, Y., Wang, H., Chugh, T., Guo, D., & Miettinen, K. (2019) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2018.2869001 · Cited by 686
Multiobjective Multifactorial Optimization in Evolutionary Multitasking
Gupta, A., Ong, Y.-S., Feng, L., & Tan, K. C. (2017) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2016.2554622 · Cited by 462
Self-citationEvolutionary Multitasking via Explicit Autoencoding
Feng, L., Zhou, L., Zhong, J., Gupta, A., Ong, Y.-S., Tan, K.-C., & Qin, A. K. (2019) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2018.2845361 · Cited by 438
Self-citation
Metadata
- Authors
- Gupta, A., Ong, Y.-S., & Feng, L.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2016-06
- Volume
- 20
- Issue
- 3
- Pages
- 343-357
- ISSN
- 1089-778X (ISSN-L)
- 1941-0026
- OpenAlex
- W2413527939
- Cited by
- 993
- References
- 36
- FWCI
- 23.46
- Type
- journal article
- Language
- en
- Open access
- green
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.