Container sequencing for quay cranes with internal reshuffles

Meisel, Frank; Wichmann, Matthias G.

doi:10.1007/s00291-009-0191-6

Cited by 59 publications

(38 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Areaj À jcrossjmaxðutilÞ Winter (1999) Steenken et al (2001) Areaj À jcross; savej À P w through Lim et al (2002Lim et al ( , 2004a) Bayj À jcrossjmaxðcomplÞ Lim et al (2004bLim et al ( ,c, 2007 Zhu and Lim (2006) Lee et al (2007 Meisel and Wichmann (2008) problem formulation that includes time windows in the QCSP with container groups is presented by . In this model QCs can possess multiple time windows for serving a vessel, as observed in practice under a variable-in-time QC-to-vessel assignment.…”

Section: Problem Classification Referencementioning

confidence: 99%

A survey of berth allocation and quay crane scheduling problems in container terminals

Bierwirth

Meisel

2010

European Journal of Operational Research

Self Cite

666

314

View full text Add to dashboard Cite

Section: Problem Classification Referencementioning

confidence: 99%

A survey of berth allocation and quay crane scheduling problems in container terminals

Bierwirth

Meisel

2010

European Journal of Operational Research

Self Cite

666

314

View full text Add to dashboard Cite

“…A complete discussion on the classification scheme and associated abbreviations can be found in their survey. (Meisel and Wichmann, 2010;Choo et al, 2010). Legato et al (2012) consider most of these constraints in a rich mixed-integer programming model.…”

Section: Berth Allocation Problem (Bap)mentioning

confidence: 99%

Sea Container Terminals: New Technologies, OR Models, and Emerging Research Areas

2014

View full text Add to dashboard Cite

Due to a rapid growth in world trade and a huge increase in containerized goods, sea container terminals play a vital role in globe-spanning supply chains. Container terminals should be able to handle large ships, with large call sizes within the shortest time possible, and at competitive rates. In response, terminal operators, shipping liners, and port authorities are investing in new technologies to improve container handling infrastructure and operational efficiency. Container terminals face challenging research problems which have received much attention from the academic community. The focus of this paper is to highlight the recent developments in the container terminals, which can be categorized into three areas: (1) innovative container terminal technologies, (2) new OR directions and models for existing research areas, and (3) emerging areas in container terminal research. By choosing this focus, we complement existing reviews on container terminal operations.

show abstract

“…By comparing their algorithm with the state-of-the-art heuristic, they demonstrate that their model can be solved more efficiently than the one proposed in Meisel and Wichmann [11].…”

Section: Stowage Planning In Singlementioning

confidence: 99%

Stowage Planning in Multiple Ports with Shifting Fee Minimization

Zhang

Qihuang

Liu

et al. 2018

Scientific Programming

View full text Add to dashboard Cite

This paper studies the problem of stowage planning within a vessel bay in a multiple port transportation route, aiming at minimizing the total container shifting fee. Since the access to containers is in the top-to-bottom order for each stack, reshuffle operations occur when a target container to be unloaded at its destination port is not stowed on the top of a stack at the time. Each container shift via a quay crane induces one unit of shifting fee that depends on the charge policy of the local container port. Previous studies assume that each container shift consumes a uniform cost in all ports and thus focus on minimizing the total number of shifts or the turnaround time of the vessel. Motivated by the observation that different ports are of nonuniform fee for each container shift, we propose a mixed integer programming (MIP) model for the problem to produce an optimal stowage planning with minimum total shifting fee in this work. Moreover, as the considered problem is NP-hard due to the NP-hardness of its counterpart with uniform unit shifting fee, we propose an improved genetic algorithm to solve the problem. The efficiency of the proposed algorithm is demonstrated via numerical experiments.

show abstract

Container sequencing for quay cranes with internal reshuffles

Cited by 59 publications

References 24 publications

A survey of berth allocation and quay crane scheduling problems in container terminals

A survey of berth allocation and quay crane scheduling problems in container terminals

Sea Container Terminals: New Technologies, OR Models, and Emerging Research Areas

Stowage Planning in Multiple Ports with Shifting Fee Minimization

Contact Info

Product

Resources

About