Fetching the paper…
Reading the bibliography…
Automatic Heuristic Design (AHD) is an active research area due to its utility in solving complex search and NP-hard combinatorial optimization problems in the real world.
Lower bounds and reduction procedures for the bin packing problem
Martello, S.; and Toth, P. 1990 · 1990
Earlier work this paper cites.
Indices of diversity and evenness
Heip, C. H.; Herman, P. M.; Soetaert, K.; et al. 1998 · 1998
Earlier work this paper cites.
Guided local search and its application to the traveling salesman problem
Voudouris, C.; and Tsang, E. 1999 · 1999
Earlier work this paper cites.
On the online bin packing problem
Seiden, S. S. 2002 · 2002
Earlier work this paper cites.
Entropy and diversity
Jost, L. 2006 · 2006
Earlier work this paper cites.
Beachcomber Biology: The Shannon-Weiner Species Diversity Index
Nolan, K.; and Callahan, J. 2006 · 2006
Earlier work this paper cites.
A Hybrid Genetic Algorithm Based on Harmony Search and its Improving , 101–109
Shi, W. W.; Han, W.; and Si, W. C. 2012 · 2012
Earlier work this paper cites.
Diversity Based on Entropy: A Novel Evaluation Criterion in Multi-objective Optimization Algorithm
Wang, L.; and Chen, Y. 2012 · 2012
Earlier work this paper cites.
Traveling salesman problem
Hoffman, K. L.; Padberg, M.; Rinaldi, G.; et al. 2013 · 2013
Earlier work this paper cites.
Diversity study of multi-objective genetic algorithm based on Shannon entropy
Solteiro Pires, E. J.; Tenreiro Machado, J. A.; and de Moura Oliveira, P. B. 2014 · 2014
Earlier work this paper cites.
Automatic design of hyper-heuristic based on reinforcement learning
Choong, S. S.; Wong, L.-P.; and Lim, C. P. 2018 · 2018
Earlier work this paper cites.
Attention, learn to solve routing problems!
Kool, W.; Van Hoof, H.; and Welling, M. 2018 · 2018
Cited alongside, same era.
Hyper-heuristics: theory and applications
Pillay, N.; and Qu, R. 2018 · 2018
Cited alongside, same era.
Knowledge-guided local search for the vehicle routing problem
Arnold, F.; and Sörensen, K. 2019 · 2019
Cited alongside, same era.
Dynamic Shannon Performance in a Multiobjective Particle Swarm Optimization
Pires, E.; Tenreiro Machado, J.; and Moura Oliveira, P. 2019 · 2019
Cited alongside, same era.
The general combinatorial optimization problem: Towards automated algorithm design
Qu, R.; Kendall, G.; and Pillay, N. 2020 · 2020
Cited alongside, same era.
Role play with large language models
Shanahan, M.; McDonell, K.; and Reynolds, L. 2023 · 2023
Later among the works it cites.
Codet5+: Open code large language models for code understanding and generation
Wang, Y.; Le, H.; Gotmare, A. D.; Bui, N. D.; Li, J.; and Hoi, S. C. 2023 · 2023
Later among the works it cites.
EvoPrompting: language models for code-level neural architecture search
Chen, A.; Dohan, D.; and So, D. 2024 · 2024
Closest in time.
Bq-nco: Bisimulation quotienting for efficient neural combinatorial optimization
Drakulic, D.; Michel, S.; Mai, F.; Sors, A.; and Andreoli, J.-M. 2024 · 2024
Closest in time.
Evolving code with a large language model
Hemberg, E.; Moskal, S.; and O’Reilly, U.-M. 2024 · 2024
Closest in time.
Large language models as evolutionary optimizers
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Austin, J.; Odena, A.; Nye, M.; Bosma, M.; Michalewski, H.; Dohan, D.; Jiang, E.; Cai, C.; Terry, M.; Le, Q.; et al. 2021 · 2021
Cited alongside, same era.
Analyzing the performance of TSP solver methods
Tüű-Szabó, B.; Földesi, P.; and Kóczy, L. T. 2022 · 2022
Cited alongside, same era.
Connecting large language models with evolutionary algorithms yields powerful prompt optimizers
Guo, Q.; Wang, R.; Guo, J.; Li, B.; Song, K.; Tan, X.; Liu, G.; Bian, J.; and Yang, Y. 2023 · 2023
Cited alongside, same era.
How good is neural combinatorial optimization? A systematic evaluation on the traveling salesman problem
Liu, S.; Zhang, Y.; Tang, K.; and Yao, X. 2023 · 2023
Cited alongside, same era.
Eureka: Human-level reward design via coding large language models
Ma, Y. J.; Liang, W.; Wang, G.; Huang, D.-A.; Bastani, O.; Jayaraman, D.; Zhu, Y.; Fan, L.; and Anandkumar, A. 2023 · 2023
Cited alongside, same era.
Llms for science: Usage for code generation and data analysis
Nejjar, M.; Zacharias, L.; Stiehle, F.; and Weber, I. 2023 · 2023
Cited alongside, same era.
Evolution of Heuristics: Towards Efficient Automatic Algorithm Design Using Large Language Model
Liu, F.; Xialiang, T.; Yuan, M.; Lin, X.; Luo, F.; Wang, Z.; Lu, Z.; and Zhang, Q. 2024a
Cited in the paper.
Liu, S.; Chen, C.; Qu, X.; Tang, K.; and Ong, Y.-S. 2024b · 2024
Closest in time.
Dissociating language and thought in large language models
Mahowald, K.; Ivanova, A. A.; Blank, I. A.; Kanwisher, N.; Tenenbaum, J. B.; and Fedorenko, E. 2024 · 2024
Closest in time.
Language model crossover: Variation through few-shot prompting
Meyerson, E.; Nelson, M. J.; Bradley, H.; Gaier, A.; Moradi, A.; Hoover, A. K.; and Lehman, J. 2024 · 2024
Closest in time.
Mathematical discoveries from program search with large language models
Romera-Paredes, B.; Barekatain, M.; Novikov, A.; Balog, M.; Kumar, M. P.; Dupont, E.; Ruiz, F. J.; Ellenberg, J. S.; Wang, P.; Fawzi, O.; et al. 2024 · 2024
Closest in time.
Reflexion: Language agents with verbal reinforcement learning
Shinn, N.; Cassano, F.; Gopinath, A.; Narasimhan, K.; and Yao, S. 2024 · 2024
Closest in time.
TextGrad: Automatic” Differentiation” via Text
Yuksekgonul, M.; Bianchi, F.; Boen, J.; Liu, S.; Huang, Z.; Guestrin, C.; and Zou, J. 2024 · 2024
Closest in time.