scholarly journals Optimizing Truck Visits to Container Terminals with Consideration of Multiple Drays of Individual Drivers

2018 ◽  
Vol 2018 ◽  
pp. 1-8 ◽  
Author(s):  
Raka Jovanovic
Keyword(s):  
Los Angeles ◽  
Programming Model ◽  
Container Terminal ◽  
Waiting Times ◽  
Working Hours ◽  
Truck Drivers ◽  
Container Terminals ◽  
Positive Effects ◽  
Problem Instances ◽  
Truck Appointment System

In this paper a new approach for designing a truck appointment system (TAS) at container terminals is proposed. While the vast majority of published research analyzes the TAS from the perspective of drayage companies and terminal operations, in this work this topic is centered around truck drivers. The objective of this approach is to show that it is possible to increase the satisfaction of drivers which will maintain the positive effects that the TAS provides to the port. To be more precise, the focus is on exploiting the fact that individual truck drivers perform multiple visits to the container terminal in a day. Based on this information, a scheduling problem is defined and the corresponding integer programming model is developed. The potential benefits of the proposed approach are evaluated for the ports of Los Angeles and the port of Seattle. This has been done by generating problem instances based on the distribution of the number of daily truck visits to the port, number of daily working hours of drivers, and distances (lengths) of individual dray moves for the corresponding ports. The results of the conducted computational experiments show that using the proposed approach can positively affect gate waiting times and truck driver satisfaction. Further, it is shown that this type of approach favors more experienced drivers, which has a potential to provide additional benefits to the port.

scholarly journals Truck Appointment System for Cooperation between the Transport Companies and the Terminal Operator at Container Terminals

2020 ◽  
Vol 11 (1) ◽  
pp. 168
Author(s):  
Hyeonu Im ◽  
Jiwon Yu ◽  
Chulung Lee
Keyword(s):  
Large Scale ◽  
Container Terminal ◽  
Container Terminals ◽  
The Past ◽  
Cooperation Model ◽  
Appointment System ◽  
New Form ◽  
Truck Appointment System ◽  
Import Container ◽  
Very High

Despite the number of sailings canceled in the past few months, as demand has increased, the utilization of ships has become very high, resulting in sudden peaks of activity at the import container terminals. Ship-to-ship operations and yard activity at the container terminals are at their peak and starting to affect land operations on truck arrivals and departures. In response, a Truck Appointment System (TAS) has been developed to mitigate truck congestion that occurs between the gate and the yard of the container terminal. The vehicle booking system is developed and operated in-house at large-scale container terminals, but efficiency is low due to frequent truck schedule changes by the transport companies (forwarders). In this paper, we propose a new form of TAS in which the transport companies and the terminal operator cooperate. Numerical experiments show that the efficiency of the cooperation model is better by comparing the case where the transport company (forwarder) and the terminal operator make their own decision and the case where they cooperate. The cooperation model shows higher efficiency as there are more competing transport companies (forwarders) and more segmented tasks a truck can reserve.

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.

Optimization of Container Terminal Unloading Operations Based Upon Multistage Flexible Flowshop Scheduling

2011 ◽  
Vol 97-98 ◽  
pp. 633-639 ◽  
Author(s):  
Erick Massami ◽  
Zhi Hong Jin
Keyword(s):  
Container Terminal ◽  
Optimization Procedure ◽  
Planning Horizon ◽  
Container Terminals ◽  
Flowshop Scheduling ◽  
Flexible Flowshop ◽  
Schedule Length ◽  
Problem Instances ◽  
Flowshop Scheduling Problem ◽  
Finite Planning Horizon

Modeling unloading operations at maritime container terminals has increasingly become crucial to container terminal planners. This paper presents the multistage flexible flowshop scheduling problem (MFFSP). The objective of the MFFSP is to determine a schedule that minimizes the schedule length for a given number of containers and handling equipment over a finite planning horizon. Since the MFFSP is NP-hard in the strong sense, metaheuristic solution method is employed. A global lower bound to measure the efficiency of the metaheuristic procedure is derived. The optimization procedure is based on Genetic Algorithm (GA) which is used to estimate the minimum schedule length for a number of problem instances. Computational experiments validate the developed MFFSP.

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

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.

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.

