scholarly journals Rescheduling Strategy for Berth Planning in Container Terminals: An Empirical Study from Korea

2021 ◽  
Vol 9 (5) ◽  
pp. 527
Author(s):  
Armi Kim ◽  
Hyun-Ji Park ◽  
Jin-Hyoung Park ◽  
Sung-Won Cho
Keyword(s):  
Mixed Integer Linear Programming ◽  
Arrival Time ◽  
Programming Model ◽  
Container Terminal ◽  
Container Terminals ◽  
Mixed Integer ◽  
Berth Allocation ◽  
Trade Volume ◽  
Penalty Costs ◽  
Proposed Model

The rapid increase in international trade volume has caused frequent fluctuation of the vessels’ arrival time in container terminals. In order to solve this problem, this study proposes a methodology for rescheduling berth and quay cranes caused by updated information on the arrival time of vessels. A mixed-integer linear programming model was formulated for the berth allocation and crane assignment problem, and we solved the problem using a rolling-horizon approach. Numerical experiments were conducted under three scenarios with empirical data from a container terminal located in Busan, Korea. The experiments revealed that the proposed model reduces penalty costs and overall delayed departure time compared to the results of the terminal planner.

Joint Deployment of Quay Cranes and Yard Cranes in Container Terminals at a Tactical Level

2018 ◽  
Vol 2672 (9) ◽  
pp. 35-46
Author(s):  
Lingxiao Wu ◽  
Shuaian Wang
Keyword(s):  
Integer Programming ◽  
Mixed Integer Programming ◽  
Programming Model ◽  
Container Terminal ◽  
Turnaround Time ◽  
Container Terminals ◽  
Mixed Integer ◽  
Sequential Method ◽  
Quay Cranes ◽  
Proposed Model

This paper discusses tactical joint quay crane (QC) and yard crane (YC) deployment in container terminals. The deployments of QCs and YCs are critical for the efficiency of container terminals. Although they are closely intertwined, the deployments of QCs and YCs are usually sequential. This paper proposes a mixed-integer programming model for the joint deployment of QCs and YCs in container terminals. The objective of the model is to minimize the weighted vessel turnaround time and the weighted delayed workload for external truck service in yard blocks, both of great importance for a container terminal but rarely considered together in the literature. This paper proves that the studied problem is NP-hard in the strong sense. Case studies demonstrate that the proposed model can obtain better solutions than the sequential method. This paper also investigates the most effective combinations of QCs and YCs for a container terminal at various demand levels.

scholarly journals Allocation and Scheduling of Handling Resources in the Railway Container Terminal Based on Crossing Crane Area

2021 ◽  
Vol 13 (3) ◽  
pp. 1190
Author(s):  
Gang Ren ◽  
Xiaohan Wang ◽  
Jiaxin Cai ◽  
Shujuan Guo
Keyword(s):  
Programming Model ◽  
Container Terminal ◽  
Simultaneous Optimization ◽  
Mixed Integer ◽  
Gantry Crane ◽  
Optimization Scheme ◽  
Long Distance ◽  
Proposed Model ◽  
Hybrid Heuristic Algorithm ◽  
Searching Ability

The integrated allocation and scheduling of handling resources are crucial problems in the railway container terminal (RCT). We investigate the integrated optimization problem for handling resources of the crane area, dual-gantry crane (GC), and internal trucks (ITs). A creative handling scheme is proposed to reduce the long-distance, full-loaded movement of GCs by making use of the advantages of ITs. Based on this scheme, we propose a flexible crossing crane area to balance the workload of dual-GC. Decomposing the integrated problem into four sub-problems, a multi-objective mixed-integer programming model (MIP) is developed. By analyzing the characteristic of the integrated problem, a three-layer hybrid heuristic algorithm (TLHHA) incorporating heuristic rule (HR), elite co-evolution genetic algorithm (ECEGA), greedy rule (GR), and simulated annealing (SA) is designed for solving the problem. Numerical experiments were conducted to verify the effectiveness of the proposed model and algorithm. The results show that the proposed algorithm has excellent searching ability, and the simultaneous optimization scheme could ensure the requirements for efficiency, effectiveness, and energy-saving, as well as the balance rate of dual-GC.

A New Dispatching Model of Automated Lifting Vehicles in Automated Container Terminal with Limited Buffer Space

