Department of Economics and Business Economics

Simon Emde

Cyclic inventory routing in a line-shaped network

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

Standard

Cyclic inventory routing in a line-shaped network. / Zenker, Michael; Emde, Simon; Boysen, Nils.

In: European Journal of Operational Research, Vol. 250, No. 1, 01.04.2016, p. 164-178.

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

Harvard

Zenker, M, Emde, S & Boysen, N 2016, 'Cyclic inventory routing in a line-shaped network', European Journal of Operational Research, vol. 250, no. 1, pp. 164-178. https://doi.org/10.1016/j.ejor.2015.10.067

APA

Zenker, M., Emde, S., & Boysen, N. (2016). Cyclic inventory routing in a line-shaped network. European Journal of Operational Research, 250(1), 164-178. https://doi.org/10.1016/j.ejor.2015.10.067

CBE

Zenker M, Emde S, Boysen N. 2016. Cyclic inventory routing in a line-shaped network. European Journal of Operational Research. 250(1):164-178. https://doi.org/10.1016/j.ejor.2015.10.067

MLA

Zenker, Michael, Simon Emde and Nils Boysen. "Cyclic inventory routing in a line-shaped network". European Journal of Operational Research. 2016, 250(1). 164-178. https://doi.org/10.1016/j.ejor.2015.10.067

Vancouver

Zenker M, Emde S, Boysen N. Cyclic inventory routing in a line-shaped network. European Journal of Operational Research. 2016 Apr 1;250(1):164-178. https://doi.org/10.1016/j.ejor.2015.10.067

Author

Zenker, Michael ; Emde, Simon ; Boysen, Nils. / Cyclic inventory routing in a line-shaped network. In: European Journal of Operational Research. 2016 ; Vol. 250, No. 1. pp. 164-178.

Bibtex

@article{f298b19858a447e58b04bb173369fb2f,
title = "Cyclic inventory routing in a line-shaped network",
abstract = "The inventory routing problem (IRP) is a very challenging optimization task that couples two of the most important components of supply chain management, i.e., inventory control and transportation. Routes of vehicles are to be determined to repeatedly resupply multiple customers with constant demand rates from a single depot. We alter this basic IRP setting by two aspects: (i) only cyclic tours are allowed, i.e., each vehicle continuously tours its dedicated route, and (ii) all customers are located along a line. Both characteristics occur, for instance, in liner shipping (when feeder ships service inland ports along a stream) and in facility logistics (when tow trains deliver part bins to the stations of an assembly line). We formalize the resulting problem setting, identify NP-hard as well as polynomially solvable cases, and develop suited solution procedures.",
keywords = "Container shipping, Cyclic routes, Facility logistics, Inventory routing",
author = "Michael Zenker and Simon Emde and Nils Boysen",
year = "2016",
month = apr,
day = "1",
doi = "10.1016/j.ejor.2015.10.067",
language = "English",
volume = "250",
pages = "164--178",
journal = "European Journal of Operational Research",
issn = "0377-2217",
publisher = "Elsevier BV",
number = "1",

}

RIS

TY - JOUR

T1 - Cyclic inventory routing in a line-shaped network

AU - Zenker, Michael

AU - Emde, Simon

AU - Boysen, Nils

PY - 2016/4/1

Y1 - 2016/4/1

N2 - The inventory routing problem (IRP) is a very challenging optimization task that couples two of the most important components of supply chain management, i.e., inventory control and transportation. Routes of vehicles are to be determined to repeatedly resupply multiple customers with constant demand rates from a single depot. We alter this basic IRP setting by two aspects: (i) only cyclic tours are allowed, i.e., each vehicle continuously tours its dedicated route, and (ii) all customers are located along a line. Both characteristics occur, for instance, in liner shipping (when feeder ships service inland ports along a stream) and in facility logistics (when tow trains deliver part bins to the stations of an assembly line). We formalize the resulting problem setting, identify NP-hard as well as polynomially solvable cases, and develop suited solution procedures.

AB - The inventory routing problem (IRP) is a very challenging optimization task that couples two of the most important components of supply chain management, i.e., inventory control and transportation. Routes of vehicles are to be determined to repeatedly resupply multiple customers with constant demand rates from a single depot. We alter this basic IRP setting by two aspects: (i) only cyclic tours are allowed, i.e., each vehicle continuously tours its dedicated route, and (ii) all customers are located along a line. Both characteristics occur, for instance, in liner shipping (when feeder ships service inland ports along a stream) and in facility logistics (when tow trains deliver part bins to the stations of an assembly line). We formalize the resulting problem setting, identify NP-hard as well as polynomially solvable cases, and develop suited solution procedures.

KW - Container shipping

KW - Cyclic routes

KW - Facility logistics

KW - Inventory routing

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

U2 - 10.1016/j.ejor.2015.10.067

DO - 10.1016/j.ejor.2015.10.067

M3 - Journal article

AN - SCOPUS:84963859701

VL - 250

SP - 164

EP - 178

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 1

ER -