Constraint Optimization for Highly Constrained Logistic Problems

Research output: Book / Anthology / Report / Ph.D. thesisReportResearch

View graph of relations

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.

Original languageEnglish
Place of PublicationCopenhagen
PublisherIT-Universitetet i København
Number of pages136
ISBN (Print)978-87-7949-163-2
Publication statusPublished - 2008
SeriesIT University Technical Report Series

ID: 275397