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

Maximiliano Cubillos and Sanne Wøhlk

Journal of the Operational Research Society, 2021, vol. 72, issue 8, 1898-1913

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.

Date: 2021
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1080/01605682.2020.1746701 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:tjorxx:v:72:y:2021:i:8:p:1898-1913

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/tjor20

DOI: 10.1080/01605682.2020.1746701

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald

More articles in Journal of the Operational Research Society from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().