Research on Interference Management of Shared Collection and Transportation Vehicle Scheduling of Bulky Garbage with Order Changes

This study presents a shared vehicle scheduling model designed to tackle scheduling conflicts arising from changes in orders for bulky waste collection and transportation. The model accounts for five types of interference events: alterations in the original order location, modifications to the time window, changes in waste size, the inclusion of new orders, and order cancellations. The goal of the model is to reduce variations in the frequency of collection and transportation, minimize costs, and meet the three requirements of three-dimensional loading for shared trucks, as well as satisfy user time windows. To solve this complex combinatorial optimization problem, the sparrow search algorithm is employed. Numerical studies indicate that the proposed method outperforms the genetic simulated annealing algorithm in objective function value and computational efficiency under the five interference scenarios. These results also confirm the model’s efficacy.