Fetching the paper…
Reading the bibliography…
Multiobjective evolutionary algorithms (MOEAs) are major methods for solving multiobjective optimization problems (MOPs).
I. Das and J. E. Dennis, “Normal-boundary intersection: A new method for generating the pareto surface in nonlinear multicriteria optimization problems,” SIAM journal on optimization , vol. 8, no. 3, pp. 631–657, 1998
1998
Earlier work this paper cites.
E. Zitzler, K. Deb, and L. Thiele, “Comparison of multiobjective evolutionary algorithms: Empirical results,” Evolutionary computation , vol. 8, no. 2, pp. 173–195, 2000
2000
Earlier work this paper cites.
E. Zitzler, M. Laumanns, and L. Thiele, “Spea2: Improving the strength pareto evolutionary algorithm,” TIK report , vol. 103, 2001
2001
Earlier work this paper cites.
K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan, “A fast and elitist multiobjective genetic algorithm: NSGA-II
2002
Earlier work this paper cites.
E. Zitzler and S. Künzli, “Indicator-based selection in multiobjective search,” in International conference on parallel problem solving from nature . Springer, 2004, pp. 832–842
2004
Earlier work this paper cites.
M. Emmerich, N. Beume, and B. Naujoks, “An emo algorithm using the hypervolume measure as selection criterion,” in International Conference on Evolutionary Multi-Criterion Optimization . Springer, 2005, pp. 62–76
2005
Earlier work this paper cites.
Q. Zhang and H. Li, “ MOEA/D
2007
Earlier work this paper cites.
H. Li and Q. Zhang, “Multiobjective optimization problems with complicated pareto sets, MOEA/D
2008
Earlier work this paper cites.
Q. Zhang, W. Liu, E. Tsang, and B. Virginas, “Expensive multiobjective optimization by MOEA/D
2009
Earlier work this paper cites.
S. Das and P. N. Suganthan, “Differential evolution: A survey of the state-of-the-art,” IEEE transactions on evolutionary computation , vol. 15, no. 1, pp. 4–31, 2010
2010
Earlier work this paper cites.
A. Zhou, B.-Y. Qu, H. Li, S.-Z. Zhao, P. N. Suganthan, and Q. Zhang, “Multiobjective evolutionary algorithms: A survey of the state of the art,” Swarm and evolutionary computation , vol. 1, no. 1, pp. 32–49, 2011
2011
Earlier work this paper cites.
J. Bader and E. Zitzler, “Hype: An algorithm for fast hypervolume-based many-objective optimization,” Evolutionary computation , vol. 19, no. 1, pp. 45–76, 2011
2011
Earlier work this paper cites.
A. Ponsich, A. L. Jaimes, and C. A. C. Coello, “A survey on multiobjective evolutionary algorithms for the solution of the portfolio optimization problem and other finance and economics applications,” IEEE transactions on evolutionary computation , vol. 17, no. 3, pp. 321–344, 2012
2012
Earlier work this paper cites.
K. Miettinen, Nonlinear multiobjective optimization . Springer Science & Business Media, 2012, vol. 12
2012
Earlier work this paper cites.
A. Mukhopadhyay, U. Maulik, S. Bandyopadhyay, and C. A. C. Coello, “Survey of multiobjective evolutionary algorithms for data mining: Part ii,” IEEE Transactions on Evolutionary Computation , vol. 18, no. 1, pp. 20–35, 2013
2013
Earlier work this paper cites.
K. Deb and H. Jain, “An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part i: solving problems with box constraints,” IEEE transactions on evolutionary computation , vol. 18, no. 4, pp. 577–601, 2013
2013
Earlier work this paper cites.
L. Ke, Q. Zhang, and R. Battiti, “ MOEA/D-ACO
2013
Earlier work this paper cites.
K. Li, A. Fialho, S. Kwong, and Q. Zhang, “Adaptive operator selection with bandits for a multiobjective evolutionary algorithm based on decomposition,” IEEE Transactions on Evolutionary Computation , vol. 18, no. 1, pp. 114–130, 2013
2013
Earlier work this paper cites.
X. Ma, F. Liu, Y. Qi, M. Gong, M. Yin, L. Li, L. Jiao, and J. Wu, “ MOEA/D
2014
Earlier work this paper cites.
K. Lwin, R. Qu, and G. Kendall, “A learning-guided multi-objective evolutionary algorithm for constrained portfolio optimization,” Applied Soft Computing , vol. 24, pp. 757–772, 2014
2014
Earlier work this paper cites.
X. Qiu, J.-X. Xu, K. C. Tan, and H. A. Abbass, “Adaptive cross-generation differential evolution operators for multiobjective optimization,” IEEE Transactions on Evolutionary Computation , vol. 20, no. 2, pp. 232–244, 2015
2015
Earlier work this paper cites.
A. Trivedi, D. Srinivasan, K. Sanyal, and A. Ghosh, “A survey of multiobjective evolutionary algorithms based on decomposition,” IEEE Transactions on Evolutionary Computation , vol. 21, no. 3, pp. 440–462, 2016
2016
Earlier work this paper cites.
Q. Zhu, Q. Lin, Z. Du, Z. Liang, W. Wang, Z. Zhu, J. Chen, P. Huang, and Z. Ming, “A novel adaptive hybrid crossover operator for multiobjective evolutionary algorithm,” Information Sciences , vol. 345, pp. 177–198, 2016
2016
Earlier work this paper cites.
Y. Tian, R. Cheng, X. Zhang, and Y. Jin, “Platemo: A matlab platform for evolutionary multi-objective optimization [educational forum],” IEEE Computational Intelligence Magazine , vol. 12, no. 4, pp. 73–87, 2017
2017
Earlier work this paper cites.
H. Qian and Y. Yu, “Solving high-dimensional multi-objective optimization problems with low effective dimensions,” in Proceedings of the AAAI Conference on Artificial Intelligence , vol. 31, no. 1, 2017
2017
Earlier work this paper cites.
M. T. Emmerich and A. H. Deutz, “A tutorial on multiobjective optimization: fundamentals and evolutionary methods,” Natural computing , vol. 17, pp. 585–609, 2018
2018
Earlier work this paper cites.
H. Wang and Y. Jin, “A random forest-assisted evolutionary algorithm for data-driven constrained multiobjective combinatorial optimization of trauma systems,” IEEE transactions on cybernetics , vol. 50, no. 2, pp. 536–549, 2018
2018
Earlier work this paper cites.
M. Wu, K. Li, S. Kwong, Q. Zhang, and J. Zhang, “Learning to decompose: A paradigm for decomposition-based multiobjective optimization,” IEEE Transactions on Evolutionary Computation , vol. 23, no. 3, pp. 376–390, 2018
2018
Earlier work this paper cites.
Y. Jin, H. Wang, T. Chugh, D. Guo, and K. Miettinen, “Data-driven evolutionary optimization: An overview and case studies,” IEEE Transactions on Evolutionary Computation , vol. 23, no. 3, pp. 442–458, 2018
2018
Earlier work this paper cites.
J. Sun, H. Zhang, A. Zhou, Q. Zhang, and K. Zhang, “A new learning-based adaptive multi-objective evolutionary algorithm,” Swarm and evolutionary computation , vol. 44, pp. 304–319, 2019
2019
Earlier work this paper cites.
R. Tanabe and H. Ishibuchi, “Review and analysis of three components of the differential evolution mutation operator in MOEA/D-DE
2019
Earlier work this paper cites.
H. Li, K. Deb, Q. Zhang, P. N. Suganthan, and L. Chen, “Comparison between MOEA/D
2019
Earlier work this paper cites.
Z. Cui, Y. Chang, J. Zhang, X. Cai, and W. Zhang, “Improved NSGA-III
2019
Earlier work this paper cites.
J. G. Falcón-Cardona and C. A. C. Coello, “Indicator-based multi-objective evolutionary algorithms: A comprehensive survey,” ACM Computing Surveys (CSUR) , vol. 53, no. 2, pp. 1–35, 2020
2020
Earlier work this paper cites.
K. Li, T. Zhang, and R. Wang, “Deep reinforcement learning for multiobjective optimization,” IEEE transactions on cybernetics , vol. 51, no. 6, pp. 3103–3114, 2020
2020
Cited alongside, same era.
M. Jiang, Z. Wang, H. Hong, and G. G. Yen, “Knee point-based imbalanced transfer learning for dynamic multiobjective optimization,” IEEE Transactions on Evolutionary Computation , vol. 25, no. 1, pp. 117–129, 2020
2020
Cited alongside, same era.
R. Tanabe and H. Ishibuchi, “An easy-to-use real-world multi-objective optimization problem suite,” Applied Soft Computing , vol. 89, p. 106078, 2020
2020
Cited alongside, same era.
J. Blank and K. Deb, “Pymoo: Multi-objective optimization in python,” Ieee access , vol. 8, pp. 89 497–89 509, 2020
2020
Cited alongside, same era.
Y. Jin, H. Wang, and C. Sun, Data-driven evolutionary optimization . Springer, 2021
2021
J. Liang, X. Ban, K. Yu, B. Qu, K. Qiao, C. Yue, K. Chen, and K. C. Tan, “A survey on evolutionary constrained multiobjective optimization,” IEEE Transactions on Evolutionary Computation , vol. 27, no. 2, pp. 201–221, 2022
2022
Later among the works it cites.
R. Espinosa, F. Jiménez, and J. Palma, “Multi-surrogate assisted multi-objective evolutionary algorithms for feature selection in regression and classification problems with time series data,” Information Sciences , vol. 622, pp. 1064–1091, 2023
2023
Closest in time.
X. Liu, J. Sun, Q. Zhang, Z. Wang, and Z. Xu, “Learning to learn evolutionary algorithm: A learnable differential evolution,” IEEE Transactions on Emerging Topics in Computational Intelligence , 2023
2023
Closest in time.
R. Lange, T. Schaul, Y. Chen, T. Zahavy, V. Dalibard, C. Lu, S. Singh, and S. Flennerhag, “Discovering evolution strategies via meta-black-box optimization,” in Proceedings of the Companion Conference on Genetic and Evolutionary Computation , 2023, pp. 29–30
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Z. Wang, H.-L. Zhen, J. Deng, Q. Zhang, X. Li, M. Yuan, and J. Zeng, “Multiobjective optimization-aided decision-making system for large-scale manufacturing planning,” IEEE Transactions on Cybernetics , vol. 52, no. 8, pp. 8326–8339, 2021
2021
Cited alongside, same era.
F. Wang, F. Liao, Y. Li, X. Yan, and X. Chen, “An ensemble learning based multi-objective evolutionary algorithm for the dynamic vehicle routing problem with time windows,” Computers & Industrial Engineering , vol. 154, p. 107131, 2021
2021
Cited alongside, same era.
Y. Shao, J. C.-W. Lin, G. Srivastava, D. Guo, H. Zhang, H. Yi, and A. Jolfaei, “Multi-objective neural evolutionary algorithm for combinatorial optimization problems,” IEEE transactions on neural networks and learning systems , 2021
2021
Cited alongside, same era.
B. Min, H. Ross, E. Sulem, A. P. B. Veyseh, T. H. Nguyen, O. Sainz, E. Agirre, I. Heintz, and D. Roth, “Recent advances in natural language processing via large pre-trained language models: A survey,” ACM Computing Surveys , 2021
2021
Cited alongside, same era.
Z. Song, H. Wang, C. He, and Y. Jin, “A kriging-assisted two-archive evolutionary algorithm for expensive many-objective optimization,” IEEE Transactions on Evolutionary Computation , vol. 25, no. 6, pp. 1013–1027, 2021
2021
Cited alongside, same era.
L. Ma, N. Li, Y. Guo, X. Wang, S. Yang, M. Huang, and H. Zhang, “Learning to optimize: reference vector reinforcement learning adaption to constrained many-objective optimization of industrial copper burdening system,” IEEE Transactions on Cybernetics , 2021
2021
Cited alongside, same era.
F.-Y. Liu and C. Qian, “Prediction guided meta-learning for multi-objective reinforcement learning,” in 2021 IEEE Congress on Evolutionary Computation (CEC) . IEEE, 2021, pp. 2171–2178
2021
Cited alongside, same era.
2023
Closest in time.
K. Sanderson, “Gpt-4 is here: what scientists think,” Nature , vol. 615, no. 7954, p. 773, 2023
2023
Closest in time.
2023
Closest in time.
P. Lee, S. Bubeck, and J. Petro, “Benefits, limits, and risks of gpt-4 as an ai chatbot for medicine,” New England Journal of Medicine , vol. 388, no. 13, pp. 1233–1239, 2023
2023
Closest in time.
2023
Closest in time.
K. Cheng, Q. Guo, Y. He, Y. Lu, S. Gu, and H. Wu, “Exploring the potential of gpt-4 in biomedical engineering: the dawn of a new era,” Annals of Biomedical Engineering , pp. 1–9, 2023
2023
Closest in time.
K. M. Jablonka, P. Schwaller, A. Ortega-Guerrero, and B. Smit, “Is gpt-3 all you need for low-data discovery in chemistry?” 2023
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
E. Kasneci, K. Seßler, S. Küchemann, M. Bannert, D. Dementieva, F. Fischer, U. Gasser, G. Groh, S. Günnemann, E. Hüllermeier et al. , “Chatgpt for good? on opportunities and challenges of large language models for education,” Learning and individual differences , vol. 103, p. 102274, 2023
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
V. Palakonda and J.-M. Kang, “Pre-demo: Preference-inspired differential evolution for multi/many-objective optimization,” IEEE Transactions on Systems, Man, and Cybernetics: Systems , 2023
2023
Closest in time.
I. Kropp, A. P. Nejadhashemi, and K. Deb, “Improved evolutionary operators for sparse large-scale multiobjective optimization problems,” IEEE Transactions on Evolutionary Computation , 2023
2023
Closest in time.
Z. Zhang, Q. Tang, M. Chica, and Z. Li, “Reinforcement learning-based multiobjective evolutionary algorithm for mixed-model multimanned assembly line balancing under uncertain demand,” IEEE Transactions on Cybernetics , 2023
2023
Closest in time.
2023
Closest in time.
M. Pluhacek, A. Kazikova, T. Kadavy, A. Viktorin, and R. Senkerik, “Leveraging large language models for the generation of novel metaheuristic optimization algorithms,” in Proceedings of the Companion Conference on Genetic and Evolutionary Computation , 2023, pp. 1812–1820
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
J. Von Oswald, E. Niklasson, E. Randazzo, J. Sacramento, A. Mordvintsev, A. Zhmoginov, and M. Vladymyrov, “Transformers learn in-context by gradient descent,” in International Conference on Machine Learning . PMLR, 2023, pp. 35 151–35 174
2023
Closest in time.
Y. Li, M. E. Ildiz, D. Papailiopoulos, and S. Oymak, “Transformers as algorithms: Generalization and stability in in-context learning,” 2023
2023
Closest in time.
H. Ishibuchi, L. M. Pang, and K. Shang, “A new framework of evolutionary multi-objective algorithms with an unbounded external archive,” Authorea Preprints , 2023
2023
Closest in time.
S. Liu, Q. Lin, J. Li, and K. C. Tan, “A survey on learnable evolutionary algorithms for scalable multiobjective optimization,” IEEE Transactions on Evolutionary Computation , 2023
2023
Closest in time.