6533b7d3fe1ef96bd125ff6c
RESEARCH PRODUCT
A GRASP algorithm for the container stowage slot planning problem
Francisco ParreñoRamón Alvarez-valdésDario Pacinosubject
EngineeringOperations researchHeuristic (computer science)Container vessel stowage planning0211 other engineering and technologiesTransportation02 engineering and technologyManagement Science and Operations ResearchSHIPSOPERATIONSNUMBERGRASP0202 electrical engineering electronic engineering information engineeringHeuristic algorithmsLOADING PROBLEMBusiness and International ManagementInteger programmingREDUCEGreedy randomized adaptive search procedureCivil and Structural EngineeringSlot planningECONOMICS021103 operations researchbusiness.industryGRASPSHIFTSInteger programmingREACTIVE GRASPENGINEERINGPACKING PROBLEMSPacking problemsContainer (abstract data type)StowageBenchmark (computing)020201 artificial intelligence & image processingbusinessSETdescription
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. (C) 2016 Elsevier Ltd. All rights reserved.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2016-10-01 | Transportation Research Part E: Logistics and Transportation Review |