2013 ◽  
Vol 446-447 ◽  
pp. 1334-1339 ◽  
Author(s):  
Seyed Hamidreza Sadeghian ◽  
Mohd Khairol Anuar Bin Mohd Ariffin ◽  
Say Hong Tang ◽  
Napsiah Binti Ismail
Keyword(s):  
Programming Model ◽  
Container Terminal ◽  
Container Terminals ◽  
Mixed Integer ◽  
Transport Systems ◽  
Buffer Space ◽  
Integrated Scheduling ◽  
Quay Cranes ◽  
Automated Lifting Vehicle ◽  
Large Container

Automation of the processes at the quays of the world's large container ports is one of the answers to the required ever-increasing transshipment volumes within the same timeframe. For such purpose, using new generation of vehicles is unavoidable. One of the automatic vehicles that can be used in container terminals is Automated Lifting Vehicle (ALV). Integrated scheduling of handling equipments with quay cranes can increase the efficiency of automated transport systems in container. In this paper, an integrated scheduling of quay cranes and automated lifting vehicles with limited buffer space is formulated as a mixed integer linear programming model. This model minimizes the makespan of all the loading and unloading tasks for a pre-defined set of cranes in a scheduling problem.

NONLINEAR MATHEMATICAL PROGRAMMING FOR OPTIMAL MANAGEMENT OF CONTAINER TERMINALS

2009 ◽  
Vol 23 (27) ◽  
pp. 5333-5342 ◽  
Author(s):  
S. R. SEYEDALIZADEH GANJI ◽  
H. JAVANSHIR ◽  
F. VASEGHI
Keyword(s):  
Container Terminals ◽  
Mixed Integer ◽  
Berth Allocation ◽  
Berth Allocation Problem ◽  
Prior Model ◽  
Proposed Model ◽  
Integer Nonlinear Programming ◽  
Nonlinear Mathematical Programming ◽  
S Model ◽  
Berth Scheduling

Berth scheduling is the process of determining the time and position at which each arriving ship will berth. This paper attempts to minimize the serving time to ships, after introducing a proposed mathematical model, considers the berth allocation problem in form of mixed integer nonlinear programming. Then, to credit the proposed model, the results of Imai et al.'s model have been used. The results indicate that because the number of nonlinear variables in the proposed model is less than prior model, so by using the proposed model, we can obtain the results of model in less time rather than prior model.

Integrated Scheduling of Rail-Mounted Gantry Cranes, Internal Trucks and Reach Stackers in Railway Operation Area of Container Terminal

2018 ◽  
Vol 2672 (9) ◽  
pp. 47-58 ◽  
Author(s):  
Baicheng Yan ◽  
Xiaoning Zhu ◽  
Li Wang ◽  
Yimei Chang
Keyword(s):  
Programming Model ◽  
Container Terminal ◽  
Container Terminals ◽  
Mixed Integer ◽  
Integrated Scheduling ◽  
Equipment Configuration ◽  
Key Indicators ◽  
Railway Operation ◽  
Gantry Cranes ◽  
Selection Of

In this paper, the integrated scheduling of handling equipment at the railway handling area in container terminals is studied, where rail-mounted gantry cranes, internal trucks, and reach stackers are deployed. In the course of the handling operation, loading and unloading containers are handled simultaneously. The handling process is first studied and some scheduling schemes are put forward. Based on the analysis, the problem is formulated as a mixed-integer programming model, with the objectives of minimizing the makespan and the total waiting time of all equipment. Then, to solve the problem, a genetic algorithm is employed, where the first available machine rule is applied in the selection of trucks and reach stackers. Sets of numerical experiments are conducted to verify the effect of the proposed algorithm. Based on the results of experiments, some key indicators are calculated and the effects of different equipment configuration schemes are studied.

A Mixed-Integer Linear Programming Model of Closed Loop Supply Chain Network for Manufacturing System

2018 ◽  
Vol 35 ◽  
pp. 198-207 ◽  
Author(s):  
S. Nallusamy ◽  
K. Balakannan ◽  
P.S. Chakraborty ◽  
Gautam Majumdar
Keyword(s):  
Linear Programming ◽  
Supply Chain ◽  
Mixed Integer Linear Programming ◽  
Closed Loop ◽  
Programming Model ◽  
Mixed Integer ◽  
Order Quantity ◽  
Integer Linear Programming Model ◽  
Proposed Model ◽  
Fixed Order

