Stochastic Programming Model for Household Waste Transportation based on Benders Decomposition Algorithm

To adapt to the current new situation of waste classification and deposition in Shanghai, the article built a stochastic programming model for the collection and transportation network of household waste, with the lowest total cost as the goal. It was a multi-stage transportation model aiming at determining the best operation time of all stations and the optimal flowing scheme of waste. The article considered the uncertainty of the quantity of household waste produced by residents, and used Benders decomposition algorithm to solve the model. Its acceleration effect was verified by simulation examples. Meanwhile the critical number of discrete scenes in the model was also determined which made the optimal value of objective function tend to be stable. The model proposed in this paper can provide decision-making basis for the dispatching and route selection of waste collection and transportation vehicles in Shanghai.