Accelerated Genetic Programming Hyper-Heuristics for Simulation-Based Scheduling via Agentic AI

• URL: http://arxiv.org/abs/2608.19487v1
• Date: Wed, 19 Aug 2026 22:48:46 GMT
• Title: Accelerated Genetic Programming Hyper-Heuristics for Simulation-Based Scheduling via Agentic AI
• Abstract summary: This paper presents a systematic approach using Claude agentic AI on real-world project-scheduling workloads in a high-performance computing environment.<n>Testing runtime reduced from 1,298 seconds to under 200 seconds without changing outputs, saving four million core-hours (NZ$320,000) annually.
• Score: 42.44812101223683
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Python is widely used in scientific research because it enables rapid development and provides rich ecosystems for data analysis, artificial intelligence (AI), and machine learning. However, customized research code can become prohibitively slow as experiments scale. This challenge is particularly acute in discrete-event project-scheduling simulations, where sequential state updates, nested loops, conditional evaluations, and object-oriented structures limit the benefits of compiled numerical and GPU-accelerated libraries. Addressing these bottlenecks typically requires iterative profiling, refactoring, testing, and validation, yet researchers may lack the time or specialized software-engineering expertise for low-level optimization. This paper presents a systematic refactoring approach using Claude agentic AI on real-world project-scheduling workloads in a high-performance computing (HPC) environment. Guided by representative benchmarks and correctness checks, the agent identifies bottlenecks, implements targeted optimizations, and evaluates their effects, while the researcher retains final control. Testing runtime reduced from 1,298 seconds to under 200 seconds without changing outputs, saving four million core-hours (NZ\$320,000) annually.

Related papers

• MirrorCode: AI can rebuild entire programs from behavior alone [1.052679131856939]
  MirrorCode is a long-horizon coding benchmark based on reimplementing entire software projects.<n>Existing AI models can already reimplement complex software, with the strongest model scoring 56% across the benchmark.<n>We show that AI agents can already complete long-horizon software engineering tasks, especially when requirements are precisely specified.
  arXiv  Detail & Related papers  (2026-06-29T11:57:32Z)
• Twelve quick tips for designing AI-driven HPC workflows [0.0]
  This guide provides twelve practical tips designed to help researchers design efficient, scalable, and reproducible AI-driven HPC.<n>By addressing critical system-level bottlenecks - such as containerisation for environment portability, strategic deployment of job arrays, explicit feedback loop mechanics, and I/O for small files - this article offers a framework for transitioning from rigid execution pipelines to adaptive, intelligent computational environments.
  arXiv  Detail & Related papers  (2026-06-05T17:46:32Z)
• AI-Assisted Unit Test Writing and Test-Driven Code Refactoring: A Case Study [0.0]
  We present a case study of using coding models for automated unit test generation and subsequent safe iteration.<n>We generated nearly 16,000 lines of reliable unit tests in hours rather than weeks, achieved up to 78% branch coverage in critical modules, and significantly reduced regression risk during large-scale iterations.
  arXiv  Detail & Related papers  (2026-04-03T15:54:43Z)
• EmboCoach-Bench: Benchmarking AI Agents on Developing Embodied Robots [68.29056647487519]
  Embodied AI is fueled by high-fidelity simulation and large-scale data collection.<n>However, this scaling capability remains bottlenecked by a reliance on labor-intensive manual oversight.<n>We introduce textscEmboCoach-Bench, a benchmark evaluating the capacity of LLM agents to autonomously engineer embodied policies.
  arXiv  Detail & Related papers  (2026-01-29T11:33:49Z)
• Toward Ultra-Long-Horizon Agentic Science: Cognitive Accumulation for Machine Learning Engineering [59.18634614089481]
  We present ML-Master 2.0, an autonomous agent that masters ultra-long-horizon machine learning engineering (MLE)<n>By reframing context management as a process of cognitive accumulation, our approach introduces Hierarchical Cognitive Caching (HCC)<n>HCC allows agents to decouple immediate execution from long-term experimental strategy.<n>In evaluations on OpenAI's MLE-Bench under 24-hour budgets, ML-Master 2.0 achieves a state-of-the-art medal rate of 56.44%.
  arXiv  Detail & Related papers  (2026-01-15T13:52:04Z)
• What Artificial Intelligence can do for High-Performance Computing systems? [0.0]
  This review assesses how artificial (AI) including machine learning (ML) and optimization, improves the efficiency of operational HPC systems.<n>Approximately 1,800 publications from 2019 to 2025 were manually screened using predefined inclusion/exclusion criteria.<n>74 "AI for HPC" papers were retained and grouped into six application areas: performance estimation, performance optimization, scheduling, surrogate modeling, fault detection, and language-model-based automation.
  arXiv  Detail & Related papers  (2026-01-03T19:25:23Z)
• SelfAI: Building a Self-Training AI System with LLM Agents [79.10991818561907]
  SelfAI is a general multi-agent platform that combines a User Agent for translating high-level research objectives into standardized experimental configurations.<n>An Experiment Manager orchestrates parallel, fault-tolerant training across heterogeneous hardware while maintaining a structured knowledge base for continuous feedback.<n>Across regression, computer vision, scientific computing, medical imaging, and drug discovery benchmarks, SelfAI consistently achieves strong performance and reduces redundant trials.
  arXiv  Detail & Related papers  (2025-11-29T09:18:39Z)
• The Fast for the Curious: How to accelerate fault-tolerant quantum applications [101.46859364118622]
  We evaluate strategies for reducing the run time of fault-tolerant quantum computations.<n>We discuss how the co-design of hardware, fault tolerance, and algorithmic subroutines can reduce run times.
  arXiv  Detail & Related papers  (2025-10-30T02:27:55Z)
• Synthetic Code Surgery: Repairing Bugs and Vulnerabilities with LLMs and Synthetic Data [0.0]
  This paper presents a novel methodology for enhancing Automated Program Repair (APR) through synthetic data generation utilizing Large Language Models (LLMs)<n>The proposed approach addresses this limitation through a two-phase process: a synthetic sample generation followed by a rigorous quality assessment.<n> Experimental evaluation on the VulRepair test set dataset showed statistically significant improvements in Perfect Prediction rates.
  arXiv  Detail & Related papers  (2025-05-12T09:14:20Z)
• Learning Performance-Improving Code Edits [107.21538852090208]
  We introduce a framework for adapting large language models (LLMs) to high-level program optimization. First, we curate a dataset of performance-improving edits made by human programmers of over 77,000 competitive C++ programming submission pairs. For prompting, we propose retrieval-based few-shot prompting and chain-of-thought, and for finetuning, these include performance-conditioned generation and synthetic data augmentation based on self-play.
  arXiv  Detail & Related papers  (2023-02-15T18:59:21Z)

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.