Constraint Optimization for Highly Constrained Logistic Problems

Maria Kinga Mochnacs, Meang Akira Tanaka, Anders Nyborg, Rune Møller Jensen

    Publikation: Bog / Antologi / Rapport / Ph.D.-afhandlingRapportForskning

    Abstract

    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.

    OriginalsprogEngelsk
    UdgivelsesstedCopenhagen
    ForlagIT-Universitetet i København
    UdgaveTR-2007-2008-104
    Antal sider136
    ISBN (Trykt)978-87-7949-163-2
    StatusUdgivet - 2008
    NavnIT University Technical Report Series
    NummerTR-2007-2008-104
    ISSN1600-6100

    Emneord

    • Storage Area Stowage Problem
    • Branch and Bound Algorithm
    • Propagators
    • Solution Space Analysis
    • Computational Efficiency

    Citationsformater