Solving the Integrated Bin Allocation and Collection Routing Problem for Municipal Solid Waste: a Benders Decomposition Approach

TL;DR

This paper introduces a Benders decomposition method to optimize waste bin placement and collection routes, effectively solving medium-sized real-world instances more efficiently than traditional models.

Contribution

It presents a novel Benders decomposition approach for integrated waste bin allocation and collection routing problems, improving computational efficiency for real-world applications.

Findings

Successfully solved medium-sized instances in Bahia Blanca, Argentina

Achieved smaller computing times compared to full MIP models

Demonstrated effectiveness of the approach in complex waste management scenarios

Abstract

The municipal solid waste system is a complex reverse logistic chain which comprises several optimisation problems. Although these problems are interdependent, i.e., the solution to one of the problems restricts the solution to the other, they are usually solved sequentially in the related literature because each is usually a computationally complex problem. We address two of the tactical planning problems in this chain by means of a Benders decomposition approach: determining the location and/or capacity of garbage accumulation points, and the design and schedule of collection routes for vehicles. Our approach manages to solve medium-sized real-world instances in the city of Bah\'{i}a Blanca, Argentina, showing smaller computing times than solving a full MIP model.