Department of Economics and Business Economics

A variable neighborhood search for the multi-period collection of recyclable materials

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

Standard

A variable neighborhood search for the multi-period collection of recyclable materials. / Andersen, Maria Elbek; Wøhlk, Sanne.

In: European Journal of Operational Research, Vol. 249, No. 2, 2016, p. 540-550.

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

Harvard

APA

CBE

MLA

Vancouver

Author

Andersen, Maria Elbek ; Wøhlk, Sanne. / A variable neighborhood search for the multi-period collection of recyclable materials. In: European Journal of Operational Research. 2016 ; Vol. 249, No. 2. pp. 540-550.

Bibtex

@article{a53b66038ecf4421ac9fe72cf6e872c4,
title = "A variable neighborhood search for the multi-period collection of recyclable materials",
abstract = "We consider an approach for scheduling the multi-period collection of recyclable materials. Citizens can deposit glass and paper for recycling in small cubes located at several collection points. The cubes are emptied by a vehicle that carries two containers and the material is transported to two treatment facilities. We investigate how the scheduling of emptying and transportation should be done in order to minimize the operation cost, while providing a high service level and ensuring that capacity constraints are not violated. We develop a heuristic solution method for solving the daily planning problem with uncertain accretion rate for materials by considering a rolling time horizon of a few days. We apply a construction heuristic in the first period and re-optimize the solution every subsequent period with a variable neighborhood search. Computational experiments are conducted on real life data.",
author = "Andersen, {Maria Elbek} and Sanne W{\o}hlk",
year = "2016",
doi = "10.1016/j.ejor.2015.08.035",
language = "English",
volume = "249",
pages = "540--550",
journal = "European Journal of Operational Research",
issn = "0377-2217",
publisher = "Elsevier BV",
number = "2",

}

RIS

TY - JOUR

T1 - A variable neighborhood search for the multi-period collection of recyclable materials

AU - Andersen, Maria Elbek

AU - Wøhlk, Sanne

PY - 2016

Y1 - 2016

N2 - We consider an approach for scheduling the multi-period collection of recyclable materials. Citizens can deposit glass and paper for recycling in small cubes located at several collection points. The cubes are emptied by a vehicle that carries two containers and the material is transported to two treatment facilities. We investigate how the scheduling of emptying and transportation should be done in order to minimize the operation cost, while providing a high service level and ensuring that capacity constraints are not violated. We develop a heuristic solution method for solving the daily planning problem with uncertain accretion rate for materials by considering a rolling time horizon of a few days. We apply a construction heuristic in the first period and re-optimize the solution every subsequent period with a variable neighborhood search. Computational experiments are conducted on real life data.

AB - We consider an approach for scheduling the multi-period collection of recyclable materials. Citizens can deposit glass and paper for recycling in small cubes located at several collection points. The cubes are emptied by a vehicle that carries two containers and the material is transported to two treatment facilities. We investigate how the scheduling of emptying and transportation should be done in order to minimize the operation cost, while providing a high service level and ensuring that capacity constraints are not violated. We develop a heuristic solution method for solving the daily planning problem with uncertain accretion rate for materials by considering a rolling time horizon of a few days. We apply a construction heuristic in the first period and re-optimize the solution every subsequent period with a variable neighborhood search. Computational experiments are conducted on real life data.

U2 - 10.1016/j.ejor.2015.08.035

DO - 10.1016/j.ejor.2015.08.035

M3 - Journal article

VL - 249

SP - 540

EP - 550

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 2

ER -