THE EVALUATION OF COMPETITIVENESS ON COST ADVANTAGE OF REGIONAL HUB PORT: THE CASE STUDY OF TRANS-PACIFIC ROUTE AGAINST KAOHSIUNG PORT

2021 ◽  
Vol 161 (A4) ◽  
Author(s):  
T Y Tsai ◽  
H H Tai
Keyword(s):  
Deep Water ◽  
Strategic Alliances ◽  
Container Terminals ◽  
Operating Efficiency ◽  
External Threats ◽  
Shipping Cost ◽  
Container Ports ◽  
Terminal Operations ◽  
Trunk Routes ◽  
Port Of Kaohsiung

Numerous conventional container ports in East Asia are evolving from intercontinental into regional hub ports. This study adopted the Port of Kaohsiung as an example of competition with neighboring ports. The results of this study demonstrated that the Port of Kaohsiung is still a competitive docking port on trans-Pacific trunk routes for North America, despite facing external threats (e.g., upsizing of ships, lack of new deep-water terminals, and new strategic alliances affecting terminal operations), overall shipping cost considerations (e.g., container volume, different ship sizes, and port selection), and increasingly intense competition with neighboring ports. Under such circumstances, the Port of Kaohsiung must keep pace with container ship upsizing, sufficiently increase deep-water terminal capacity, and improve its existing container terminals’ operating efficiency to attract route deployment and larger container ships and thereby maintain its current advantages and position as a regional hub port.

The Evaluation of Competitiveness on Cost Advantage of Regional Hub Port: The Case Study of Trans-Pacific Route Against Kaohsiung Port

2019 ◽  
Vol 161 (A4) ◽  
Keyword(s):  
Deep Water ◽  
Strategic Alliances ◽  
Container Terminals ◽  
Operating Efficiency ◽  
External Threats ◽  
Shipping Cost ◽  
Container Ports ◽  
Terminal Operations ◽  
Trunk Routes ◽  
Port Of Kaohsiung

Numerous conventional container ports in East Asia are evolving from intercontinental into regional hub ports. This study adopted the Port of Kaohsiung as an example of competition with neighboring ports. The results of this study demonstrated that the Port of Kaohsiung is still a competitive docking port on trans-Pacific trunk routes for North America, despite facing external threats (e.g., upsizing of ships, lack of new deep-water terminals, and new strategic alliances affecting terminal operations), overall shipping cost considerations (e.g., container volume, different ship sizes, and port selection), and increasingly intense competition with neighboring ports. Under such circumstances, the Port of Kaohsiung must keep pace with container ship upsizing, sufficiently increase deep-water terminal capacity, and improve its existing container terminals’ operating efficiency to attract route deployment and larger container ships and thereby maintain its current advantages and position as a regional hub port.

scholarly journals An Investigation into Switching Vessel Sizes for Efficient Container Terminal Operations: A Case Study of Kaohsiung Port

2021 ◽  
Vol 163 (A1) ◽  
pp. 101-118
Author(s):  
En-Wei Chang ◽  
Hui-Huang Tai
Keyword(s):  
Deep Water ◽  
Large Scale ◽  
Container Terminal ◽  
Analytic Network Process ◽  
Container Terminals ◽  
Operating Efficiency ◽  
Container Terminal Operations ◽  
Port Area ◽  
Network Process ◽  
Terminal Operations

Given the continued growth in the size of container ships, major hub ports around the world have carried out large-scale upgrades of their port facilities to attract shipping companies to choose their ports, thereby enhancing the competitiveness of their ports. This study takes Kaohsiung Port as an example and uses the Decision Analytic Network Process (DANP) method to investigate container terminal operations by switching container terminal operations to appropriate new locations. The results of the study indicate that, despite the external issues (such as a lack of deep-water terminals and hinterland in the port area, the upsizing of ships, and new strategic shipping alliances), Kaohsiung Port authority must accelerate the upgrade of its container terminals, integrate its port resources to build deep-water berth facilities with highefficient container operating system, and improve the operating efficiency of its existing terminals, as a means to maintain the status of Kaohsiung Port as a regional centre.

scholarly journals Optimising truck arrival management and number of service gates at container terminals

2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Chu Cong Minh ◽  
Nguyen Van Noi
Keyword(s):  
Time Slot ◽  
The United States ◽  
Container Terminals ◽  
Queuing Model ◽  
Content Type ◽  
Total Cost ◽  
Container Ports ◽  
Appointment System ◽  
Optimisation Model ◽  
Truck Appointment System

