CoupleEvo: Evolving Heuristics for Coupled Optimization Problems Using Large Language Models

• URL: http://arxiv.org/abs/2605.06341v1
• Date: Thu, 07 May 2026 14:29:05 GMT
• Title: CoupleEvo: Evolving Heuristics for Coupled Optimization Problems Using Large Language Models
• Abstract summary: We propose three evolutionary coordination strategies to evolves for coupled optimization problems.<n>Experiments show that decomposition-based strategies provide more stable convergence and higher solution quality.<n>The integrated evolution strategy suffers from increased search complexity and variability.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Many real-world optimization problems consist of multiple tightly coupled subproblems whose solutions must be coordinated to achieve high overall performance. However, existing large language model driven automated heuristic design approaches are limited to single-problem settings. In this paper, we propose CoupleEvo. CoupleEvo proposes three evolutionary coordination strategies to evolve heuristics for coupled optimization problems: the sequential strategy evolves heuristics for one subproblem after the other; the iterative strategy alternates the evolution of heuristics for different subproblems over successive generations; and the integrated strategy evolves heuristics for all problems simultaneously. The approach is evaluated on two representative coupled optimization problems. Experimental results show that decomposition-based strategies (sequential and iterative) provide more stable convergence and higher solution quality, while the integrated evolution strategy suffers from increased search complexity and variability. These findings highlight the importance of coordinating evolutionary search across interdependent subproblems and demonstrate the potential of LLM-driven heuristic design for complex coupled optimization problems. The code is available: https://github.com/tb-git-kit-research/CoupleEvo.

Related papers

• A Learning-Based Cooperative Coevolution Framework for Heterogeneous Large-Scale Global Optimization [21.998622908002464]
  We propose the Learning-Based Heterogeneous Cooperative Coevolution Framework (LH-CC)<n>LH-CC adaptively selects the most suitable subproblems for each H-LSGO problem instances.<n>Our findings reveal that dynamic selection is a pivotal strategy for solving complex H-LSGO problems.
  arXiv  Detail & Related papers  (2026-03-30T00:18:05Z)
• EvoX: Meta-Evolution for Automated Discovery [115.89434419482797]
  EvoX is an adaptive evolution method that optimize its own evolution process.<n>It continuously updates how prior solutions are selected and varied based on progress.<n>It outperforms existing AI-driven evolutionary methods including AlphaEvolve, OpenEvolve, GEPA, and ShinkaEvolve on the majority of tasks.
  arXiv  Detail & Related papers  (2026-02-26T18:54:41Z)
• AdaEvolve: Adaptive LLM Driven Zeroth-Order Optimization [61.535567824938205]
  We introduce AdaEvolve, a framework that reformulates LLM-driven evolution as a hierarchical adaptive optimization problem.<n>AdaEvolve consistently outperforms the open-ended baselines across 185 different open-ended optimization problems.
  arXiv  Detail & Related papers  (2026-02-23T18:45:31Z)
• A Framework for Combining Optimization-Based and Analytic Inverse Kinematics [53.66628333687382]
  Twolytic and optimization methods for inverse kinematics (IK) problems have been deeply studied in the history of robotics.<n>We present a new formulation for IK avoidance that uses an IK solution that is fundamentally easier for ours to solve.
  arXiv  Detail & Related papers  (2026-02-04T22:23:32Z)
• Experience-Guided Reflective Co-Evolution of Prompts and Heuristics for Automatic Algorithm Design [124.54166764570972]
  Combinatorial optimization problems are traditionally tackled with handcrafted algorithms.<n>Recent progress has highlighted the potential of automatics design powered by large language models.<n>We propose the Experience-Evolution Reflective Co-Guided of Prompt and Heuristics (EvoPH) for automatic algorithm design.
  arXiv  Detail & Related papers  (2025-09-29T09:24:09Z)
• Decomposition of Difficulties in Complex Optimization Problems Using a Bilevel Approach [0.30723404270319693]
  Practical optimization problems may contain different kinds of difficulties that are often not tractable if one relies on a particular optimization method. We propose a decomposition strategy that allows us to apply two approaches at the same time on a complex optimization problem.
  arXiv  Detail & Related papers  (2024-07-03T18:59:17Z)
• Large Language Model-Aided Evolutionary Search for Constrained Multiobjective Optimization [15.476478159958416]
  We employ a large language model (LLM) to enhance evolutionary search for solving constrained multi-objective optimization problems. Our aim is to speed up the convergence of the evolutionary population.
  arXiv  Detail & Related papers  (2024-05-09T13:44:04Z)
• Backpropagation of Unrolled Solvers with Folded Optimization [55.04219793298687]
  The integration of constrained optimization models as components in deep networks has led to promising advances on many specialized learning tasks. One typical strategy is algorithm unrolling, which relies on automatic differentiation through the operations of an iterative solver. This paper provides theoretical insights into the backward pass of unrolled optimization, leading to a system for generating efficiently solvable analytical models of backpropagation.
  arXiv  Detail & Related papers  (2023-01-28T01:50:42Z)
• An Effective and Efficient Evolutionary Algorithm for Many-Objective Optimization [2.5594423685710814]
  We develop an effective evolutionary algorithm (E3A) that can handle various many-objective problems. In E3A, inspired by SDE, a novel population maintenance method is proposed. We conduct extensive experiments and show that E3A performs better than 11 state-of-the-art many-objective evolutionary algorithms.
  arXiv  Detail & Related papers  (2022-05-31T15:35:46Z)
• Optimistic variants of single-objective bilevel optimization for evolutionary algorithms [6.788217433800101]
  A partial partial evolutionary approach has been proposed to solve the benchmark problems and have outstanding results. A new variant has also been proposed to the commonly used convergence approaches, i.e. optimistic and pessimistic. The experimental results demonstrate the algorithm converges differently to optimum solutions with the optimistic variants.
  arXiv  Detail & Related papers  (2020-08-22T23:12:07Z)
• EOS: a Parallel, Self-Adaptive, Multi-Population Evolutionary Algorithm for Constrained Global Optimization [68.8204255655161]
  EOS is a global optimization algorithm for constrained and unconstrained problems of real-valued variables. It implements a number of improvements to the well-known Differential Evolution (DE) algorithm. Results prove that EOSis capable of achieving increased performance compared to state-of-the-art single-population self-adaptive DE algorithms.
  arXiv  Detail & Related papers  (2020-07-09T10:19:22Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.