In the present scheme of things, in a manufacturing industry inventory is pitched as one of the significant resources that require to be handled effectively. The aim of this research article is to develop a mixed-integer linear programming model to configure the closed loop supply chain (CLSC) network and that could be optimized for maximizing the profit by determining the fixed order quantity inventory policy in various sites at multiple periods. The objective is to maximize the profit through CLSC by determining the optimal inventory of product and part mix during multiple periods. In onward supply chain, a standard inventory policy is followed when the product moves from manufacturer to end user, but it is very difficult to manage the inventory in the reverse supply chain of the product with the same standard policy. The proposed model examines the standard policy of fixed order quantity by considering three major types of return-recovery pair such as, commercial returns, end-of-use returns, end-of-life returns and their inventory positioning at multiple periods. Raw material supplier, manufacturer, distributer, retailer, customers and for major returns-collection sites like repair site, disassembly site, recycling site and disposal site were included in the network to develop this CLSC network model. The proposed model to configure the CLSC network has been solved by using IBM ILOG CPLEX OPL studio and the results of the model were analysed with numerical investigations followed by sensitivity analysis.

scholarly journals Adaptive Autotuning Mathematical Approaches for Integrated Optimization of Automated Container Terminal

2019 ◽  
Vol 2019 ◽  
pp. 1-14 ◽  
Author(s):  
Meisu Zhong ◽  
Yongsheng Yang ◽  
Yamin Zhou ◽  
Octavian Postolache
Keyword(s):  
Programming Model ◽  
Container Terminal ◽  
Operation Mode ◽  
Pso Algorithm ◽  
Container Terminals ◽  
Automated Guided Vehicles ◽  
Mixed Integer ◽  
Integrated Scheduling ◽  
Loading And Unloading ◽  
Unloading Time

With the development of automated container terminals (ACTs), reducing the loading and unloading time of operation and improving the working efficiency and service level have become the key point. Taking into account the actual operation mode of loading and unloading in ACTs, a mixed integer programming model is adopted in this study to minimize the loading and unloading time of ships, which can optimize the integrated scheduling of the gantry cranes (QCs), automated guided vehicles (AGVs), and automated rail-mounted gantries (ARMGs) in automated terminals. Various basic metaheuristic and improved hybrid algorithms were developed to optimize the model, proving the effectiveness of the model to obtain an optimized scheduling scheme by numerical experiments and comparing the different performances of algorithms. The results show that the hybrid GA-PSO algorithm with adaptive autotuning approaches by fuzzy control is superior to other algorithms in terms of solution time and quality, which can effectively solve the problem of integrated scheduling of automated container terminals to improve efficiency.

Quay crane scheduling for multiple hatches vessel considering double-cycling strategy

2019 ◽  
Vol 120 (2) ◽  
pp. 253-264 ◽  
Author(s):  
Junliang He ◽  
Hang Yu ◽  
Caimao Tan ◽  
Wei Yan ◽  
Chao Jiang
Keyword(s):  
Programming Model ◽  
Container Terminal ◽  
Mixed Integer ◽  
Quay Crane Scheduling ◽  
Crane Scheduling ◽  
Content Type ◽  
Operation Efficiency ◽  
Double Cycling ◽  
Proposed Model ◽  
Operational Constraints

Purpose The development of mega container ships and operational pressures puts forward higher requirements on the operational ability of the container terminal. Accordingly, the purpose of this paper is to propose an effective method for quay crane (QC) scheduling of multiple hatches vessel considering double-cycling strategy to improve the operation efficiency and reduce the risk of delay. Design/methodology/approach A mixed integer programming model, which covers the main operational constraints in a container terminal, is formulated to solve the quay crane scheduling problem (QCSP) with a novel objective. Findings A case study is presented and a number of numerical experiments are conducted to validate the effectiveness of the proposed model. Meanwhile, management insights are proposed. The results demonstrate that the proposed method can efficiently solve QCSP in a container terminal, and an interesting finding is that reducing the stack layers on the vessel can improve the operation efficiency of QC. Originality/value A new mathematical model is proposed for QC scheduling at the operational level, which considers the constraints of double-cycling strategy, multiple hatches and hatch covers. The proposed model also provides methods to research the QC double-cycling problem considering the balance between energy cost and operation efficiency.

Sign in / Sign up

Export Citation Format

Share Document