Enhanced Proximal Policy Optimization for dynamic cross-regional agricultural machinery dispatching under demand uncertainty

IF 9.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Swarm and Evolutionary Computation Pub Date : 2026-09-01 Epub Date: 2026-09-12 DOI:10.1016/j.swevo.2026.102528
Wenkang Zhang, Ming Wang, Longzhe Quan, Jian Chu
{"title":"Enhanced Proximal Policy Optimization for dynamic cross-regional agricultural machinery dispatching under demand uncertainty","authors":"Wenkang Zhang,&nbsp;Ming Wang,&nbsp;Longzhe Quan,&nbsp;Jian Chu","doi":"10.1016/j.swevo.2026.102528","DOIUrl":null,"url":null,"abstract":"<div><div>This paper studies dynamic cross-regional agricultural machinery dispatching in which heterogeneous machines must be reassigned after new plot demands arrive during execution. The scientific challenge is to make fast residual rescheduling decisions from the true field state, while respecting typed service compatibility, time windows, cross-cooperative coordination costs, and mandatory return-to-home operations. This paper formulates a route-based mixed-integer linear model that unifies static dispatching and event-driven residual rescheduling through machine-state interpolation and closed-loop makespan minimization. Enhanced Proximal Policy Optimization is then developed (Enhanced PPO), which aligns training with residual deployment states, mitigates delayed reward propagation in terminal-makespan objectives, and combines learned dispatch preferences with feasibility-aware online repair. On a 20-case benchmark covering four disturbance archetypes, Enhanced PPO obtains the best static and dynamic makespan in all 40 case–scale–scenario comparisons. Across competing algorithms, the median static makespan gaps range from 6.10% to 9.51%, while the median dynamic gaps range from 1.19% to 3.49%; statistical tests further show significant and more stable performance across all disturbance scenarios.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"108 ","pages":"Article 102528"},"PeriodicalIF":9.6000,"publicationDate":"2026-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Swarm and Evolutionary Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2210650226002488","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/9/12 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

This paper studies dynamic cross-regional agricultural machinery dispatching in which heterogeneous machines must be reassigned after new plot demands arrive during execution. The scientific challenge is to make fast residual rescheduling decisions from the true field state, while respecting typed service compatibility, time windows, cross-cooperative coordination costs, and mandatory return-to-home operations. This paper formulates a route-based mixed-integer linear model that unifies static dispatching and event-driven residual rescheduling through machine-state interpolation and closed-loop makespan minimization. Enhanced Proximal Policy Optimization is then developed (Enhanced PPO), which aligns training with residual deployment states, mitigates delayed reward propagation in terminal-makespan objectives, and combines learned dispatch preferences with feasibility-aware online repair. On a 20-case benchmark covering four disturbance archetypes, Enhanced PPO obtains the best static and dynamic makespan in all 40 case–scale–scenario comparisons. Across competing algorithms, the median static makespan gaps range from 6.10% to 9.51%, while the median dynamic gaps range from 1.19% to 3.49%; statistical tests further show significant and more stable performance across all disturbance scenarios.
需求不确定性下跨区域农机动态调度的改进近邻策略优化
本文研究了在执行过程中,当新的地块需求到达时,异构农机必须重新分配的跨区域动态调度问题。科学上的挑战是根据真实的现场状态做出快速的剩余重新调度决策,同时尊重类型服务兼容性、时间窗口、跨合作协调成本和强制返回到家操作。本文通过机器状态插值和闭环最大跨度最小化,建立了静态调度和事件驱动剩余重调度相结合的基于路径的混合整数线性模型。然后开发了增强的近端策略优化(Enhanced PPO),它将训练与剩余部署状态相结合,减轻了终端完工时间目标中的延迟奖励传播,并将学习调度偏好与可行性感知在线维修相结合。在覆盖四种干扰原型的20例基准测试中,Enhanced PPO在所有40例尺度场景比较中获得了最佳的静态和动态最大时间跨度。在竞争算法中,静态最大跨度的中位数差距为6.10% ~ 9.51%,动态最大跨度的中位数差距为1.19% ~ 3.49%;统计测试进一步表明,在所有干扰情况下,性能都更加显著和稳定。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Swarm and Evolutionary Computation
Swarm and Evolutionary Computation COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCEC-COMPUTER SCIENCE, THEORY & METHODS
CiteScore
16.00
自引率
12.00%
发文量
169
期刊介绍: Swarm and Evolutionary Computation is a pioneering peer-reviewed journal focused on the latest research and advancements in nature-inspired intelligent computation using swarm and evolutionary algorithms. It covers theoretical, experimental, and practical aspects of these paradigms and their hybrids, promoting interdisciplinary research. The journal prioritizes the publication of high-quality, original articles that push the boundaries of evolutionary computation and swarm intelligence. Additionally, it welcomes survey papers on current topics and novel applications. Topics of interest include but are not limited to: Genetic Algorithms, and Genetic Programming, Evolution Strategies, and Evolutionary Programming, Differential Evolution, Artificial Immune Systems, Particle Swarms, Ant Colony, Bacterial Foraging, Artificial Bees, Fireflies Algorithm, Harmony Search, Artificial Life, Digital Organisms, Estimation of Distribution Algorithms, Stochastic Diffusion Search, Quantum Computing, Nano Computing, Membrane Computing, Human-centric Computing, Hybridization of Algorithms, Memetic Computing, Autonomic Computing, Self-organizing systems, Combinatorial, Discrete, Binary, Constrained, Multi-objective, Multi-modal, Dynamic, and Large-scale Optimization.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书