{"title":"A Heuristic-Guided Genetic Algorithm for heterogeneous agricultural machinery scheduling with time windows","authors":"Ying Bi, Jinfei Zhao, Yanchao Guo, Caitong Yue, Jing Liang, Mengnan Liu, Xiaodong Zhu","doi":"10.1016/j.swevo.2026.102486","DOIUrl":null,"url":null,"abstract":"<div><div>Effective scheduling of heterogeneous agricultural machinery (e.g., harvesters, tractors, and seeders) is critical for timely operations during busy farming seasons. However, most existing work focuses on homogeneous agricultural machinery scheduling, which is relatively simpler than heterogeneous agricultural machinery scheduling. To address this, the paper provides the first formal definition and mathematical model of the Heterogeneous Agricultural Machinery Scheduling Problem with Time Windows (HAMSP-TW). The model uniquely integrates multiple practical constraints previously treated in isolation, including heterogeneous machinery coordination, spatial transfer times between dispersed plots, multi-process job sequences, and plot-specific earliest start time windows. To solve HAMSP-TW, this paper proposes a Heuristic-Guided Genetic Algorithm (HGA) with problem-driven components, i.e., a two-part encoding scheme capturing machinery assignment and operation sequencing, a hybrid rule-based initialization strategy seeding high-quality, diverse solutions, and a heuristic-guided mutation operator leveraging domain knowledge for effective search. Experiments on 18 instances (60–400 plots) show the proposed HGA approach significantly outperforms benchmark algorithms, with advantages particularly pronounced in large-scale scenarios. Ablation studies confirm the substantial individual contribution of each proposed component. Gantt chart analysis reveals that optimized schedules are able to reduce idle time and improve machinery utilization, directly translating to shorter operation completion times.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"107 ","pages":"Article 102486"},"PeriodicalIF":9.6000,"publicationDate":"2026-08-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/S2210650226002063","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/7/28 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0
Abstract
Effective scheduling of heterogeneous agricultural machinery (e.g., harvesters, tractors, and seeders) is critical for timely operations during busy farming seasons. However, most existing work focuses on homogeneous agricultural machinery scheduling, which is relatively simpler than heterogeneous agricultural machinery scheduling. To address this, the paper provides the first formal definition and mathematical model of the Heterogeneous Agricultural Machinery Scheduling Problem with Time Windows (HAMSP-TW). The model uniquely integrates multiple practical constraints previously treated in isolation, including heterogeneous machinery coordination, spatial transfer times between dispersed plots, multi-process job sequences, and plot-specific earliest start time windows. To solve HAMSP-TW, this paper proposes a Heuristic-Guided Genetic Algorithm (HGA) with problem-driven components, i.e., a two-part encoding scheme capturing machinery assignment and operation sequencing, a hybrid rule-based initialization strategy seeding high-quality, diverse solutions, and a heuristic-guided mutation operator leveraging domain knowledge for effective search. Experiments on 18 instances (60–400 plots) show the proposed HGA approach significantly outperforms benchmark algorithms, with advantages particularly pronounced in large-scale scenarios. Ablation studies confirm the substantial individual contribution of each proposed component. Gantt chart analysis reveals that optimized schedules are able to reduce idle time and improve machinery utilization, directly translating to shorter operation completion times.
期刊介绍:
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.