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

HSEvo: Elevating Automatic Heuristic Design with Diversity-Driven Harmony Search and Genetic Algorithm Using LLMs

About

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. The recent advancements in Large Language Models (LLMs) introduce new possibilities by coupling LLMs with evolutionary computation to automatically generate heuristics, known as LLM-based Evolutionary Program Search (LLM-EPS). While previous LLM-EPS studies obtained great performance on various tasks, there is still a gap in understanding the properties of heuristic search spaces and achieving a balance between exploration and exploitation, which is a critical factor in large heuristic search spaces. In this study, we address this gap by proposing two diversity measurement metrics and perform an analysis on previous LLM-EPS approaches, including FunSearch, EoH, and ReEvo. Results on black-box AHD problems reveal that while EoH demonstrates higher diversity than FunSearch and ReEvo, its objective score is unstable. Conversely, ReEvo's reflection mechanism yields good objective scores but fails to optimize diversity effectively. With this finding in mind, we introduce HSEvo, an adaptive LLM-EPS framework that maintains a balance between diversity and convergence with a harmony search algorithm. Through experimentation, we find that HSEvo achieved high diversity indices and good objective scores while remaining cost-effective. These results underscore the importance of balancing exploration and exploitation and understanding heuristic search spaces in designing frameworks in LLM-EPS.

Pham Vu Tuan Dat, Long Doan, Huynh Thi Thanh Binh• 2024

Related benchmarks

TaskDatasetResultRank
Online Bin PackingWeibull distribution
Gap (%)0.25
63
Traveling Salesman ProblemTSP50
Optimality Gap2.45
58
Traveling Salesman ProblemTSP-100--
53
Capacitated Vehicle Routing ProblemCVRP N=100
Objective Value16.01
50
Traveling Salesman ProblemTSP N=200
Cost Gap0.76
24
Online Bin Packing ProblemBPP online N=5k, W=100
Optimality Gap1.77
23
Online Bin Packing ProblemBPP online N=1k, W=100
Optimality Gap3.96
23
Multidimensional Knapsack ProblemMKP
Objective Value103
21
Capacitated Vehicle Routing ProblemCVRP
Objective Value9.589
21
Offline Bin Packing ProblemOffline BPP
Objective Value205.2
21
Showing 10 of 48 rows

Other info

Follow for update