Scheduling cranes at an indented berth

Beens, Marie-Anne; Ursavas, Evrim

doi:10.1016/j.ejor.2016.02.038

Cited by 15 publications

(11 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The model (1) -(9) for the BA is very weak since it is based on the big-M constraints (4) and (5). As it is well-known such constraints provide poor linear relaxation lower bounds.…”

Section: A Discretized Reformulation For the Bamentioning

confidence: 99%

See 1 more Smart Citation

MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem

Agra

Oliveira

2018

European Journal of Operational Research

110

View full text Add to dashboard Cite

In this paper we consider an integrated berth allocation and quay crane assignment and scheduling problem motivated by a real case where a heterogeneous set of cranes is considered. A first mathematical model based on the relative position formulation (RPF) for the berth allocation aspects is presented. Then, a new model is introduced to avoid the big-M constraints included in the RPF. This model results from a discretization of the time and space variables. For the new discretized model several enhancements, such as valid inequalities, are introduced. In order to derive good feasible solutions, a rolling horizon heuristic (RHH) is presented. A branch and cut approach that uses the enhanced discretized model and incorporates the upper bounds provided by the RHH solution is proposed. Computational tests are reported to show (i) the quality of the linear relaxation of the enhanced models; (ii) the effectiveness of the exact approach to solve to optimality a set of real instances; and (iii) the scalability of the RHH based on the enhanced mathematical model which is able to provide good feasible solutions for large size instances.

show abstract

“…The model (1) -(9) for the BA is very weak since it is based on the big-M constraints (4) and (5). As it is well-known such constraints provide poor linear relaxation lower bounds.…”

Section: A Discretized Reformulation For the Bamentioning

confidence: 99%

“…Other physical aspects, such as the proximity to the storage yard, the structure of the berth, may also influence berth allocation. See for example [5]. This fact makes the BACASP that results from the integration of both subproblems (BAP and QCASP) even more relevant than in the case of homogeneous cranes.…”

Section: Introductionmentioning

confidence: 99%

MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem

Agra

Oliveira

2018

European Journal of Operational Research

110

View full text Add to dashboard Cite

show abstract

“…Using heuristics, they solve instances with up to 40 jobs and seven cranes (in the case of Chen et al, ). To the best of the author's knowledge, the only two exact algorithms in this context were proposed by Beens and Ursavas () and Boysen, Emde, and Fliedner (). Beens and Ursavas () investigate a fairly complex problem that considers many side‐constraints particular to their specific application, for example, yard congestion and workload safety.…”

Section: Applications and Literature Reviewmentioning

confidence: 99%

“…To the best of the author's knowledge, the only two exact algorithms in this context were proposed by Beens and Ursavas () and Boysen, Emde, and Fliedner (). Beens and Ursavas () investigate a fairly complex problem that considers many side‐constraints particular to their specific application, for example, yard congestion and workload safety. They subdivide the planning horizon into discrete intervals and aim to minimize the total travel distance of the cranes.…”

Section: Applications and Literature Reviewmentioning

confidence: 99%

Optimally scheduling interfering and non‐interfering cranes

Emde

2017

Naval Research Logistics

View full text Add to dashboard Cite

This article treats the problem of scheduling multiple cranes processing jobs along a line, where cranes are divided into different groups and only cranes in the same group can interfere with each other. Such crane scheduling problems occur, for example, at indented berths or in container yards where double rail‐mounted gantry cranes stack containers such that cranes of the same size can interfere with each other but small cranes can pass underneath larger ones. We propose a novel algorithm based on Benders decomposition to solve this problem to optimality. In a computational study, it is shown that this algorithm solves small and medium‐sized instances and even many large instances within a few seconds or minutes. Moreover, it improves several best known solutions from the literature with regard to the simpler problem version with only one crane group. We also look into whether investment in more complicated crane configurations with multiple crane groups is actually worthwhile.

show abstract

“…Lee et al (2008) studied a QCSP in which the task is defined on the basis of hold, they proved the considered QCSP is NP-complete in nature, and proposed a genetic algorithm to obtain sub-optimal solution. Beens & Ursavas (2016) investigated a QCSP at indented berth structure in a container terminal and solved the problem using the branch and price method.…”

Section: Quay Crane Scheduling Problemmentioning

confidence: 99%

Models and solution algorithms for container terminal operations

Shi¹

View full text Add to dashboard Cite

Containerization technique greatly improves the efficiency of international cargo shipping. Container terminals, as the service gateways of hinterland transport and maritime transport, play a crucial role in the process of cargo transport. In presence of growing demand for containerized marine shipping and increasing sizes of container vessels, a swift service at container terminal is vital. To improve service productivity of a container terminal, one option is to increase the capacity of container terminal or purchase new facility. However, the obvious drawback of this option is the high investment cost involved, which discourages terminal operators from taking this option. In contrast, a more viable option is taking advantage of planning tools such as the planning of quay side operations or land side operations, which will not incur a significant amount of investment. In this thesis, we focus on developing more realistic models and efficient solution algorithms for these types of problems in optimizing container terminal. Integer programming is widely used in many application areas and plays a fundamental role in supporting managerial decisions or modeling hard to solve problem. Most of ocean shipping problems can be modeled as integer programming or mixed integer programming, such as cargo routing, fleet deployment, crane scheduling, stowage planning, etc. Different from linear programs which is solvable in polynomial time, integer programming problems are normally NP-hard. Many solution methods have been proposed by the previous studies, one of the well-known and successfully applied methodology is Benders decomposition. This method was mostly used for LP problems or MIP problems.

show abstract

Scheduling cranes at an indented berth

Abstract: Take-down policy If you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim.

Cited by 15 publications

References 16 publications

MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem

MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem

Optimally scheduling interfering and non‐interfering cranes

Models and solution algorithms for container terminal operations

Contact Info

Product

Resources

About