Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Mathematics > Optimization and Control

arXiv:2210.01580 (math)
[Submitted on 3 Oct 2022]

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

Authors:Arthur Mahéo, Diego Rossit, Philip Kilby
View PDF
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ía Blanca, Argentina, showing smaller computing times than solving a full MIP model.
Comments: 29 pages, 6 figures
Subjects: Optimization and Control (math.OC)
Cite as: arXiv:2210.01580 [math.OC]
  (or arXiv:2210.01580v1 [math.OC] for this version)
  https://doi.org/10.48550/arXiv.2210.01580
Journal reference: Annals of Operations Research, 322, pp 441-465, (2023)
Related DOI: https://doi.org/10.1007/s10479-022-04918-7

Submission history

From: Diego Rossit [view email]
[v1] Mon, 3 Oct 2022 16:32:01 UTC (2,414 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
license icon view license
Current browse context:
math.OC
< prev   |   next >
new | recent | 2022-10
Change to browse by:
math

References & Citations

export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)