Multiple Waste Crane Scheduling Based on Cooperative Optimization of Discrete Ivy Algorithm and Simulated Annealing

Efficient scheduling of co-rail waste cranes is critical for ensuring continuous incinerator operation and reducing energy costs in waste-to-energy plants. Existing scheduling methods fail to address the unique characteristics of waste crane operations like task heterogeneity and dynamic spatial interference. To address this, a mixed-integer linear programming model is established to minimize the total crane traveling distance and task delays. A two-stage Discrete Ivy-Simulated Annealing (DIVY-SA) algorithm is proposed: the Ivy algorithm (IVYA) is discretized to generate high-quality task sequences, which are then refined by Simulated Annealing (SA) via a fine-grained local search. A heuristic task assignment scheme and a discrete-event simulation module are designed to evaluate task sequences accurately. Experiments using real-world operational data from a waste incineration plant cover task scales of 25 to 200, representing scheduling horizons of 15 min to 2 h. The algorithm’s runtime (15.04–652.81 s) demonstrates computational feasibility for near-real-time scheduling via a rolling horizon strategy. Results show that DIVY-SA outperforms representative metaheuristic algorithms and reduces the average total traveling distance by 22.19% compared with manual scheduling. This work provides technical support for the intelligent upgrading of waste incineration plants, effectively cutting energy consumption and improving operational efficiency.