Robust berth scheduling at marine container terminals via hierarchical optimization

Golias, Mihalis M.; Portal, Isabel; Konur, Dinçer; Kaisar, Evangelos I.; Kolomvos, Georgios

doi:10.1016/j.cor.2013.07.018

Cited by 93 publications

(45 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Wang et al (2014) described the liner ship route scheduling problem and determined the arrival and departure times at each port in a given time window. Golias et al (2014) addressed the robust berth scheduling and used a genetic algorithm based heuristic to minimize the average and range of total operation time required to serve all ships in a port.…”

Section: Related Workmentioning

confidence: 99%

An integrated decision support system for berth and ship unloader allocation in bulk material handling port

Pratap

Nayak

Kumar

et al. 2017

Computers & Industrial Engineering

View full text Add to dashboard Cite

Berth allocation and material handling problems in ports are generally solved independently. This article provides a framework for aligning allocation decisions of berth and ship un-loader in an integrative manner. The ultimate goal of these decisions is to minimize the waiting time, operating time and ships priority deviation. As the sojourn time of a ship in port is costly, and given the scale and the complexity of the problem, a Decision Support System (DSS) is developed for the port authority. Two different approaches have been considered in this paper: 1) Solving the problem sequentially by decomposing the problem into two sub-problems-the berth allocation and the dynamic allocation of ship un-loaders in different berths 2) solving the problem by integrating berth allocation and dynamic allocation problem. Controlled Elitist Non -dominated Sorting Genetic Algorithm and Chemical Reaction Optimization are proposed in designing the DSS.Computational experiments are conducted on information provided from an Indian port. Results show that integrating berth and ship un-loader allocation achieves significant cost savings by considerably reducing the ship sojourn time in port.

show abstract

Section: Related Workmentioning

confidence: 99%

An integrated decision support system for berth and ship unloader allocation in bulk material handling port

Pratap

Nayak

Kumar

et al. 2017

Computers & Industrial Engineering

View full text Add to dashboard Cite

show abstract

“…Kim et al [22] established a mixed integer linear programming model to study continuous berth allocation problem and used simulated annealing algorithm and LINDO for solving. Mihalis Golias and Isabel Portal l [23] studied robustness scheduling strategy which aimed at reducing average vessel service time and overall service time duration provided by the terminal, defined quadratic optimization problem, and proposed a heuristic algorithm to solve this problem, but the overall description was vague. Yusin Lee et al [24] believed that a terminal, which is a continuous space, could be optimized through neighborhood searching algorithm with reference to FCFS, vessel unoccupied distance, and possibility of vessel shifting in aspect of service strategy.…”

Section: State Of the Artmentioning

confidence: 99%

Study of Continuous Berth Allocation Algorithm Based on Fairness Maximization

Wang¹,

Xu²,

You-fang³

et al. 2017

JESTR

View full text Add to dashboard Cite

Given the minimum total time of vessel in port or minimum penalty cost as a functional objective, present berth-quay crane integrated scheduling model lacks fairness index of the service provided to vessels by the terminal. This phenomenon can affect the operating efficiency and the reasonable scheduling between terminal and vessel. This study proposed a multi-objective fair and continuous berth allocation algorithm, which considered vessel penalty cost, vessel waiting, and quay crane assignment. Specifically, The proposed algorithm considered the fairness index on berth allocation and designs the following three-stage procedure that maximizes service fairness: (1) computation of initial temperature, (2) neighbourhood searching to arrange for vessel berthing sequence and berthing location, and (3) assignment and adjustment of quay cranes to reach target low temperature. The proposed continuous berth allocation algorithm based on fairness maximization was comparatively verified with neighbourhood searching algorithm by combining different parameter strategies. Results show that the continuous berth allocation algorithm based on fairness maximization obtains the optimal solution within the time six times faster than the neighbourhood searching algorithm. Relevant conclusions provide a theoretical foundation for fairness study of the service in providing to vessels by the terminal.

show abstract

“…TRABAJO RELACIONADO Las operaciones portuarias son de alta complejidad. La literatura contiene diversos esfuerzos dedicados a abordar, por ejemplo, la asignación de buques de carga a muelles de atraque, más conocido como Berth Allocation Problem [2][3][4] [5], o la optimización de operaciones de camiones en patios de acopio de carga dentro de puertos marítimos conocido como Truck Allocation Problem [6][7][8] [9]. Sin embargo, en nuestro conocimiento, el YAP es un problema poco estudiado, existiendo escasa literatura relacionada.…”

Section: Introductionunclassified

A constructive algorithm for Yard Allocation Problem

Ruiz

Cubillos

Cabrera‐Paniagua

et al. 2015

2015 CHILEAN Conference on Electrical, Electronics Engineering, Information and Communication Technologies (CHILECON)

View full text Add to dashboard Cite

Resumen-Yard Allocation Problem (YAP) is a frequently problem observed in port logistic operations, and consists in a temporary assignment of cargo containers, both export and import, to blocks storage located in the operation zone of seaports. The principal objective of YAP resolution is to improve the operations efficiency both terminal port as shipping companies that use the seaport, which allow to decrease operational cost and increasing the global efficiency. In this sense, this work proposes to solve the YAP using a constructive algorithm based in restrictions for each container. Official data of Arica Seaport -Chile were used for defining an experimental scenario, which allowed obtaining promising results. The constructive algorithm represents a novel approach because allows getting solutions in a simple and fast way, while satisfying the existing set of constrains associated with the general operation model.

show abstract

Robust berth scheduling at marine container terminals via hierarchical optimization

Cited by 93 publications

References 10 publications

An integrated decision support system for berth and ship unloader allocation in bulk material handling port

An integrated decision support system for berth and ship unloader allocation in bulk material handling port

Study of Continuous Berth Allocation Algorithm Based on Fairness Maximization

A constructive algorithm for Yard Allocation Problem

Contact Info

Product

Resources

About