This work transfers knowledge in the reverse direction, using knowledge extracted from high-quality GP rules to guide an online LLM decision maker, and injects it through Feature Selection, Feature Hint, Rule Reference, and Rule Follow.
Abstract
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.
Experimental results demonstrate that the proposed framework consistently outperforms classical ALNS baselines and several competitive metaheuristic methods in terms of solution quality and convergence speed.
T. M. Nguyen· Annual Conference on Genetic...· 0 citations
The dynamic job shop scheduling problem (DJSSP) is critical for optimizing production efficiency in intelligent manufacturing systems under dynamic constraints. Traditional approaches, including heuristic dispatching rules (HDRs) and evolutionary hyper-heuristics, often struggle to generalize across dynamic and unseen...
Jin Huang, Zhengqi Shi, Qi-Hao Liu et al.· IEEE Transactions on Automat...· 0 citations
Results show that simulation traces can guide targeted code-level policy improvement in complex simulation-based scheduling in dynamic production and automated guided vehicle (AGV) scheduling.
A memory-guided adaptive feature genetic programming algorithm that evolves interpretable heuristic dispatching rules while handling stochastic arrivals and iterative grey-time updating efficiently and can reduce the simulation budget needed for rule evolution, support managerial inspection of scheduling logic and redu...
Nanlei Chen, Bentao Su· Grey Systems Theory and Appl...· 0 citations
Results show that Staged-FT produces solutions close to traditional algorithms, RCRP achieves full hard constraint satisfaction in the emergency re-planning and logistics planning cases, and LGEV reduces the convergence generations of NSGA-III while improving Pareto-front quality.
Large language model-based automated heuristic design (LLM-AHD) has shown strong potential in discovering effective heuristics for combinatorial optimization problems. However, existing methods primarily optimize a single heuristic, whereas practical optimization frameworks often rely on multiple interacting components...
Haoze Lv, Ning Lu, Shengcai Liu et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.