Solving the Pre-Marshalling Problem to Optimality with A* and IDA*

Kevin Tierney, Dario Pacino, Stefan Voß

    Research output: Contribution to conferenceConference abstract for conferenceResearchpeer-review

    Abstract

    We present a novel solution approach to the container pre-marshalling problem (CPMP) using the A* and IDA* algorithms combined with several novel branching and symmetry breaking rules that significantly increase the number of pre-marshalling instances that can be solved to optimality. The CPMP is a key problem for container terminals to reduce delays of inter-modal container transports. The goal of the CPMP is to find the minimal sequence of container movements to shuffle containers in a set of stacks such that the resultig stacks are arranged by the time each container must leave the stacks.
    Original languageEnglish
    Publication date2014
    Number of pages1
    Publication statusPublished - 2014
    EventConference of the International Federation of Operational Research Societies. - Barcelona International Convention Center, Barcelona, Spain
    Duration: 13 Jul 201418 Jul 2014
    Conference number: 20

    Conference

    ConferenceConference of the International Federation of Operational Research Societies.
    Number20
    LocationBarcelona International Convention Center
    CountrySpain
    CityBarcelona
    Period13/07/201418/07/2014

    Cite this

    Tierney, K., Pacino, D., & Voß, S. (2014). Solving the Pre-Marshalling Problem to Optimality with A* and IDA*. Abstract from Conference of the International Federation of Operational Research Societies., Barcelona, Spain. http://ifors2014.org/