Skip to main content
SpringerLink
Log in

An ILS Heuristic for the Waste Collection Vehicle Routing Problem with Time Windows

  • Conference paper
  • First Online:
Intelligent Systems Design and Applications (ISDA 2016)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 557))

Abstract

This study addresses the Waste Collection Vehicle Routing Problem with Time Windows (WCVRPTW) with multiple disposal sites and drivers’ lunch breaks. The problem consists of routing garbage trucks to collect customers waste within given time window in order to minimize the total travel cost. The waste is driven to disposal sites, multiple trips to disposal sites are allowed per day for the vehicles, and the vehicles must be empty when returning to the depot. To find near-optimal routes for the waste collecting vehicles, we propose a heuristic algorithm based on the meta-heuristics Iterated Local Search (ILS) and Variable Neighborhood Descent (VND). The performance of the proposed algorithm is evaluated by comparing its results to CPLEX commercial solver, and a variable neighbourhood tabu search (VNTS) algorithm addressed in the literature. The results obtained, on benchmark problems from the literature, are highly competitive and a number of new improved solutions are reported.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.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.

    https://sites.google.com/site/logisticslaboratory/research/research-areas/waste_collection_vrptw_benchmark.

References

  1. Benjamin, A.M., Beasley, J.E.: Metaheuristics for the waste collection vehicle routing problem with time windows, driver rest period and multiple disposal facilities. Comput. Oper. Res. 37(12), 2270–2280 (2010)

    Article  Google Scholar 

  2. Benjamin, A.M., Beasley, J.E.: Metaheuristics with disposal facility positioning for the waste collection VRP with time windows. Optim. Lett. 7(7), 1433–1449 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  3. Cordeau, J.-F., Gendreau, M., Laporte, G., Potvin, J.-Y., Semet, F.: A guide to vehicle routing heuristics. J. Oper. Res. Soc. 53(5), 512–522 (2002)

    Article  MATH  Google Scholar 

  4. Buhrkal, K., Larsen, A., Ropke, S.: The waste collection vehicle routing problem with time windows in a city logistics context. Procedia-Soc. Behav. Sci. 39, 241–254 (2012)

    Article  Google Scholar 

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

    Google Scholar 

  6. Mladenović, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097–1100 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  7. Kim, B.I., Kim, S., Sahoo, S.: Waste collection vehicle routing problem with time windows. Comput. Oper. Res. 33(12), 3624–3642 (2006)

    Article  MATH  Google Scholar 

  8. Lourenço, H.R., Martin, O.C., Stützle, T.: Iterated local search. In: Glover, F., Kochenberger, G.A. (eds.) Handbook of Metaheuristics, vol. 57, pp. 320–353. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  9. Ombuki-Berman, B.M., Runka, A., Hanshar, F.T.: Waste collection vehicle routing problem with time windows using multiobjective genetic algorithms. Brock University 2007; Technical report CS-07-04, pp. 91–97 (2007)

    Google Scholar 

  10. Solomon, M.M.: Algorithms for the vehicle routing and scheduling problem with time window constraints. Oper. Res. 35, 254–265 (1987)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

The authors thanks the financial support of CNPq, CAPES and FAPEMIG, Brazilian research agencies.

Author information

Authors and Affiliations

  1. Campus Universitário, Universidade Federal de Viçosa, Viçosa, Minas Gerais, 36570-900, Brazil

    Alba A. Campos & José Elias C. Arroyo

Authors
  1. Alba A. Campos
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. José Elias C. Arroyo
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alba A. Campos .

Editor information

Editors and Affiliations

  1. Departamento de Engenharia Informática, Instituto Superior de Engenharia do Port, Porto, Portugal

    Ana Maria Madureira

  2. Scientific Network for Innovation and Research Excellence, Machine Intelligence Research Labs, Auburn, Washington, USA

    Ajith Abraham

  3. Polytechnic Institute of Porto, Felgueiras, Portugal

    Dorabela Gamboa

  4. Campus of Gualtar, University of Minho, Braga, Portugal

    Paulo Novais

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Campos, A.A., Arroyo, J.E.C. (2017). An ILS Heuristic for the Waste Collection Vehicle Routing Problem with Time Windows. In: Madureira, A., Abraham, A., Gamboa, D., Novais, P. (eds) Intelligent Systems Design and Applications. ISDA 2016. Advances in Intelligent Systems and Computing, vol 557. Springer, Cham. https://doi.org/10.1007/978-3-319-53480-0_88

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-53480-0_88

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-53479-4

  • Online ISBN: 978-3-319-53480-0

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation