摘要
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 |