The pickup and delivery problem with cross-docking opportunity

Hanne Løhmann Petersen; Stefan Røpke

doi:10.1007/978-3-642-24264-9_8

The pickup and delivery problem with cross-docking opportunity

Hanne Løhmann Petersen, Stefan Røpke

Research output: Contribution to journal › Conference article › Research › peer-review

Abstract

In this paper, we consider the pickup and delivery problem with cross-docking opportunity (PDPCD). The problem arises from an industry application, and includes pickup requests, delivery requests, and pickup-and-delivery requests. Each pickup-and-delivery request can be served either as direct delivery by one truck, or by being picked up and transported to the cross-dock by one vehicle, and subsequently delivered at its final destination by another vehicle. Handling times at customers sites and terminal are given. A typical daily instance includes 500-1,000 requests. We solve the problem using a Large Neighborhood Search (LNS) approach. © 2011 Springer-Verlag.

Original language	English
Book series	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	6971
Pages (from-to)	101-113
ISSN	0302-9743
DOIs	https://doi.org/10.1007/978-3-642-24264-9_8
Publication status	Published - 2011
Event	2nd International Conference on Computational Logistics - Hamburg, Germany Duration: 19 Sept 2011 → 22 Sept 2011 Conference number: 2

Conference

Conference	2nd International Conference on Computational Logistics
Number	2
Country/Territory	Germany
City	Hamburg
Period	19/09/2011 → 22/09/2011

Access to Document

10.1007/978-3-642-24264-9_8

OpenUrl availability

Full text

Cite this

@inproceedings{110670140724441095d0b226bc187bbb,

title = "The pickup and delivery problem with cross-docking opportunity",

abstract = "In this paper, we consider the pickup and delivery problem with cross-docking opportunity (PDPCD). The problem arises from an industry application, and includes pickup requests, delivery requests, and pickup-and-delivery requests. Each pickup-and-delivery request can be served either as direct delivery by one truck, or by being picked up and transported to the cross-dock by one vehicle, and subsequently delivered at its final destination by another vehicle. Handling times at customers sites and terminal are given. A typical daily instance includes 500-1,000 requests. We solve the problem using a Large Neighborhood Search (LNS) approach. {\textcopyright} 2011 Springer-Verlag.",

author = "Petersen, {Hanne L{\o}hmann} and Stefan R{\o}pke",

year = "2011",

doi = "10.1007/978-3-642-24264-9_8",

language = "English",

volume = "6971",

pages = "101--113",

journal = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

issn = "0302-9743",

publisher = "Springer",

note = "2nd International Conference on Computational Logistics, ICCL 2011 ; Conference date: 19-09-2011 Through 22-09-2011",

}

TY - GEN

T1 - The pickup and delivery problem with cross-docking opportunity

AU - Petersen, Hanne Løhmann

AU - Røpke, Stefan

N1 - Conference code: 2

PY - 2011

Y1 - 2011

N2 - In this paper, we consider the pickup and delivery problem with cross-docking opportunity (PDPCD). The problem arises from an industry application, and includes pickup requests, delivery requests, and pickup-and-delivery requests. Each pickup-and-delivery request can be served either as direct delivery by one truck, or by being picked up and transported to the cross-dock by one vehicle, and subsequently delivered at its final destination by another vehicle. Handling times at customers sites and terminal are given. A typical daily instance includes 500-1,000 requests. We solve the problem using a Large Neighborhood Search (LNS) approach. © 2011 Springer-Verlag.

AB - In this paper, we consider the pickup and delivery problem with cross-docking opportunity (PDPCD). The problem arises from an industry application, and includes pickup requests, delivery requests, and pickup-and-delivery requests. Each pickup-and-delivery request can be served either as direct delivery by one truck, or by being picked up and transported to the cross-dock by one vehicle, and subsequently delivered at its final destination by another vehicle. Handling times at customers sites and terminal are given. A typical daily instance includes 500-1,000 requests. We solve the problem using a Large Neighborhood Search (LNS) approach. © 2011 Springer-Verlag.

U2 - 10.1007/978-3-642-24264-9_8

DO - 10.1007/978-3-642-24264-9_8

M3 - Conference article

SN - 0302-9743

VL - 6971

SP - 101

EP - 113

JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

T2 - 2nd International Conference on Computational Logistics

Y2 - 19 September 2011 through 22 September 2011

ER -

The pickup and delivery problem with cross-docking opportunity

Abstract

Conference

Access to Document

OpenUrl availability

Fingerprint

Cite this