Fetching the paper…
Reading the bibliography…
Multi-objective optimization problems (MOPs) are ubiquitous in real-world applications, presenting a complex challenge of balancing multiple conflicting objectives.
M. B. Schmid and J. R. Roth, “Genetic methods for analysis and manipulation of inversion mutations in bacteria,” Genetics , vol. 105, no. 3, pp. 517–537, 1983
1983
Earlier work this paper cites.
T. Bäck and H.-P. Schwefel, “An overview of evolutionary algorithms for parameter optimization,” Evolutionary computation , vol. 1, no. 1, pp. 1–23, 1993
1993
Earlier work this paper cites.
K. Deb, R. B. Agrawal et al. , “Simulated binary crossover for continuous search space,” Complex systems , vol. 9, no. 2, pp. 115–148, 1995
1995
Earlier work this paper cites.
I. Ono, M. Yamamura, and S. Kobayashi, “A genetic algorithm for job-shop scheduling problems using job-based order crossover,” in Proceedings of IEEE International Conference on evolutionary computation . IEEE, 1996, pp. 547–552
1996
Earlier work this paper cites.
D. A. Van Veldhuizen, G. B. Lamont et al. , “Evolutionary computation and convergence to a pareto front,” in Late breaking papers at the genetic programming 1998 conference . Citeseer, 1998, pp. 221–228
1998
Earlier work this paper cites.
J. Garnier, L. Kallel, and M. Schoenauer, “Rigorous hitting times for binary mutations,” Evolutionary Computation , vol. 7, no. 2, pp. 173–203, 1999
1999
Earlier work this paper cites.
K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan, “A fast and elitist multiobjective genetic algorithm: Nsga-ii,” IEEE transactions on evolutionary computation , vol. 6, no. 2, pp. 182–197, 2002
2002
Earlier work this paper cites.
Q. Zhang and H. Li, “Moea/d: A multiobjective evolutionary algorithm based on decomposition,” IEEE Transactions on evolutionary computation , vol. 11, no. 6, pp. 712–731, 2007
2007
Earlier work this paper cites.
M. Janga Reddy and D. Nagesh Kumar, “An efficient multi-objective optimization algorithm based on swarm intelligence for engineering design,” Engineering Optimization , vol. 39, no. 1, pp. 49–68, 2007
2007
Earlier work this paper cites.
N. Beume, B. Naujoks, and M. Emmerich, “Sms-emoa: Multiobjective selection based on dominated hypervolume,” European Journal of Operational Research , vol. 181, no. 3, pp. 1653–1669, 2007
2007
Earlier work this paper cites.
K. Deb, K. Sindhya, and T. Okabe, “Self-adaptive simulated binary crossover for real-parameter optimization,” in Proceedings of the 9th annual conference on genetic and evolutionary computation , 2007, pp. 1187–1194
2007
Earlier work this paper cites.
S. C. Chiam, K. C. Tan, and A. Al Mamum, “Evolutionary multi-objective portfolio optimization in practical context,” International Journal of Automation and Computing , vol. 5, pp. 67–80, 2008
2008
Earlier work this paper cites.
C. Bazgan, H. Hugot, and D. Vanderpooten, “Solving efficiently the 0–1 multi-objective knapsack problem,” Computers & Operations Research , vol. 36, no. 1, pp. 260–279, 2009
2009
Earlier work this paper cites.
W. Peng, Q. Zhang, and H. Li, “Comparison between moea/d and nsga-ii on the multi-objective travelling salesman problem,” in Multi-objective memetic algorithms . Springer, 2009, pp. 309–324
2009
Earlier work this paper cites.
Z. H. Ahmed, “Genetic algorithm for the traveling salesman problem using sequential constructive crossover operator,” International Journal of Biometrics & Bioinformatics (IJBB) , vol. 3, no. 6, p. 96, 2010
2010
Earlier work this paper cites.
L. Bradstreet, The hypervolume indicator for multi-objective optimisation: calculation and use . University of Western Australia Perth, 2011
2011
Earlier work this paper cites.
H. Ouerfelli and A. Dammak, “The genetic algorithm with two point crossover to solve the resource-constrained project scheduling problems,” in 2013 5th International Conference on Modeling, Simulation and Applied Optimization (ICMSAO) . IEEE, 2013, pp. 1–4
2013
Earlier work this paper cites.
M. Asafuddoula, T. Ray, and R. Sarker, “A decomposition-based evolutionary algorithm for many objective optimization,” IEEE Transactions on Evolutionary Computation , vol. 19, no. 3, pp. 445–460, 2014
2014
Earlier work this paper cites.
T. Bartz-Beielstein, J. Branke, J. Mehnen, and O. Mersmann, “Evolutionary algorithms,” Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery , vol. 4, no. 3, pp. 178–195, 2014
2014
Earlier work this paper cites.
C. Dai, Y. Wang, and M. Ye, “A new multi-objective particle swarm optimization algorithm based on decomposition,” Information Sciences , vol. 325, pp. 541–557, 2015
2015
Cited alongside, same era.
Z. He and G. G. Yen, “Many-objective evolutionary algorithms based on coordinated selection strategy,” IEEE Transactions on Evolutionary Computation , vol. 21, no. 2, pp. 220–233, 2016
2016
Cited alongside, same era.
R. Cheng, Y. Jin, M. Olhofer, and B. Sendhoff, “A reference vector guided evolutionary algorithm for many-objective optimization,” IEEE Transactions on Evolutionary Computation , vol. 20, no. 5, pp. 773–791, 2016
2016
Cited alongside, same era.
N. Gunantara, “A review of multi-objective optimization: Methods and its applications,” Cogent Engineering , vol. 5, no. 1, p. 1502242, 2018
2018
Cited alongside, same era.
Y. Huang, W. Zhou, Y. Wang, M. Li, L. Feng, and K. C. Tan, “Evolutionary multitasking with centralized learning for large-scale combinatorial multi-objective optimization,” IEEE Transactions on Evolutionary Computation , pp. 1–1, 2023
2023
Later among the works it cites.
X. Xue, C. Yang, L. Feng, K. Zhang, L. Song, and K. C. Tan, “Solution transfer in evolutionary optimization: An empirical study on sequential transfer,” IEEE Transactions on Evolutionary Computation , pp. 1–1, 2023
2023
Later among the works it cites.
Y. Feng, L. Feng, S. Kwong, and K. C. Tan, “A multi-form evolutionary search paradigm for bi-level multi-objective optimization,” IEEE Transactions on Evolutionary Computation , pp. 1–1, 2023
2023
Later among the works it cites.
L. Belzner, T. Gabor, and M. Wirsing, “Large language model assisted software engineering: prospects, challenges, and a case study,” in International Conference on Bridging the Gap between AI and Reality . Springer, 2023, pp. 355–374
2023
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Y. Tian, X. Xiang, X. Zhang, R. Cheng, and Y. Jin, “Sampling reference points on the pareto fronts of benchmark multi-objective optimization problems,” in 2018 IEEE congress on evolutionary computation (CEC) . IEEE, 2018, pp. 1–6
2018
Cited alongside, same era.
Y. Sun, G. G. Yen, and Z. Yi, “Igd indicator-based evolutionary algorithm for many-objective optimization problems,” IEEE Transactions on Evolutionary Computation , vol. 23, no. 2, pp. 173–187, 2018
2018
Cited alongside, same era.
K. Li, R. Chen, G. Fu, and X. Yao, “Two-archive evolutionary algorithm for constrained multiobjective optimization,” IEEE Transactions on Evolutionary Computation , vol. 23, no. 2, pp. 303–315, 2018
2018
Cited alongside, same era.
Y. Wang, C. Chen, Y. Tao, Z. Wen, B. Chen, and H. Zhang, “A many-objective optimization of industrial environmental management using nsga-iii: A case of china’s iron and steel industry,” Applied energy , vol. 242, pp. 46–56, 2019
2019
Cited alongside, same era.
Y. Shuai, S. Yunfeng, and Z. Kai, “An effective method for solving multiple travelling salesman problem based on nsga-ii,” Systems Science & Control Engineering , vol. 7, no. 2, pp. 108–116, 2019
2019
Cited alongside, same era.
A. Panichella, “An adaptive evolutionary algorithm based on non-euclidean geometry for many-objective optimization,” in Proceedings of the genetic and evolutionary computation conference , 2019, pp. 595–603
2019
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.
I. Khan, M. K. Maiti, and K. Basuli, “Multi-objective traveling salesman problem: an abc approach,” Applied Intelligence , vol. 50, pp. 3942–3960, 2020
2020
Cited alongside, same era.
Later among the works it cites.
V. Alto, Modern Generative AI with ChatGPT and OpenAI Models: Leverage the capabilities of OpenAI’s LLM for productivity and innovation with GPT3 and GPT4 . Packt Publishing Ltd, 2023
2023
Later among the works it cites.
2023
Later among the works it cites.
2023
Later among the works it cites.
V. Liventsev, A. Grishina, A. Härmä, and L. Moonen, “Fully autonomous programming with large language models,” in Proceedings of the Genetic and Evolutionary Computation Conference , 2023, pp. 1146–1155
2023
Later among the works it cites.
2023
Later among the works it cites.
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
Later among the works it cites.
J. Lehman, J. Gordon, S. Jain, K. Ndousse, C. Yeh, and K. O. Stanley, “Evolution through large models,” in Handbook of Evolutionary Machine Learning . Springer, 2023, pp. 331–366
2023
Later among the works it cites.
A. P. Khandekar and A. Nargundkar, “Dynamic programming approach to solve real-world application of multi-objective unbounded knapsack problem,” in Intelligent Systems and Applications: Select Proceedings of ICISA 2022 . Springer, 2023, pp. 417–422
2023
Later among the works it cites.
W. Li, “Solving multi-objective traveling salesman problem,” in The Traveling Salesman Problem: Optimization with the Attractor-Based Search System . Springer, 2023, pp. 83–95
2023
Later among the works it cites.
2024
Closest in time.
B. Romera-Paredes, M. Barekatain, A. Novikov, M. Balog, M. P. Kumar, E. Dupont, F. J. Ruiz, J. S. Ellenberg, P. Wang, O. Fawzi et al. , “Mathematical discoveries from program search with large language models,” Nature , vol. 625, no. 7995, pp. 468–475, 2024
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.