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

Kevin Tierney; Dario Pacino; Stefan Voß

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

Kevin Tierney
, Dario Pacino
, Stefan Voß

Paderborn University
University of Hamburg

Research output: Contribution to conference › Conference abstract for conference › Research › peer-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 language	English
Publication date	2014
Number of pages	1
Publication status	Published - 2014
Event	20^th Conference of the International Federation of Operational Research Societies. - Barcelona International Convention Center, Barcelona, Spain Duration: 13 Jul 2014 → 18 Jul 2014 Conference number: 20

Conference

Conference	20^th Conference of the International Federation of Operational Research Societies.
Number	20
Location	Barcelona International Convention Center
Country/Territory	Spain
City	Barcelona
Period	13/07/2014 → 18/07/2014

OpenUrl availability

Check availability in DTU Findit

Cite this

@conference{2151502035d94d84ace5b5abcecce4d4,

title = "Solving the Pre-Marshalling Problem to Optimality with A* and IDA*",

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. ",

author = "Kevin Tierney and Dario Pacino and Stefan Vo{\ss}",

year = "2014",

language = "English",

note = "20<sup>th</sup> Conference of the International Federation of Operational Research Societies., IFORS ; Conference date: 13-07-2014 Through 18-07-2014",

}

TY - ABST

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

AU - Tierney, Kevin

AU - Pacino, Dario

AU - Voß, Stefan

N1 - Conference code: 20

PY - 2014

Y1 - 2014

N2 - 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.

AB - 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.

M3 - Conference abstract for conference

T2 - 20<sup>th</sup> Conference of the International Federation of Operational Research Societies.

Y2 - 13 July 2014 through 18 July 2014

ER -

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

Abstract

Conference

OpenUrl availability

Fingerprint

Cite this