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

Autor:	Tsung-Sheng Chang, Yi Fang Liao
Rok vydání:	2008
Předmět:	Mathematical optimization Engineering business.industry Stowage Shortest path problem Path (graph theory) Transportation Pickup Business and International Management business Constrained Shortest Path First Civil and Structural Engineering Fleet management
Zdroj:	Transportation Research Part E: Logistics and Transportation Review. 44:970-985
ISSN:	1366-5545
DOI:	10.1016/j.tre.2007.10.003
Popis:	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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::5e8eafa3a5b80cf50abc60a6cc06e4d2 https://doi.org/10.1016/j.tre.2007.10.003 Zobrazit plný text záznamu Full Text from ScienceDirect