Constraint Optimization for Highly Constrained Logistic Problems
Research output: Book / Anthology / Report / Ph.D. thesis › Report › Research
This report investigates whether propagators combined with branch and bound algorithm are suitable for solving the storage area stowage problem within reasonable time. The approach has not been attempted before and experiments show that the implementation was not capable of solving the storage area stowage problem efficiently. Nevertheless, the report incorporates a detailed analysis of the problem, acts as a valuable basis for comparing the quality of alternative approaches and reveals the properties of the solution space.
|Place of Publication||Copenhagen|
|Publisher||IT-Universitetet i København|
|Number of pages||136|
|Publication status||Published - 2008|
|Series||IT University Technical Report Series|