Solving vehicle routing with full container load and time windows

Line Reinhardt; Simon Spoorendonk; David Pisinger

doi:10.1007/978-3-642-33587-7_9

Solving vehicle routing with full container load and time windows

Line Reinhardt, Simon Spoorendonk, David Pisinger

Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › peer review

Abstract

A service provided by the liner shipping companies is the transport of containers by truck between the terminal and customers. These transports consist of import orders and export orders. Even though these transports concern containers and, therefore, each order is a full load, an import and an export order can be combined in one trip where the container is emptied at an import customer and taken to an export customer to be filled. Finding a set of optimal vehicle routes allowing these combinations is NP-hard. However, exploring the fact that the number of possible routes is small in the problem presented, we in this report show a model which can within seconds solve the problem to optimality. The model is tested on real-life data sets and additional constraints to the problem are considered

Originalsprog	Engelsk
Titel	Computational Logistics. ICCL 2012
Redaktører	H. Hu, X. Shi, R. Stahlbock, S. Voss
Antal sider	9
Vol/bind	7555
Udgivelsessted	Berlin, Heidelberg
Forlag	Springer
Publikationsdato	2012
Sider	120-128
ISBN (Trykt)	978-3-642-33586-0
ISBN (Elektronisk)	978-3-642-33587-7
DOI	https://doi.org/10.1007/978-3-642-33587-7_9
Status	Udgivet - 2012
Udgivet eksternt	Ja
Begivenhed	3rd International Conference on Computational Logistics - Shanghai, Kina Varighed: 24 sep. 2012 → 26 sep. 2012 Konferencens nummer: 3

Konference

Konference	3rd International Conference on Computational Logistics
Nummer	3
Land/Område	Kina
By	Shanghai
Periode	24/09/2012 → 26/09/2012

Navn	Lecture Notes in Computer Science
Nummer	7555
ISSN	0302-9743

Link til dokument

10.1007/978-3-642-33587-7_9

Citer dette

@inproceedings{9259720ee38b42718651dc82247034a4,

title = "Solving vehicle routing with full container load and time windows",

abstract = "A service provided by the liner shipping companies is the transport of containers by truck between the terminal and customers. These transports consist of import orders and export orders. Even though these transports concern containers and, therefore, each order is a full load, an import and an export order can be combined in one trip where the container is emptied at an import customer and taken to an export customer to be filled. Finding a set of optimal vehicle routes allowing these combinations is NP-hard. However, exploring the fact that the number of possible routes is small in the problem presented, we in this report show a model which can within seconds solve the problem to optimality. The model is tested on real-life data sets and additional constraints to the problem are considered",

keywords = "Time window, Shipping company, Empty container, Local search heuristic, Delivery prob",

author = "Line Reinhardt and Simon Spoorendonk and David Pisinger",

year = "2012",

doi = "10.1007/978-3-642-33587-7_9",

language = "English",

isbn = "978-3-642-33586-0",

volume = "7555",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

number = "7555",

pages = "120--128",

editor = "H. Hu and X. Shi and Stahlbock, {R. } and S. Voss",

booktitle = "Computational Logistics. ICCL 2012",

note = "3rd International Conference on Computational Logistics, ICCL 2012 ; Conference date: 24-09-2012 Through 26-09-2012",

}

Reinhardt, L, Spoorendonk, S & Pisinger, D 2012, Solving vehicle routing with full container load and time windows. i H Hu, X Shi, R Stahlbock & S Voss (red), Computational Logistics. ICCL 2012. bind 7555, Springer, Berlin, Heidelberg, Lecture Notes in Computer Science, nr. 7555, s. 120-128, 3rd International Conference on Computational Logistics, Shanghai, Kina, 24/09/2012. https://doi.org/10.1007/978-3-642-33587-7_9

Solving vehicle routing with full container load and time windows. / Reinhardt, Line; Spoorendonk, Simon; Pisinger, David.
Computational Logistics. ICCL 2012. red. / H. Hu; X. Shi; R. Stahlbock; S. Voss. Bind 7555 Berlin, Heidelberg: Springer, 2012. s. 120-128 (Lecture Notes in Computer Science; Nr. 7555).

Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › peer review

TY - GEN

T1 - Solving vehicle routing with full container load and time windows

AU - Reinhardt, Line

AU - Spoorendonk, Simon

AU - Pisinger, David

N1 - Conference code: 3

PY - 2012

Y1 - 2012

N2 - A service provided by the liner shipping companies is the transport of containers by truck between the terminal and customers. These transports consist of import orders and export orders. Even though these transports concern containers and, therefore, each order is a full load, an import and an export order can be combined in one trip where the container is emptied at an import customer and taken to an export customer to be filled. Finding a set of optimal vehicle routes allowing these combinations is NP-hard. However, exploring the fact that the number of possible routes is small in the problem presented, we in this report show a model which can within seconds solve the problem to optimality. The model is tested on real-life data sets and additional constraints to the problem are considered

AB - A service provided by the liner shipping companies is the transport of containers by truck between the terminal and customers. These transports consist of import orders and export orders. Even though these transports concern containers and, therefore, each order is a full load, an import and an export order can be combined in one trip where the container is emptied at an import customer and taken to an export customer to be filled. Finding a set of optimal vehicle routes allowing these combinations is NP-hard. However, exploring the fact that the number of possible routes is small in the problem presented, we in this report show a model which can within seconds solve the problem to optimality. The model is tested on real-life data sets and additional constraints to the problem are considered

KW - Time window

KW - Shipping company

KW - Empty container

KW - Local search heuristic

KW - Delivery prob

U2 - 10.1007/978-3-642-33587-7_9

DO - 10.1007/978-3-642-33587-7_9

M3 - Article in proceedings

SN - 978-3-642-33586-0

VL - 7555

T3 - Lecture Notes in Computer Science

SP - 120

EP - 128

BT - Computational Logistics. ICCL 2012

A2 - Hu, H.

A2 - Shi, X.

A2 - Stahlbock, R.

A2 - Voss, S.

PB - Springer

CY - Berlin, Heidelberg

T2 - 3rd International Conference on Computational Logistics

Y2 - 24 September 2012 through 26 September 2012

ER -