Optimization Problem Solving Can Transition to Evolutionary Agentic Workflows
This position paper argues that optimization problem solving can transition from expert-dependent to evolutionary agentic workflows. Traditional optimization practices rely on human specialists for problem formulation, algorithm selection, and hyperparameter tuning, creating bottlenecks that impede industrial adoption of cutting-edge methods. We contend that an evolutionary agentic workflow, powered by foundation models and evolutionary search, can autonomously navigate the optimization space, comprising problem, formulation, algorithm, and hyperparameter spaces. Through case studies in cloud resource scheduling and ADMM parameter adaptation, we demonstrate how this approach can bridge the gap between academic innovation and industrial implementation. Our position challenges the status quo of human-centric optimization workflows and advocates for a more scalable, adaptive approach to solving real-world optimization problems.
Code (0)
등록된 구현이 없습니다.
Tasks
NavigatePositionSchedulingMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
A Systematic Survey on Large Language Models for Evolutionary Optimization: From Modeling to Solving
Large language models (LLMs) are increasingly integrated with evolutionary computation to support optimization tasks. This survey primarily focuses on evolutionary optimization, i.e., optimization based on evolutionary c…
AgenticGEO: A Self-Evolving Agentic System for Generative Engine Optimization
Generative search engines represent a transition from traditional ranking-based retrieval to Large Language Model (LLM)-based synthesis, transforming optimization goals from ranking prominence towards content inclusion. …
How to Correctly do Semantic Backpropagation on Language-based Agentic Systems
Language-based agentic systems have shown great promise in recent years, transitioning from solving small-scale research problems to being deployed in challenging real-world tasks. However, optimizing these systems often…
GSM8KPolymath: A Self-Optimizing Agent with Dynamic Hierarchical Workflow
Large language models (LLMs) excel at solving complex tasks by executing agentic workflows composed of detailed instructions and structured operations. Yet, building general-purpose agents by manually embedding foundatio…
Where the Really Hard Quadratic Assignment Problems Are: the QAP-SAT instances
The Quadratic Assignment Problem (QAP) is one of the major domains in the field of evolutionary computation, and more widely in combinatorial optimization. This paper studies the phase transition of the QAP, which can be…
Combinatorial Optimization