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

Maximiliano Cubillos*, Sanne Wøhlk

*Corresponding author for this work

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

28 Downloads (Pure)

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.

Original languageEnglish
JournalJournal of the Operational Research Society
Volume72
Issue8
Pages (from-to)1898-1913
Number of pages16
ISSN0160-5682
DOIs
Publication statusPublished - 2021

Keywords

  • heuristics
  • Location
  • maximal covering tour
  • recycling
  • SDGCircularEconomy

Fingerprint

Dive into the research topics of 'Solution of the maximal covering tour problem for locating recycling drop-off stations'. Together they form a unique fingerprint.

Cite this