PurposeTruck appointment systems have been applied in critical container ports in the United States due to their potential to improve handling operations. This paper aims to develop a truck appointment system to optimise the total cost experiencing at the entrance of container terminals by managing truck arrivals and the number of service gates satisfying a given level of service.Design/methodology/approachThe approximation of Mt/G/nt queuing model is applied and integrated into a cost optimisation model to identify (1) the number of arrival trucks allowed at each time slot and (2) the number of service gates operating at each time slot that ensure the average waiting time is less than a designated time threshold. The optimisation model is solved by the Genetic Algorithm and tested with a case study. Its effectiveness is identified by comparing the model's outcomes with observed data and other recent studies.FindingsThe results indicate that the developed truck appointment system can provide more than threefold and twofold reductions of the total cost experiencing at the terminal entrance compared to the actual data and results from previous research, respectively.Originality/valueThe proposed approach provides applicably coordinated truck plans and operating service gates efficiently to decrease congestion, emission and expenses.

Scheduling of Yard Truck Considering Loading and Unloading Simultaneously in an Underground Container Logistics System

2021 ◽  
pp. 036119812110478
Author(s):  
Yinping Gao ◽  
Daofang Chang ◽  
Jun Yuan ◽  
Chengji Liang
Keyword(s):  
Genetic Algorithm ◽  
Container Terminals ◽  
Mixed Integer ◽  
Operating Efficiency ◽  
Adaptive Genetic Algorithm ◽  
Integer Programming Problem ◽  
Logistics System ◽  
Container Logistics ◽  
Loading And Unloading ◽  
Mixed Integer Programming Problem

With the rapid growth of containers and scarce of land, the underground container logistics system (UCLS) presents a logical alternative for container terminals to better protect the environment and relieve traffic pressure. The operating efficiency of container terminals is one of the competitive edges over other terminals, which requires UCLS to be well integrated with the handling process of the storage yard. In UCLS, yard trucks (YTs) serve different handling points dynamically instead of one fixed handling point, and yard cranes (YCs) perform loading and unloading simultaneously. To minimize the total time of handling all containers in UCLS, the mixed integer programming problem is described and solved using an adaptive genetic algorithm (AGA). The convergence speed and accuracy of AGA are demonstrated by comparison with conventional genetic algorithm (GA). Additionally, AGA and CPLEX are compared with different scale cases. Experimental results show that the proposed algorithm is superior to CPLEX in resulted solutions and calculation time. A sensitivity analysis is provided to obtain reasonable numbers of YTs for scheduling between handling points and the storage yard in UCLS.

Priority-based speed control strategy for automated guided vehicle path planning in automated container terminals

2020 ◽  
Vol 42 (16) ◽  
pp. 3079-3090 ◽  
Author(s):  
Meisu Zhong ◽  
Yongsheng Yang ◽  
Shu Sun ◽  
Yamin Zhou ◽  
Octavian Postolache ◽  
...  
Keyword(s):  
Path Planning ◽  
Control Strategy ◽  
Search Algorithm ◽  
Waiting Times ◽  
Optimal Path ◽  
Speed Control ◽  
Container Terminals ◽  
Automated Guided Vehicles ◽  
Operating Efficiency ◽  
Continuous Increase

With the continuous increase in labour costs and the demands of the supply chain, improving the efficiency of automated container terminals has been a key factor in the development of ports. Automated guided vehicles (AGVs) are the main means of horizontal transport in such terminals, and problems in relation to their use such as vehicle conflict, congestion and waiting times have become very serious, greatly reducing the operating efficiency of the terminals. In this article, we model the minimum driving distance of AGVs that transport containers between quay cranes (QCs) and yard cranes (YCs). AGVs are able to choose the optimal path from pre-planned paths by testing the overlap rate and the conflict time. To achieve conflict-free AGV path planning, a priority-based speed control strategy is used in conjunction with the Dijkstra depth-first search algorithm to solve the model. The simulation experiments show that this model can effectively reduce the probability of AGVs coming into conflict, reduce the time QCs and YCs have to wait for their next task and improve the operational efficiency of AGV horizontal transportation in automated container terminals.

State of the Practice of Information Technology at Marine Container Ports

1996 ◽  
Vol 1522 (1) ◽  
pp. 87-93 ◽  
Author(s):  
José Holguín-Veras ◽  
C. Michael Walton
Keyword(s):  
Information Technology ◽  
Container Terminal ◽  
General Information ◽  
The State ◽  
Container Terminals ◽  
Information Process ◽  
The Future ◽  
Container Ports ◽  
Electronic Tags ◽  
Current Practices

A glimpse into the state of the practice of information technology at marine container ports is provided. First, network representation is used to characterize the information process that takes place at marine container terminals. These network representations were used as a framework to analyze a survey on the state of the practice of information technology. The survey targeted a selected group of U.S. container terminals, which provided information on current practices. The first section of the survey, General Information, gathered information about the general characteristics of the terminal. The second section, Internal Activities of the Container Terminal, gathered information about the performance of the most important internal activities. The third section, Interactions Among the Parties Involved, focused on the interactions that take place among the different agents associated with either importing or exporting containers. The fourth section, About the Future, gathered the respondents' perceptions about the future of information technology. The information gathered was used to characterize current practices and to assess the level of market penetration of advanced devices such as electronic tags.

