EALG uses LLMs in an evolutionary adversarial loop to generate increasingly hard TSP instances and heuristics that beat existing LLM-designed solvers on those instances and on TSPLIB.
Metaheuristics in combinatorial optimization.Annals of Operations Research, 140(1):189–213, 2005
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
other 1
citation-polarity summary
fields
cs.AI 1years
2025 1verdicts
REJECT 1roles
other 1polarities
unclear 1representative citing papers
citing papers explorer
-
EALG: Evolutionary Adversarial Generation of Language Model-Guided Generators for Combinatorial Optimization
EALG uses LLMs in an evolutionary adversarial loop to generate increasingly hard TSP instances and heuristics that beat existing LLM-designed solvers on those instances and on TSPLIB.