paper-with-me

홈 › Papers

Guiding Large Language Models with Genetic Programming-Evolved Heuristic Knowledge for Dynamic Multi-Mode Project Scheduling

2026-07-30 · Yuan Tian, Yi Mei, Mengjie Zhang arxiv

In dynamic multi-mode project scheduling, activities have alternative execution modes and uncertain durations, while precedence relations and limited resources constrain their execution. Heuristic priority rules support fast online decisions, but their design requires substantial domain expertise. Genetic programming (GP) hyper-heuristics can automatically evolve such rules. Large language models (LLMs), meanwhile, provide a flexible interface for interpreting scheduling information and explaining decisions. However, zero-shot LLM decisions may lack domain knowledge, consume many tokens, and vary across repeated queries. GP-evolved rules therefore provide a potential source of scheduling knowledge for guiding LLM decisions. Unlike existing LLM--GP hybrids that use LLMs to support heuristic evolution, we transfer knowledge in the reverse direction, using knowledge extracted from high-quality GP rules to guide an online LLM decision maker. We extract knowledge from high-quality GP rules and inject it through Feature Selection, Feature Hint, Rule Reference, and Rule Follow. These mechanisms are evaluated in terms of scheduling performance, token consumption, decision stability, and the feature focus expressed in generated rationales. GP-derived guidance generally improves the unguided LLM, but its representation matters. Simplifying the decision context or supplying explicit decision logic is more effective than highlighting important features. Feature Selection offers the best token efficiency, whereas Rule Follow achieves strong performance at greater token cost. Guidance also improves decision stability and changes the features expressed in generated rationales.

📄 PDF Abstract BibTeX arXiv:2607.27698

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Self-adaptation of Genetic Operators Through Genetic Programming Techniques

2017-12-17 · Andres Felipe Cruz Salinas, Jonatan Gomez Perdomo

Here we propose an evolutionary algorithm that self modifies its operators at the same time that candidate solutions are evolved. This tackles convergence and lack of diversity issues, leading to better solutions. Operat…

Diversity

Genetic-based Constraint Programming for Resource Constrained Job Scheduling

2024-02-01 · Su Nguyen, Dhananjay Thiruvady, Yuan Sun, Mengjie Zhang

Resource constrained job scheduling is a hard combinatorial optimisation problem that originates in the mining industry. Off-the-shelf solvers cannot solve this problem satisfactorily in reasonable timeframes, while othe…

Scheduling

Using LLVM-based JIT Compilation in Genetic Programming

2017-01-20 · Michal Gregor, Juraj Spalek

The paper describes an approach to implementing genetic programming, which uses the LLVM library to just-in-time compile/interpret the evolved abstract syntax trees. The solution is described in some detail, including a …

Evolving Evolutionary Algorithms using Linear Genetic Programming

2021-08-21 · Mihai Oltean

A new model for evolving Evolutionary Algorithms is proposed in this paper. The model is based on the Linear Genetic Programming (LGP) technique. Every LGP chromosome encodes an EA which is used for solving a particular …

BenchmarkingEvolutionary AlgorithmsTraveling Salesman Problem

Solving classification problems using Traceless Genetic Programming

2021-10-07 · Mihai Oltean

Traceless Genetic Programming (TGP) is a new Genetic Programming (GP) that may be used for solving difficult real-world problems. The main difference between TGP and other GP techniques is that TGP does not explicitly st…

Classification