A biased-randomized heuristic for the waste collection problem in smart cities

Aljoscha Gruler, Angel A. Juan, Carlos Contreras-Bolton, Gustavo Gatica

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Citations (Scopus)

Abstract

This paper describes an efficient heuristic to solve the Waste Collection Problem (WCP), which is formulated as a special instance of the well-known Vehicle Routing Problem (VRP). Our approach makes use of a biased-randomized version of a savings-based heuristic. The proposed procedure is tested against a set of benchmark instances, obtaining competitive results.

Original languageEnglish
Title of host publicationApplied Mathematics and Computational Intelligence, 2015
PublisherSpringer Verlag
Pages255-263
Number of pages9
ISBN (Print)9783319757919
DOIs
Publication statusPublished - 1 Jan 2018
Event24th International Conference of the Forum for Interdisciplinary Mathematics, FIM 2015 - Barcelona, Spain
Duration: 18 Nov 201520 Nov 2015

Publication series

NameAdvances in Intelligent Systems and Computing
Volume730
ISSN (Print)2194-5357

Conference

Conference24th International Conference of the Forum for Interdisciplinary Mathematics, FIM 2015
Country/TerritorySpain
CityBarcelona
Period18/11/1520/11/15

Keywords

  • Biased-randomized heuristics
  • Smart cities
  • Vehicle routing problem
  • Waste collection problem

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'A biased-randomized heuristic for the waste collection problem in smart cities'. Together they form a unique fingerprint.

Cite this