Path finding with stowage planning consideration in a mixed pickup-delivery and specified-node network

Tsung-Sheng Chang; Yi Fang Liao

doi:10.1016/j.tre.2007.10.003

Path finding with stowage planning consideration in a mixed pickup-delivery and specified-node network

Tsung-Sheng Chang^*, Yi Fang Liao

^*Corresponding author for this work

Department of Transportation and Logistics Management

Research output: Contribution to journal › Article › peer-review

2 Scopus citations

Abstract

This paper considers the mixed pickup-delivery shortest path problem with specified nodes and stowage planning (mixed-PDSPSNSP), which combines path finding and three-dimensional stowage planning. The mixed-PDSPSNSP appears in many operational problems in various industries. However, to the best of our knowledge, there is no study in the literature for such a problem. The mixed-PDSPSNSP is NP-hard. Our proposed solution algorithm is shown to be effective and efficient when applied to a real-life mixed-PDSPSNSP.

Original language	English
Pages (from-to)	970-985
Number of pages	16
Journal	Transportation Research Part E: Logistics and Transportation Review
Volume	44
Issue number	6
DOIs	https://doi.org/10.1016/j.tre.2007.10.003
State	Published - 1 Jan 2008

Keywords

Pickup and delivery
Shortest path
Specified nodes
Stowage planning

Access to Document

10.1016/j.tre.2007.10.003

Link to publication in Scopus

Fingerprint Dive into the research topics of 'Path finding with stowage planning consideration in a mixed pickup-delivery and specified-node network'. Together they form a unique fingerprint.

Cite this

@article{0ee4245590524fa5a2c89c5358093386,

title = "Path finding with stowage planning consideration in a mixed pickup-delivery and specified-node network",

abstract = "This paper considers the mixed pickup-delivery shortest path problem with specified nodes and stowage planning (mixed-PDSPSNSP), which combines path finding and three-dimensional stowage planning. The mixed-PDSPSNSP appears in many operational problems in various industries. However, to the best of our knowledge, there is no study in the literature for such a problem. The mixed-PDSPSNSP is NP-hard. Our proposed solution algorithm is shown to be effective and efficient when applied to a real-life mixed-PDSPSNSP.",

keywords = "Pickup and delivery, Shortest path, Specified nodes, Stowage planning",

author = "Tsung-Sheng Chang and Liao, {Yi Fang}",

year = "2008",

month = jan,

day = "1",

doi = "10.1016/j.tre.2007.10.003",

language = "English",

volume = "44",

pages = "970--985",

journal = "Transportation Research, Part E: Logistics and Transportation Review",

issn = "1366-5545",

publisher = "Elsevier Limited",

number = "6",

}

TY - JOUR

T1 - Path finding with stowage planning consideration in a mixed pickup-delivery and specified-node network

AU - Chang, Tsung-Sheng

AU - Liao, Yi Fang

PY - 2008/1/1

Y1 - 2008/1/1

N2 - This paper considers the mixed pickup-delivery shortest path problem with specified nodes and stowage planning (mixed-PDSPSNSP), which combines path finding and three-dimensional stowage planning. The mixed-PDSPSNSP appears in many operational problems in various industries. However, to the best of our knowledge, there is no study in the literature for such a problem. The mixed-PDSPSNSP is NP-hard. Our proposed solution algorithm is shown to be effective and efficient when applied to a real-life mixed-PDSPSNSP.

AB - This paper considers the mixed pickup-delivery shortest path problem with specified nodes and stowage planning (mixed-PDSPSNSP), which combines path finding and three-dimensional stowage planning. The mixed-PDSPSNSP appears in many operational problems in various industries. However, to the best of our knowledge, there is no study in the literature for such a problem. The mixed-PDSPSNSP is NP-hard. Our proposed solution algorithm is shown to be effective and efficient when applied to a real-life mixed-PDSPSNSP.

KW - Pickup and delivery

KW - Shortest path

KW - Specified nodes

KW - Stowage planning

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

U2 - 10.1016/j.tre.2007.10.003

DO - 10.1016/j.tre.2007.10.003

M3 - Article

AN - SCOPUS:48649089626

VL - 44

SP - 970

EP - 985

JO - Transportation Research, Part E: Logistics and Transportation Review

JF - Transportation Research, Part E: Logistics and Transportation Review

SN - 1366-5545

IS - 6

ER -