Solving the integrated bin allocation and collection routing problem for municipal solid waste: a benders decomposition approach
From MaRDI portal
Publication:6099458
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.
Recommendations
- Mathematical modelling and heuristic approaches to the location-routing problem of a cost-effective integrated solid waste management
- Environmental \& economical optimization for municipal solid waste collection problems. A modeling and algorithmic approach case study
- Exact and heuristic approaches for the locational planning of an integrated solid waste management system
- Vehicle routing-scheduling for waste collection in Hanoi
- Optimization in msw management system: site selection of the waste-to-energy facilities
Cites work
- A data-driven approach for supply chain network design under uncertainty with consideration of social concerns
- A variable neighborhood search based matheuristic for a waste cooking oil collection network design problem
- scientific article; zbMATH DE number 1452995 (Why is no real title available?)
- Location-routing: issues, models and methods
- Mathematical modelling and heuristic approaches to the location-routing problem of a cost-effective integrated solid waste management
- On Finding the Maxima of a Set of Vectors
- Partitioning procedures for solving mixed-variables programming problems
- Scenario grouping in a progressive hedging-based meta-heuristic for stochastic network design
- Sequential and parallel large neighborhood search algorithms for the periodic location routing problem
- Siting recycling drop-off stations in urban area by genetic algorithm-based fuzzy multiobjective nonlinear integer programming modeling
- Soft computing methods for multiobjective location of garbage accumulation points in smart cities
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- The Nonlinear Resource Allocation Problem
- The vehicle routing problem
- Vehicle routing with split deliveries
Cited in
(5)- Planning solid waste collection with robust optimization: location-allocation, receptacle type, and service frequency
- Municipal Solid Waste Collection: An Effective Data Structure For Solving The Sectorization Problem With Local Search Methods
- Generalized Benders decomposition approach for designing a reverse logistics network for unused drugs within a circular economy framework
- Modeling and solving an integrated periodic vehicle routing and capacitated facility location problem in the context of solid waste collection
- Closed-loop supply chain network design with price-greenness-sensitive demand: a distributionally robust chance-constrained optimization approach
This page was built for publication: Solving the integrated bin allocation and collection routing problem for municipal solid waste: a benders decomposition approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6099458)
