| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1023985 | Transportation Research Part E: Logistics and Transportation Review | 2008 | 16 Pages |
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.
Related Topics
Social Sciences and Humanities
Business, Management and Accounting
Business and International Management
Authors
Tsung-Sheng Chang, Yi-Fang Liao,