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

RoCo: Role-Based LLMs Collaboration for Automatic Heuristic Design

About

Automatic Heuristic Design (AHD) has gained traction as a promising solution for solving combinatorial optimization problems (COPs). Large Language Models (LLMs) have emerged and become a promising approach to achieving AHD, but current LLM-based AHD research often only considers a single role. This paper proposes RoCo, a novel Multi-Agent Role-Based System, to enhance the diversity and quality of AHD through multi-role collaboration. RoCo coordinates four specialized LLM-guided agents-explorer, exploiter, critic, and integrator-to collaboratively generate high-quality heuristics. The explorer promotes long-term potential through creative, diversity-driven thinking, while the exploiter focuses on short-term improvements via conservative, efficiency-oriented refinements. The critic evaluates the effectiveness of each evolution step and provides targeted feedback and reflection. The integrator synthesizes proposals from the explorer and exploiter, balancing innovation and exploitation to drive overall progress. These agents interact in a structured multi-round process involving feedback, refinement, and elite mutations guided by both short-term and accumulated long-term reflections. We evaluate RoCo on five different COPs under both white-box and black-box settings. Experimental results demonstrate that RoCo achieves superior performance, consistently generating competitive heuristics that outperform existing methods including ReEvo and HSEvo, both in white-box and black-box scenarios. This role-based collaborative paradigm establishes a new standard for robust and high-performing AHD.

Jiawei Xu, Feng-Feng Wei, Wei-Neng Chen• 2025

Related benchmarks

TaskDatasetResultRank
Traveling Salesman ProblemTSP50
Optimality Gap0.018
58
Capacitated Vehicle Routing ProblemCVRP N=100
Objective Value15.706
50
Traveling Salesman ProblemTSP-200
Optimality Gap0.188
28
Traveling Salesman ProblemTSP N=200--
24
Capacitated Vehicle Routing ProblemCVRP
Objective Value8.966
21
Multidimensional Knapsack ProblemMKP
Objective Value103.6
21
Offline Bin Packing ProblemOffline BPP
Objective Value202.9
21
Orienteering ProblemOP
Objective Value57.365
21
Traveling Salesman ProblemTSP
Objective Value5.766
21
Capacitated Vehicle Routing ProblemCVRP-200
Objective Value27.782
20
Showing 10 of 24 rows

Other info

Follow for update