scholarly journals Simulation-Based Optimization for Yard Design at Mega Container Terminal under Uncertainty

2016 ◽  
Vol 2016 ◽  
pp. 1-13 ◽  
Author(s):  
Yong Zhou ◽  
Wenyuan Wang ◽  
Xiangqun Song ◽  
Zijian Guo
Keyword(s):  
Programming Model ◽  
Container Terminal ◽  
Cost Effective ◽  
Container Terminals ◽  
Design Solution ◽  
Simulation Based ◽  
Simulation Based Optimization ◽  
Uncertain Future ◽  
Reliable Design ◽  
Terminal Operations

The conventional approach of designing a container yard should be reexamined in the context of sustainable port development. Considering the uncertain future throughput, a simulation-based optimization framework is proposed to obtain a cost-effective and reliable design solution to the physical layout and equipment deployment strategy of the yard at a mega container terminal. In this framework, a two-stage stochastic programming model is presented aided with a simulation procedure of terminal operations. Finally, an application is given and the results show that the proposed integrated decision framework is effective and helpful for optimizing container yard design in the context of sustainable development of container terminals.

scholarly journals Migrating Birds Optimization for the Seaside Problems at Maritime Container Terminals

2015 ◽  
Vol 2015 ◽  
pp. 1-12 ◽  
Author(s):  
Eduardo Lalla-Ruiz ◽  
Christopher Expósito-Izquierdo ◽  
Jesica de Armas ◽  
Belén Melián-Batista ◽  
J. Marcos Moreno-Vega
Keyword(s):  
Container Terminal ◽  
Container Terminals ◽  
Berth Allocation Problem ◽  
Crane Scheduling ◽  
Migrating Birds Optimization ◽  
Nature Inspired Algorithm ◽  
Problem Instances ◽  
Maritime Container Terminal ◽  
Time Required ◽  
Migrating Birds

Sea freight transportation involves moving huge amounts of freights among maritime locations widely spaced by means of container vessels. The time required to serve container vessels is the most relevant indicator when assessing the competitiveness of a maritime container terminal. In this paper, two main logistic problems stemming from the transshipment of containers in the seaside of a maritime container terminal are addressed, namely, the Berth Allocation Problem aimed at allocating and scheduling incoming vessels into berthing positions along the quay and the Quay Crane Scheduling Problem, whose objective is to schedule the loading and unloading tasks associated with a container vessel. For solving them, two Migrating Birds Optimization (MBO) approaches are proposed. The MBO is a recently proposed nature-inspired algorithm based on theV-formation flight of migrating birds. In this algorithm, a set of solutions of the problem at hand, called birds, cooperate among themselves during the search process by sharing information within aV-line formation. The computational experiments performed over well-known problem instances reported in the literature show that the performance of our proposed MBO approaches is highly competitive and presents a better performance in terms of running time than the best approximate approach proposed in the literature.

scholarly journals Reshuffle minimisation to improve storage yard operations efficiency

2021 ◽  
Vol 15 ◽  
pp. 174830262199401
Author(s):  
Hammed Bisira ◽  
Abdellah Salhi
Keyword(s):  
Integer Programming ◽  
Programming Model ◽  
Heuristic Approach ◽  
Container Terminals ◽  
Exact Method ◽  
Computational Results ◽  
Binary Integer Programming ◽  
Integer Programming Model ◽  
Compatibility Test ◽  
Storage Area

There are many ways to measure the efficiency of the storage area management in container terminals. These include minimising the need for container reshuffle especially at the yard level. In this paper, we consider the container reshuffle problem for stacking and retrieving containers. The problem was represented as a binary integer programming model and solved exactly. However, the exact method was not able to return results for large instances. We therefore considered a heuristic approach. A number of heuristics were implemented and compared on static and dynamic reshuffle problems including four new heuristics introduced here. Since heuristics are known to be instance dependent, we proposed a compatibility test to evaluate how well they work when combined to solve a reshuffle problem. Computational results of our methods on realistic instances are reported to be competitive and satisfactory.

Sign in / Sign up

Export Citation Format

Share Document