Fetching the paper…
Reading the bibliography…
Automated heuristic design (AHD) has gained considerable attention for its potential to automate the development of effective heuristics.
J. E. Beasley, “Or-library: distributing test problems by electronic mail,” Journal of the operational research society
1990
Earlier work this paper cites.
J. H. Holland, “Genetic algorithms,” Scientific american
1992
Earlier work this paper cites.
J. Mockus, “Application of bayesian approach to numerical methods of global and stochastic optimization,” Journal of Global Optimization
1994
Earlier work this paper cites.
J. R. Koza, “Genetic programming as a means for programming computers by natural selection,” Statistics and computing
1994
Earlier work this paper cites.
H.-L. F. P. Ross and D. Corne, “A promising hybrid ga/heuristic approach for open-shop scheduling problems,” in European conference on artificial intelligence
1994
Earlier work this paper cites.
R. Drechsler and B. Becker, “Learning heuristics by genetic algorithms,” in ASP-DAC’95/CHDL’95/VLSI’95 with EDA Technofair
1995
Earlier work this paper cites.
E. Hart, P. Ross, and J. Nelson, “Solving a real-world problem using an evolving heuristically driven schedule builder,” Evolutionary Computation
1998
Earlier work this paper cites.
P. Cowling, G. Kendall, and E. Soubeiga, “A hyperheuristic approach to scheduling a sales summit,” in Practice and Theory of Automated Timetabling
2001
Earlier work this paper cites.
S. S. Seiden, “On the online bin packing problem,” Journal of the ACM
2002
Earlier work this paper cites.
H. Terashima-Marín, E. Flores-Alvarez, and P. Ross, “Hyper-heuristics and classifier systems for solving 2d-regular cutting stock problems,” in annual conference on genetic and evolutionary computation
2005
Earlier work this paper cites.
Cambridge University Press, 2006
T. Tao and V. H. Vu, Additive combinatorics · 2006
Earlier work this paper cites.
E. K. Burke, S. Petrovic, and R. Qu, “Case-based heuristic selection for timetabling problems,” Journal of Scheduling
2006
Earlier work this paper cites.
E. K. Burke, M. R. Hyde, and G. Kendall, “Evolving bin packing heuristics with genetic programming,” in International Conference on Parallel Problem Solving from Nature
2006
Earlier work this paper cites.
J. V. Rodríguez, S. Petrovic, and A. Salhi, “A combined meta-heuristic with hyper-heuristic approach to the scheduling of the hybrid flow shop with sequence dependent setup times and uniform machines,” in Multidisciplinary International Conference on Scheduling: Theory and Applications. MISTA: Paris, France
2007
Earlier work this paper cites.
M. O’Neill, L. Vanneschi, S. Gustafson, and W. Banzhaf, “Open issues in genetic programming,” Genetic Programming and Evolvable Machines
2010
Earlier work this paper cites.
R. Matai, S. P. Singh, and M. L. Mittal, “Traveling salesman problem: an overview of applications, formulations, and solution approaches,” Traveling salesman problem, theory and applications
2010
Earlier work this paper cites.
Boston, MA: Springer US, 2010
E. K. Burke, M. Hyde, G. Kendall, G. Ochoa, E. Özcan, and J. R. Woodward, A Classification of Hyper-heuristic Approaches · 2010
Earlier work this paper cites.
C. Rego, D. Gamboa, F. Glover, and C. Osterman, “Traveling salesman problem heuristics: Leading methods, implementations and latest advances,” European journal of operational research
2011
Earlier work this paper cites.
I. Castiñeiras, M. De Cauwer, and B. O’Sullivan, “Weibull-based benchmarks for bin packing,” in International Conference on Principles and Practice of Constraint Programming
2012
Earlier work this paper cites.
E. K. Burke, M. Gendreau, M. Hyde, G. Kendall, G. Ochoa, E. Özcan, and R. Qu, “Hyper-heuristics: A survey of the state of the art,” Journal of the Operational Research Society
2013
Earlier work this paper cites.
Springer Science & Business Media, 2013
W. B. Langdon and R. Poli, Foundations of genetic programming · 2013
Earlier work this paper cites.
J. Branke, S. Nguyen, C. W. Pickardt, and M. Zhang, “Automated design of production scheduling heuristics: A review,” IEEE Transactions on Evolutionary Computation
2015
Earlier work this paper cites.
X. Wu, P. Consoli, L. Minku, G. Ochoa, and X. Yao, “An evolutionary hyper-heuristic for the software project scheduling problem,” in International Conference on Parallel Problem Solving from Nature
2016
Earlier work this paper cites.
N. Hansen, “The cma evolution strategy: A tutorial,” arXiv preprint arXiv:1604.00772
2016
Cited alongside, same era.
A. Vaswani, N. Shazeer, N. Parmar, J. Uszkoreit, L. Jones, A. N. Gomez, Ł. Kaiser, and I. Polosukhin, “Attention is all you need,” Advances in neural information processing systems
2017
Cited alongside, same era.
2018
Cited alongside, same era.
T. Stützle and M. López-Ibáñez, “Automated design of metaheuristic algorithms,” Handbook of metaheuristics
2019
Cited alongside, same era.
G. Duflo, E. Kieffer, M. R. Brust, G. Danoy, and P. Bouvry, “A gp hyper-heuristic approach for generating tsp heuristics,” in 2019 IEEE International Parallel and Distributed Processing Symposium Workshops
2023
Later among the works it cites.
2023
Later among the works it cites.
2023
Later among the works it cites.
2023
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2019
Cited alongside, same era.
J. Grochow, “New applications of the polynomial method: the cap set conjecture and beyond,” Bulletin of the American Mathematical Society
2019
Cited alongside, same era.
J. Devlin, M.-W. Chang, K. Lee, and K. Toutanova, “BERT: Pre-training of deep bidirectional transformers for language understanding,” in Conference of the North American Chapter of the Association for Computational Linguistics
2019
Cited alongside, same era.
T. Brown, B. Mann, N. Ryder, M. Subbiah, J. D. Kaplan, P. Dhariwal, A. Neelakantan, P. Shyam, G. Sastry, A. Askell, et al
2020
Cited alongside, same era.
2020
Cited alongside, same era.
X. He, K. Zhao, and X. Chu, “Automl: A survey of the state-of-the-art,” Knowledge-based systems
2021
Cited alongside, same era.
2021
Cited alongside, same era.
T. Chen, X. Chen, W. Chen, H. Heaton, J. Liu, Z. Wang, and W. Yin, “Learning to optimize: A primer and a benchmark,” Journal of Machine Learning Research
2022
Cited alongside, same era.
2023
Later among the works it cites.
2023
Later among the works it cites.
2023
Later among the works it cites.
“Code models overview,” 2023
2023
Later among the works it cites.
2023
Later among the works it cites.
2023
Later among the works it cites.
F. Zhang, Y. Mei, S. Nguyen, and M. Zhang, “Survey on genetic programming and machine learning techniques for heuristic design in job shop scheduling,” IEEE Transactions on Evolutionary Computation
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
2024
Closest in time.
F. Liu, X. Tong, M. Yuan, X. Lin, F. Luo, Z. Wang, Z. Lu, and Q. Zhang, “Evolution of heuristics: Towards efficient automatic algorithm design using large language model,” in International Conference on Machine Learning
2024
Closest in time.
2024
Closest in time.
A. Chen, D. Dohan, and D. So, “Evoprompting: Language models for code-level neural architecture search,” Advances in Neural Information Processing Systems
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.
D. Guo, Q. Zhu, D. Yang, Z. Xie, K. Dong, W. Zhang, G. Chen, X. Bi, Y. Wu, Y. Li, et al
2024
Closest in time.
N. Shinn, F. Cassano, A. Gopinath, K. Narasimhan, and S. Yao, “Reflexion: Language agents with verbal reinforcement learning,” Advances in Neural Information Processing Systems
2024
Closest in time.
2024
Closest in time.
Anthropic, “The claude 3 model family: Opus, sonnet, haiku,” 2024
2024
Closest in time.
Y. J. Ma, W. Liang, G. Wang, D.-A. Huang, O. Bastani, D. Jayaraman, Y. Zhu, L. Fan, and A. Anandkumar, “Eureka: Human-level reward design via coding large language models,” in International Conference on Learning Representations
2024
Closest in time.