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

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

Resultado de la investigación: Conference contribution

3 Citas (Scopus)

Resumen

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.

Idioma originalEnglish
Título de la publicación alojadaApplied Mathematics and Computational Intelligence, 2015
EditorialSpringer Verlag
Páginas255-263
Número de páginas9
ISBN (versión impresa)9783319757919
DOI
EstadoPublished - 1 ene 2018
Evento24th International Conference of the Forum for Interdisciplinary Mathematics, FIM 2015 - Barcelona, Spain
Duración: 18 nov 201520 nov 2015

Serie de la publicación

NombreAdvances in Intelligent Systems and Computing
Volumen730
ISSN (versión impresa)2194-5357

Conference

Conference24th International Conference of the Forum for Interdisciplinary Mathematics, FIM 2015
PaísSpain
CiudadBarcelona
Período18/11/1520/11/15

Huella dactilar

Vehicle routing
Smart city

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Computer Science(all)

Citar esto

Gruler, A., Juan, A. A., Contreras-Bolton, C., & Gatica, G. (2018). A biased-randomized heuristic for the waste collection problem in smart cities. En Applied Mathematics and Computational Intelligence, 2015 (pp. 255-263). (Advances in Intelligent Systems and Computing; Vol. 730). Springer Verlag. https://doi.org/10.1007/978-3-319-75792-6_19
Gruler, Aljoscha ; Juan, Angel A. ; Contreras-Bolton, Carlos ; Gatica, Gustavo. / A biased-randomized heuristic for the waste collection problem in smart cities. Applied Mathematics and Computational Intelligence, 2015. Springer Verlag, 2018. pp. 255-263 (Advances in Intelligent Systems and Computing).
@inproceedings{5e39343778a045be813fbe8365deb348,
title = "A biased-randomized heuristic for the waste collection problem in smart cities",
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.",
keywords = "Biased-randomized heuristics, Smart cities, Vehicle routing problem, Waste collection problem",
author = "Aljoscha Gruler and Juan, {Angel A.} and Carlos Contreras-Bolton and Gustavo Gatica",
year = "2018",
month = "1",
day = "1",
doi = "10.1007/978-3-319-75792-6_19",
language = "English",
isbn = "9783319757919",
series = "Advances in Intelligent Systems and Computing",
publisher = "Springer Verlag",
pages = "255--263",
booktitle = "Applied Mathematics and Computational Intelligence, 2015",
address = "Germany",

}

Gruler, A, Juan, AA, Contreras-Bolton, C & Gatica, G 2018, A biased-randomized heuristic for the waste collection problem in smart cities. En Applied Mathematics and Computational Intelligence, 2015. Advances in Intelligent Systems and Computing, vol. 730, Springer Verlag, pp. 255-263, 24th International Conference of the Forum for Interdisciplinary Mathematics, FIM 2015, Barcelona, Spain, 18/11/15. https://doi.org/10.1007/978-3-319-75792-6_19

A biased-randomized heuristic for the waste collection problem in smart cities. / Gruler, Aljoscha; Juan, Angel A.; Contreras-Bolton, Carlos; Gatica, Gustavo.

Applied Mathematics and Computational Intelligence, 2015. Springer Verlag, 2018. p. 255-263 (Advances in Intelligent Systems and Computing; Vol. 730).

Resultado de la investigación: Conference contribution

TY - GEN

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

AU - Gruler, Aljoscha

AU - Juan, Angel A.

AU - Contreras-Bolton, Carlos

AU - Gatica, Gustavo

PY - 2018/1/1

Y1 - 2018/1/1

N2 - 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.

AB - 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.

KW - Biased-randomized heuristics

KW - Smart cities

KW - Vehicle routing problem

KW - Waste collection problem

UR - http://www.scopus.com/inward/record.url?scp=85044039306&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-75792-6_19

DO - 10.1007/978-3-319-75792-6_19

M3 - Conference contribution

AN - SCOPUS:85044039306

SN - 9783319757919

T3 - Advances in Intelligent Systems and Computing

SP - 255

EP - 263

BT - Applied Mathematics and Computational Intelligence, 2015

PB - Springer Verlag

ER -

Gruler A, Juan AA, Contreras-Bolton C, Gatica G. A biased-randomized heuristic for the waste collection problem in smart cities. En Applied Mathematics and Computational Intelligence, 2015. Springer Verlag. 2018. p. 255-263. (Advances in Intelligent Systems and Computing). https://doi.org/10.1007/978-3-319-75792-6_19