Our new X account is live! Follow @wizwand_team for updates
WorkDL logo mark

Evolution of Heuristics: Towards Efficient Automatic Algorithm Design Using Large Language Model

About

Heuristics are widely used for dealing with complex search and optimization problems. However, manual design of heuristics can be often very labour extensive and requires rich working experience and knowledge. This paper proposes Evolution of Heuristic (EoH), a novel evolutionary paradigm that leverages both Large Language Models (LLMs) and Evolutionary Computation (EC) methods for Automatic Heuristic Design (AHD). EoH represents the ideas of heuristics in natural language, termed thoughts. They are then translated into executable codes by LLMs. The evolution of both thoughts and codes in an evolutionary search framework makes it very effective and efficient for generating high-performance heuristics. Experiments on three widely studied combinatorial optimization benchmark problems demonstrate that EoH outperforms commonly used handcrafted heuristics and other recent AHD methods including FunSearch. Particularly, the heuristic produced by EoH with a low computational budget (in terms of the number of queries to LLMs) significantly outperforms widely-used human hand-crafted baseline algorithms for the online bin packing problem.

Fei Liu, Xialiang Tong, Mingxuan Yuan, Xi Lin, Fu Luo, Zhenkun Wang, Zhichao Lu, Qingfu Zhang• 2024

Related benchmarks

TaskDatasetResultRank
Traveling Salesman ProblemTSPLIB (test)--
115
Capacitated Vehicle Routing ProblemCVRPLib Set X
Average Optimality Gap26.8
111
Online Bin PackingWeibull distribution
Gap (%)0.25
63
Traveling Salesman ProblemTSP50
Optimality Gap0.00e+0
58
Traveling Salesman ProblemTSP-100--
53
Capacitated Vehicle Routing ProblemCVRP N=100
Objective Value15.732
50
Automated Heuristic DiscoveryAHD Individual (Instance-wise)
Average Tardiness2.90e+3
28
Traveling Salesman ProblemTSP-200
Optimality Gap0.338
28
Capacitated Vehicle Routing ProblemCVRP N=20 10,000 instances (test)
Objective Value5.591
26
Traveling Salesman ProblemTSP N=200
Cost Gap0.37
24
Showing 10 of 119 rows
...

Other info

Follow for update