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

Tsung-Sheng Chang*, Yi Fang Liao

*此作品的通信作者

研究成果: Article同行評審

4 引文 斯高帕斯(Scopus)

摘要

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.

原文English
頁(從 - 到)970-985
頁數16
期刊Transportation Research Part E: Logistics and Transportation Review
44
發行號6
DOIs
出版狀態Published - 1 1月 2008

指紋

深入研究「Path finding with stowage planning consideration in a mixed pickup-delivery and specified-node network」主題。共同形成了獨特的指紋。

引用此