Department of Economics and Business Economics

Simon Emde

Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network

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

Standard

Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network. / Gschwind, Timo; Irnich, Stefan; Tilk, Christian; Emde, Simon.

In: Journal of Scheduling, Vol. 23, No. 3, 06.09.2019, p. 363-377.

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

Harvard

APA

CBE

MLA

Vancouver

Author

Gschwind, Timo ; Irnich, Stefan ; Tilk, Christian ; Emde, Simon. / Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network. In: Journal of Scheduling. 2019 ; Vol. 23, No. 3. pp. 363-377.

Bibtex

@article{2a448fbb9a9d4da0b44ba4d0e2cfede7,
title = "Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network",
abstract = "In a direct shipping (or point-to-point) network, individual deliveries are round trips from one supplier to one customer and back to either the same or another supplier, i.e., a truck can visit only one customer at a time before it has to return to a supplier. We consider the multiple sources/multiple sinks case, where a given set of direct deliveries from a set of suppliers to a set of customers must be scheduled such that the customer time windows are not violated, the truck fleet size is minimal, and the total weighted flow time is as small as possible. Direct shipping policies are commonly employed in just-in-time logistics (e.g., in the automotive industry) and in humanitarian logistics. We present an exact branch-cut-and-price algorithm for this problem, which is shown to perform well on instances from the literature and newly generated ones. We also investigate under what circumstances bundling suppliers in so-called supplier parks actually facilitates logistics operations under a direct shipping policy.",
keywords = "Branch-cut-and-price, Direct deliveries, Just-in-time logistics, Weighted flow time",
author = "Timo Gschwind and Stefan Irnich and Christian Tilk and Simon Emde",
year = "2019",
month = sep,
day = "6",
doi = "10.1007/s10951-019-00620-y",
language = "English",
volume = "23",
pages = "363--377",
journal = "Journal of Scheduling",
issn = "1094-6136",
publisher = "Springer New York",
number = "3",

}

RIS

TY - JOUR

T1 - Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network

AU - Gschwind, Timo

AU - Irnich, Stefan

AU - Tilk, Christian

AU - Emde, Simon

PY - 2019/9/6

Y1 - 2019/9/6

N2 - In a direct shipping (or point-to-point) network, individual deliveries are round trips from one supplier to one customer and back to either the same or another supplier, i.e., a truck can visit only one customer at a time before it has to return to a supplier. We consider the multiple sources/multiple sinks case, where a given set of direct deliveries from a set of suppliers to a set of customers must be scheduled such that the customer time windows are not violated, the truck fleet size is minimal, and the total weighted flow time is as small as possible. Direct shipping policies are commonly employed in just-in-time logistics (e.g., in the automotive industry) and in humanitarian logistics. We present an exact branch-cut-and-price algorithm for this problem, which is shown to perform well on instances from the literature and newly generated ones. We also investigate under what circumstances bundling suppliers in so-called supplier parks actually facilitates logistics operations under a direct shipping policy.

AB - In a direct shipping (or point-to-point) network, individual deliveries are round trips from one supplier to one customer and back to either the same or another supplier, i.e., a truck can visit only one customer at a time before it has to return to a supplier. We consider the multiple sources/multiple sinks case, where a given set of direct deliveries from a set of suppliers to a set of customers must be scheduled such that the customer time windows are not violated, the truck fleet size is minimal, and the total weighted flow time is as small as possible. Direct shipping policies are commonly employed in just-in-time logistics (e.g., in the automotive industry) and in humanitarian logistics. We present an exact branch-cut-and-price algorithm for this problem, which is shown to perform well on instances from the literature and newly generated ones. We also investigate under what circumstances bundling suppliers in so-called supplier parks actually facilitates logistics operations under a direct shipping policy.

KW - Branch-cut-and-price

KW - Direct deliveries

KW - Just-in-time logistics

KW - Weighted flow time

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

U2 - 10.1007/s10951-019-00620-y

DO - 10.1007/s10951-019-00620-y

M3 - Journal article

AN - SCOPUS:85073954595

VL - 23

SP - 363

EP - 377

JO - Journal of Scheduling

JF - Journal of Scheduling

SN - 1094-6136

IS - 3

ER -