Department of Economics and Business Economics

Solution of the maximal covering tour problem for locating recycling drop-off stations

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

Standard

Solution of the maximal covering tour problem for locating recycling drop-off stations. / Cubillos, Maximiliano; Wøhlk, Sanne.

In: Journal of the Operational Research Society, Vol. 72, No. 8, 2021, p. 1898-1913.

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

Harvard

APA

CBE

MLA

Vancouver

Author

Cubillos, Maximiliano ; Wøhlk, Sanne. / Solution of the maximal covering tour problem for locating recycling drop-off stations. In: Journal of the Operational Research Society. 2021 ; Vol. 72, No. 8. pp. 1898-1913.

Bibtex

@article{a616781da706438baf1c715fdcdd1af9,
title = "Solution of the maximal covering tour problem for locating recycling drop-off stations",
abstract = "Tactical decisions on the location of recycling drop-off stations and the associated collection system are essential in order to increase recycling amounts while keeping operational costs at a minimum. The conflicting nature of the objectives of the problem can be modelled as a bi-objective location-routeing problem. In this paper, we address the location-routeing problem of recycling drop-off stations by solving the Maximal Covering Tour Problem. To this aim, we propose a heuristic inspired by a variable neighbourhood search. The heuristic is tested on a set of benchmark instances from the TSPLIB and applied to a set of real-life instances from both urban and rural areas in Denmark. Based on the results of the real-life cases, we provide insights on the trade-off between recycling rates and transportation costs.",
keywords = "heuristics, Location, maximal covering tour, recycling, SDGCircularEconomy",
author = "Maximiliano Cubillos and Sanne W{\o}hlk",
year = "2021",
doi = "10.1080/01605682.2020.1746701",
language = "English",
volume = "72",
pages = "1898--1913",
journal = "Journal of the Operational Research Society",
issn = "0160-5682",
publisher = "Palgrave Macmillan Ltd.",
number = "8",

}

RIS

TY - JOUR

T1 - Solution of the maximal covering tour problem for locating recycling drop-off stations

AU - Cubillos, Maximiliano

AU - Wøhlk, Sanne

PY - 2021

Y1 - 2021

N2 - Tactical decisions on the location of recycling drop-off stations and the associated collection system are essential in order to increase recycling amounts while keeping operational costs at a minimum. The conflicting nature of the objectives of the problem can be modelled as a bi-objective location-routeing problem. In this paper, we address the location-routeing problem of recycling drop-off stations by solving the Maximal Covering Tour Problem. To this aim, we propose a heuristic inspired by a variable neighbourhood search. The heuristic is tested on a set of benchmark instances from the TSPLIB and applied to a set of real-life instances from both urban and rural areas in Denmark. Based on the results of the real-life cases, we provide insights on the trade-off between recycling rates and transportation costs.

AB - Tactical decisions on the location of recycling drop-off stations and the associated collection system are essential in order to increase recycling amounts while keeping operational costs at a minimum. The conflicting nature of the objectives of the problem can be modelled as a bi-objective location-routeing problem. In this paper, we address the location-routeing problem of recycling drop-off stations by solving the Maximal Covering Tour Problem. To this aim, we propose a heuristic inspired by a variable neighbourhood search. The heuristic is tested on a set of benchmark instances from the TSPLIB and applied to a set of real-life instances from both urban and rural areas in Denmark. Based on the results of the real-life cases, we provide insights on the trade-off between recycling rates and transportation costs.

KW - heuristics

KW - Location

KW - maximal covering tour

KW - recycling

KW - SDGCircularEconomy

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

U2 - 10.1080/01605682.2020.1746701

DO - 10.1080/01605682.2020.1746701

M3 - Journal article

AN - SCOPUS:85083773194

VL - 72

SP - 1898

EP - 1913

JO - Journal of the Operational Research Society

JF - Journal of the Operational Research Society

SN - 0160-5682

IS - 8

ER -