Coordinating a shared fleet across multiple owners under tight time windows is a challenging multi-objective problem balancing cost, timeliness, and equity. We study it for multi-cooperative agricultural machinery dispatch, formulating the Multi-Cooperative Agricultural Machinery Scheduling Problem under Continuous Workload Sharing (MAMSP-CWS) as a three-objective model that minimizes inter-area transfer cost, time-window violation, and cross-cooperative workload imbalance. To approximate the Pareto front, we develop a Multi-Objective Hybrid Particle Swarm Optimization with Tabu Search and Sparsity Repair (MO-HPSO-TS-SR), which couples particle-swarm search, tabu-search refinement, and a sparsity-repair operator within an external crowding-distance archive. The method is evaluated on three scales (a real instance from Liyang, China, and two synthetic ones) against NSGA-II-CWS and HTSMOGA-CWS over 20 independent runs each. MO-HPSO-TS-SR attains the best mean value on every metric-by-scale combination, with a decisive convergence advantage (hypervolume and IGD; Holm-adjusted p < 0.001, Cliff’s δ ≈ 1). A mechanism decomposition identifies Sparsity Repair as the dominant contributor to hypervolume, with Tabu Search as a complementary refiner. The advantage over NSGA-II-CWS widens with problem scale, from 19.4% on the Small instance to 74.2% on the Large instance, reflecting the disproportionate degradation of the genetic baseline rather than a growing advantage of the proposed method. Beyond agriculture, the framework extends to other continuous-encoding scheduling problems, providing a transferable decision-support tool.
Wang et al. (Fri,) studied this question.