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

Research output: Contribution to journalArticlepeer-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 languageEnglish
Pages (from-to)970-985
Number of pages16
JournalTransportation Research Part E: Logistics and Transportation Review
Volume44
Issue number6
DOIs
StatePublished - 1 Jan 2008

Keywords

  • Pickup and delivery
  • Shortest path
  • Specified nodes
  • Stowage planning

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