|کد مقاله||کد نشریه||سال انتشار||مقاله انگلیسی||ترجمه فارسی||نسخه تمام متن|
|1022908||1482996||2016||17 صفحه PDF||سفارش دهید||دانلود رایگان|
• A generalization of Slot Planning including intake maximization and IMO containers.
• An improved IP formulation with a better lower bound and optimality performance.
• A GRASP implementation with different randomization strategies and improvement moves.
• A novel public benchmark of instances with different characteristics.
This work presents a generalization of the Slot Planning Problem which raises when the liner shipping industry needs to plan the placement of containers within a vessel (stowage planning). State-of-the-art stowage planning relies on a heuristic decomposition where containers are first distributed in clusters along the vessel. For each of those clusters a specific position for each container must be found. Compared to previous studies, we have introduced two new features: the explicit handling of rolled out containers and the inclusion of separations rules for dangerous cargo. We present a novel integer programming formulation and a Greedy Randomized Adaptive Search Procedure (GRASP) to solve the problem. The approach is able to find high-quality solution within 1 s. We also provide comparison with the state-of-the-art on an existing and a new set of benchmark instances.
Journal: Transportation Research Part E: Logistics and Transportation Review - Volume 94, October 2016, Pages 141–157