Approximation algorithm for uniform quay crane scheduling at container ports

2016 ◽  
Vol 08 (02) ◽  
pp. 1650018 ◽  
Author(s):  
Ming Liu ◽  
Feifeng Zheng ◽  
Yinfeng Xu ◽  
Chengbin Chu
Keyword(s):  
Approximation Algorithm ◽  
Container Terminals ◽  
Container Port ◽  
Quay Crane Scheduling ◽  
Processing Efficiency ◽  
Crane Scheduling ◽  
Quay Cranes ◽  
Container Ports ◽  
Loading And Unloading ◽  
Turn Around Time

At a container port, container vessels are served by quay cranes for loading and unloading containers. Each vessel is typically split into bays from head to tail where containers are stored. Parallel quay cranes can process different bays simultaneously, and their processing efficiency significantly affects the turn-around time of a container vessel. Sharing a single traveling rail, the quay cranes cannot crossover each other, and this phenomenon is referred as the non-crossing constraint. In addition, the quay cranes may have different processing speeds due to gradual equipment updates. Inspired by updating activities of cranes in modern container terminals, this paper studies a scheduling problem with two uniform quay cranes, aiming at minimizing the turn-around time of a vessel, i.e., the makespan. We mainly develop an integrated approximation algorithm which is [Formula: see text]-approximation, where the two quay cranes are of processing speeds 1 and [Formula: see text], respectively.

scholarly journals Integrating truck arrival management into tactical operation planning at container terminals

2013 ◽  
Vol 20 (Special-Issue) ◽  
pp. 32-46 ◽  
Author(s):  
Zhong-Zhen Yang ◽  
Gang Chen ◽  
Dong-Ping Song
Keyword(s):  
Integrated Model ◽  
Container Terminals ◽  
Computational Time ◽  
Planning Model ◽  
Sequential Model ◽  
Terminal Performance ◽  
Planning Models ◽  
Gate Congestion ◽  
Terminal Operations ◽  
Truck Arrival

Abstract Truck arrival management (TAM) has been recognized as an effective solution to alleviate the gate congestion at container terminals. To further utilize TAM in improving the overall terminal performance, this study integrates TAM with the other terminal operations at a tactical level. An integrated planning model and a sequential planning model are presented to coordinate the major terminal planning activities, including quayside berth allocation, yard storage space allocation and TAM. A heuristic-based genetic algorithm is developed to solve the models. A range of numerical examinations are performed to compare two planning models. The result shows that: the integrated model can improve the terminal performance significantly from the sequential model alone, particularly when the gate capacity and the yard capacity are relatively low; whereas the sequential model is more efficient than the integrated model in terms of computational time.

Benchmarking the operating efficiency of Asia container ports

2010 ◽  
Vol 203 (3) ◽  
pp. 706-713 ◽  
Author(s):  
Shiu-Wan Hung ◽  
Wen-Min Lu ◽  
Tung-Pao Wang
Keyword(s):  
Operating Efficiency ◽  
Container Ports

scholarly journals An Improved Shuffled Frog Leaping Algorithm for Multiload AGV Dispatching in Automated Container Terminals

2020 ◽  
Vol 2020 ◽  
pp. 1-13
Author(s):  
Xiaoyang Ma ◽  
Yongming Bian ◽  
Fei Gao
Keyword(s):  
Mathematical Model ◽  
Container Terminals ◽  
Operating Efficiency ◽  
Container Transportation ◽  
Shuffled Frog Leaping Algorithm ◽  
Exploration Process ◽  
Single Carrier ◽  
Agv Dispatching ◽  
Shuffled Frog Leaping ◽  
Improved Model

Multiload AGVs, which can carry more than one container at a time, are widely used in automated container terminals. The dispatching decisions for multiload AGVs serving in automated container terminals on the target of minimum travel distance are significant in the process of container transportation in terms of improving operating efficiency. Previous work usually focused on AGVs working in a single-carrier mode, which was not only inconsistent with actual circumstances but also a waste of resources. In this paper, we establish a new mathematical model to describe multiload AGVs operating in automated container terminals, which is closer to the actual situation in real terminals. Based on this improved model, we propose a priority rule-based algorithm, termed as shuffled frog leaping algorithm with a mutant process (SFLAMUT), which can increase the diversity of the population and improve the convergence rate. Experiments were carried out based on data generated randomly according to the working properties of container terminals, and it is observed that the proposed SFLAMUT presents an effective and efficient exploration process and yields promising results in solving the proposed mathematical model.

Sign in / Sign up

Export Citation Format

Share Document