Skip to main content

A Benders Decomposition Approach for an Integrated Bin Allocation and Vehicle Routing Problem in Municipal Waste Management

  • Conference paper
  • First Online:
Production Research (ICPR-Americas 2020)

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 of collection routes for vehicles. We also propose a set of valid inequalities to speed up the resolution process. Our approach manages to solve medium-sized real-world instances in the city of Bahía Blanca, Argentina, showing smaller computing times in comparison to solving a full MIP model.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Mainly capacity, but could also be cost.

  2. 2.

    We use the complete problem (M1) augmented with valid inequalities Eqs. (2) to (4). The Benders cuts we generate are “optimality cuts” given by Eq. (8a).

  3. 3.

    http://project-osrm.org/.

  4. 4.

    https://gitlab.com/Soha/brandec.

  5. 5.

    http://doi.org/10.13140/RG.2.2.19210.49604.

References

  1. Benders, J.F.: Partitioning procedures for solving mixed-variables programming problems. Numerische mathematik 4(1), 238–252 (1962)

    Article  MathSciNet  Google Scholar 

  2. Bonomo, F., Durán, G., Larumbe, F., Marenco, J.: A method for optimizing waste collection using mathematical programming: a Buenos Aires case study. Waste Manag. Res. 30(3), 311–324 (2012)

    Article  Google Scholar 

  3. Bretthauer, K.M., Shetty, B.: The nonlinear resource allocation problem. Oper. Res. 43(4), 670–683 (1995)

    Article  MathSciNet  Google Scholar 

  4. Campbell, A., Clarke, L., Kleywegt, A., Savelsbergh, M.: The inventory routing problem. In: Crainic, T.G., Laporte, G. (eds.) Fleet Management and Logistics. CRT, pp. 95–113. Springer, Boston, MA (1998). https://doi.org/10.1007/978-1-4615-5755-5_4

    Chapter  Google Scholar 

  5. Cavallin, A., Rossit, D.G., Herrán Symonds, V., Rossit, D.A., Frutos, M.: Application of a methodology to design a municipal waste pre-collection network in real scenarios. Waste Manag. Res. 38(1), 117–129 (2020)

    Article  Google Scholar 

  6. Dror, M., Laporte, G., Trudeau, P.: Vehicle routing with split deliveries. Discrete Appl. Math. 50(3), 239–254 (1994)

    Article  MathSciNet  Google Scholar 

  7. Ghiani, G., Laganà, D., Manni, E., Musmanno, R., Vigo, D.: Operations research in solid waste management: a survey of strategic and tactical issues. Comput. Oper. Res. 44, 22–32 (2014)

    Article  Google Scholar 

  8. Ghiani, G., Manni, A., Manni, E., Toraldo, M.: The impact of an efficient collection sites location on the zoning phase in municipal solid waste management. Waste Manag. 34(11), 1949–1956 (2014)

    Article  Google Scholar 

  9. Ghiani, G., Mourão, C., Pinto, L., Vigo, D.: Chapter 15: routing in waste collection applications. In: Arc Routing: Problems, Methods, and Applications, pp. 351–370. SIAM (2015)

    Google Scholar 

  10. Han, H., Ponce Cueto, E.: Waste collection vehicle routing problem: literature review. PROMET-Traffic Transp. 27(4), 345–358 (2015)

    Article  Google Scholar 

  11. Hemmelmayr, V.C.: Sequential and parallel large neighborhood search algorithms for the periodic location routing problem. Eur. J. Oper. Res. 243(1), 52–60 (2015)

    Article  MathSciNet  Google Scholar 

  12. Hemmelmayr, V.C., Doerner, K.F., Hartl, R.F., Vigo, D.: Models and algorithms for the integrated planning of bin allocation and vehicle routing in solid waste management. Transp. Sci. 48(1), 103–120 (2013)

    Article  Google Scholar 

  13. Hemmelmayr, V.C., Smilowitz, K., de la Torre, L.: A periodic location routing problem for collaborative recycling. IISE Trans. 49(4), 414–428 (2017)

    Article  Google Scholar 

  14. Jammeli, H., Argoubi, M., Masri, H.: A bi-objective stochastic programming model for the household waste collection and transportation problem: case of the city of Sousse. Oper. Res., 1–27 (2019)

    Google Scholar 

  15. Kŭdela, J., et al.: Multi-objective strategic waste transfer station planning. J. Cleaner Prod. 230, 1294–1304 (2019)

    Article  Google Scholar 

  16. Lu, J.W., Chang, N.B., Liao, L., Liao, M.Y.: Smart and green urban solid waste collection systems: advances, challenges, and perspectives. IEEE Syst. J. 11(4), 2804–2817 (2015)

    Article  Google Scholar 

  17. Mahéo, A.: Benders and its sub-problems. Ph.D. thesis, Australian National University, Canberra, Australia (2020)

    Google Scholar 

  18. Mahéo, A., Belieres, S., Adulyasak, Y., Cordeau, J.F.: Unified branch-and-Benders-cut for two-stage stochastic mixed-integer programs. Les Cahiers du GERAD G-2020-54 (2020)

    Google Scholar 

  19. Nagy, G., Salhi, S.: Location-routing: issues, models and methods. Eur. J. Oper. Res. 177(2), 649–672 (2007)

    Article  MathSciNet  Google Scholar 

  20. Purkayastha, D., Majumder, M., Chakrabarti, S.: Collection and recycle bin location-allocation problem in solid waste management: a review. Pollution 1(2), 175–191 (2015)

    Google Scholar 

  21. Rossit, D.G., Toutouh, J., Nesmachnow, S.: Exact and heuristic approaches for multi-objective garbage accumulation points location in real scenarios. Waste Manag. 105, 467–481 (2020)

    Article  Google Scholar 

  22. Saif, Y., Rizwan, M., Almansoori, A., Elkamel, A.: Municipality solid waste supply chain optimization to power production under uncertainty. Comput. Chem. Eng. 121, 338–353 (2019)

    Article  Google Scholar 

  23. Toth, P., Vigo, D.: The vehicle routing problem. SIAM (2002)

    Google Scholar 

  24. Vázquez Brust, A.: Ruteo de alta perfomance con OSRM. Rpubs by RStudio (2018). https://rpubs.com/HAVB/osrm

Download references

Acknowledgements

The second author was supported by the Australia–Americas PhD Research Internship Program co-financed by the Australian Academy of Science, the Ministry of Foreign Affairs and Worship of Argentina and the Universidad Nacional del Sur.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Diego Gabriel Rossit .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Mahéo, A., Rossit, D.G., Kilby, P. (2021). A Benders Decomposition Approach for an Integrated Bin Allocation and Vehicle Routing Problem in Municipal Waste Management. In: Rossit, D.A., Tohmé, F., Mejía Delgadillo, G. (eds) Production Research. ICPR-Americas 2020. Communications in Computer and Information Science, vol 1408. Springer, Cham. https://doi.org/10.1007/978-3-030-76310-7_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-76310-7_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-76309-1

  • Online ISBN: 978-3-030-76310-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics