scholarly journals Stowage Plan Based Slot Optimal Allocation in Rail-Water Container Terminal

2017 ◽  
Vol 2017 ◽  
pp. 1-10 ◽  
Author(s):  
Yanjing Li ◽  
Xiaoning Zhu ◽  
Li Wang ◽  
Xi Chen

To obtain an efficient and reasonable solution for slot allocation in rail-water container terminals, this paper develops storage optimal allocation model 1 to improve the yard space utilization, which is solved by a heuristic algorithm based on Tabu search. Model 2 is then built to reduce the relocation movements. A concept of fall-down problem in shunting operation plan is thus proposed to solve model 2. Models 1 and 2 are tested with numerical experiments. The results show that the yard space utilization increases by 50% approximately compared to the strategy of one train piling onto a fixed area called a subblock. Meanwhile the number of container relocation movements is less than five when using the fall-down problem strategy. Accordingly, the models and algorithms developed in this paper are effective to improve the yard space utilization and reduce the number of container relocation movements.

2019 ◽  
Vol 52 (5-6) ◽  
pp. 509-525 ◽  
Author(s):  
Yimei Chang ◽  
Xiaoning Zhu ◽  
Ali Haghani

In the past, most researchers focused on the storage space allocation problem or container block allocation problem in maritime container terminals, while few studied the container slot allocation problem in rail–water intermodal container terminals. Container slot allocation problem is proposed to reduce relocation operations of containers in railway container yards and improve the efficiency of rail–water intermodal container terminals. In this paper, a novel outbound container slot allocation model is introduced to reduce the rehandling operations, considering stowage plan, containers left from earlier planning periods and container departure time. A novel heuristic algorithm based on the rolling planning horizon approach is developed to solve the proposed problem effectively. Computational experiments are carried out to validate that the proposed model and algorithm are feasible and effective to enhance the storage effect. Meanwhile, some other experiments are conducted to verify that our approach is better than the regular allocation approach, which is a common method in marine and railway container terminals, and container weight is the most important influence factor when storing containers.


2021 ◽  
Vol 22 (2) ◽  
pp. 67-78
Author(s):  
Setyo Nugroho ◽  
Achmad Mustakim ◽  
Dwi Wahyu Baskara ◽  
Alwi Sina Khaqiqi

Perencanaan alokasi penumpukan petikemas memiliki pengaruh yang besar untuk meminimalkan waktu sandar kapal dan biaya operasional terminal. Model alokasi lapangan penumpukan bertujuan mengurangi jarak tempuh truk dalam kegiatan muat dan menyeimbangkan jumlah pada setiap blok. Alokasi lapangan penumpukan petikemas yang belum optimal di Terminal Petikemas Banjarmasin merupakan salah satu permasalahan yang harus diselesaikan. Dalam upaya penyelesaian permasalahan tersebut digunakan metode evaluasi dan optimasi dalam perencanaan alokasi lapangan penumpukan petikemas. Setalah mendapatkan hasil evaluasi dan optimasi, kemudian dilakukan simulasi untuk mengetahui waktu muat kapal. Dari hasil evaluasi dan optimasi di dapatkan pada Bulan Februari 2019, jarak tempuh truk dapat bekurang hingga 4% atau 539 km dari 13.941 km, selisih petikemas pada blok kapal sebesar 74% atau 4.863 box dari 6.546 box. Selain itu didapatkan selisih petikemas pada seluruh blok penumpukan sebesar 55% atau 2.452 box dari 4.446 box, penghematan waktu kegiatan muat sebesar 13% atau 4.749 menit dari 36.129 menit. Kemudian untuk  penghematan biaya bahan bakar keseluruhan dari truk, RTG, dan container crane sebesar 16% atau sebesar Rp 236.723.498 dari Rp 1.508.369.508. Dengan hasil optimalisasi ini pengelola pelabuhan dapat mengisi container Yard lebih banyak lagi.Port Allocation Optimization of Export Container Yard: Case Study of Banjarmasin Container Terminal; Container stack allocation planning has a major impact on minimizing ship berth time and terminal operating costs. The yard allocation model aims to reduce the distance traveled by trucks in loading activities and to balance the number in each block. The sub-optimal allocation of the container yard at the Banjarmasin Container Terminal is one of the problems that must be resolved. For solving these problems, evaluation and optimization methods are used in planning the container stacking field allocation. After getting the results of evaluation and optimization, a simulation is carried out to determine the loading time of the ship. From the results of evaluation and optimization obtained in February 2019, the truck's mileage can be reduced by 4% or 539 km from 13.941 km, while the difference of containers in the ship block is 74% or 4.863 boxes from 6.546 boxes. In addition, the difference between the containers in the entire stacking block was 55% or 2.452 boxes from 4.446 boxes, saving time for loading activities was 13% or 4.749 minutes from 36.129 minutes. Then for the overall fuel cost savings from truck, RTG, and container crane by 16% or Rp 236.723.498 from Rp 1.508.369.508. With this optimization, port operator could allocate more containers in container yard.


2021 ◽  
Vol 28 (1) ◽  
pp. 1-14
Author(s):  
Boluwaji A. Akinnuwesi ◽  
Omokhoba B. Yama ◽  
Alade M. Rahman ◽  
Stephen G. Fashoto

The Nigeria ports plays a vital role in socio-economic growth by being a cheap mode of conveying shipments for importation and  exportation. The number of vessels coming into the Nigerian ports every year is on the average of about 4,900. A well flourishing and efficient ports and cargo management will in no doubt put a developing economy such as Nigeria in a leading pedestal with developed nations. Thus, stakeholders in container terminals are concerned about discharging containers as fast as possible, with the purpose of saving terminal costs. This study is driven to minimize the time being used up by ships in container terminal using genetic algorithm (GA) and thus attain maximum efficiency. The limited berth space in the wharf lead to berth allocation problem (BAP) and an optimal solution is required. Moreover, high berth occupancy results in congestion where vessels are queuing to be served. This leads to high turn-around time and results in bad service for the container terminal. The aim of this study is to develop and implement a genetic algorithm based model for berth allocation (i.e. GAMBA) with the view to minimize the total delay times of vessels at container terminals. A study of the operations in Apapa wharf was done with the view to understand the berth allocation process vis-à-vis the challenges therein. The relevant parameters required for berth allocation were identified and GAMBA was developed using the identified parameters. GAMBA was  implemented using real life data collected from the container terminal, Apapa, Lagos, Nigeria. The results showed that increasing the quay length by 250m has a very similar outcome on the container port’s efficiency as reducing the proportion of increasing handling time by 0.0025 h/m. This revealed that the outcome on the container port’s efficiency by increasing the quayside length was the same as reducing the proportion of increasing management time. Based on these results, the optimized allocation of container storage and the automation of the handling process can be proposed as cheaper alternatives to construction and development of the containers port in relation to increasing the productivity of the port.


Author(s):  
Cuong Truong Ngoc ◽  
Xiao Xu ◽  
Hwan-Seong Kim ◽  
Duy Anh Nguyen ◽  
Sam-Sang You

This paper deals with three-dimensional (3D) model of competitive Lotka-Volterra equation to investigate nonlinear dynamics and control strategy of container terminal throughput and capacity. Dynamical behaviors are intensely explored by using eigenvalue evaluation, bifurcation analysis, and time-series data. The dynamical analysis is to show the stability with bifurcation of the competition and collaboration of multiple container terminals in the maritime transportation. Based on the chaotic analysis, the sliding mode control theory has been utilized for optimization of port operations under disruptions. Extensive numerical simulations have been conducted to validate the efficacy and reliability of the presented control algorithms. Particularly, the closed-loop system has been assessed through chaotic suppression and synchronization strategies for port management. Finally, the presented fundamental techniques can be utilized to provide managerial insights and solutions on efficient seaport operations that allow more timely and cost-effective decision making for port authorities in such a highly competitive environment.


2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Muhammad Arif Budiyanto ◽  
Muhammad Hanzalah Huzaifi ◽  
Simon Juanda Sirait ◽  
Putu Hangga Nan Prayoga

AbstractSustainable development of container terminals is based on energy efficiency and reduction in CO2 emissions. This study estimated the energy consumption and CO2 emissions in container terminals according to their layouts. Energy consumption was calculated based on utility data as well as fuel and electricity consumptions for each container-handling equipment in the container terminal. CO2 emissions were estimated using movement modality based on the number of movements of and distance travelled by each container-handling equipment. A case study involving two types of container terminal layouts i.e. parallel and perpendicular layouts, was conducted. The contributions of each container-handling equipment to the energy consumption and CO2 emissions were estimated and evaluated using statistical analysis. The results of the case study indicated that on the CO2 emissions in parallel and perpendicular layouts were relatively similar (within the range of 16–19 kg/TEUs). These results indicate that both parallel and perpendicular layouts are suitable for future ports based on sustainable development. The results can also be used for future planning of operating patterns and layout selection in container terminals.


2021 ◽  
Vol 11 (5) ◽  
pp. 2153
Author(s):  
Nadia Giuffrida ◽  
Maja Stojaković ◽  
Elen Twrdy ◽  
Matteo Ignaccolo

Container terminals are the main hubs of the global supply chain but, conversely, they play an important role in energy consumption, environmental pollution and even climate change due to carbon emissions. Assessing the environmental impact of this type of port terminal and choosing appropriate mitigation measures is essential to pursue the goals related to a clean environment and ensuring a good quality of life of the inhabitants of port cities. In this paper the authors present a Terminal Decision Support Tool (TDST) for the development of a container terminal that considers both operation efficiency and environmental impacts. The TDST provides environmental impact mitigation measures based on different levels of evolution of the port’s container traffic. An application of the TDST is conducted on the Port of Augusta (Italy), a port that is planning infrastructural interventions in coming years in order to gain a new role as a reference point for container traffic in the Mediterranean.


2021 ◽  
Vol 11 (15) ◽  
pp. 6922
Author(s):  
Jeongmin Kim ◽  
Ellen J. Hong ◽  
Youngjee Yang ◽  
Kwang Ryel Ryu

In this paper, we claim that the operation schedule of automated stacking cranes (ASC) in the storage yard of automated container terminals can be built effectively and efficiently by using a crane dispatching policy, and propose a noisy optimization algorithm named N-RTS that can derive such a policy efficiently. To select a job for an ASC, our dispatching policy uses a multi-criteria scoring function to calculate the score of each candidate job using a weighted summation of the evaluations in those criteria. As the calculated score depends on the respective weights of these criteria, and thus a different weight vector gives rise to a different best candidate, a weight vector can be deemed as a policy. A good weight vector, or policy, can be found by a simulation-based search where a candidate policy is evaluated through a computationally expensive simulation of applying the policy to some operation scenarios. We may simplify the simulation to save time but at the cost of sacrificing the evaluation accuracy. N-RTS copes with this dilemma by maintaining a good balance between exploration and exploitation. Experimental results show that the policy derived by N-RTS outperforms other ASC scheduling methods. We also conducted additional experiments using some benchmark functions to validate the performance of N-RTS.


2020 ◽  
Vol 11 (1) ◽  
pp. 168
Author(s):  
Hyeonu Im ◽  
Jiwon Yu ◽  
Chulung Lee

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.


Author(s):  
Abbas Al-Refaie ◽  
Hala Abedalqader

This research proposes two optimization models to deal with the berth allocation problem. The first model considers the berth allocation problem under regular vessel arrivals to minimize the flow time of vessels in the marine container terminal, minimize the tardiness penalty costs, and maximize the satisfaction level of vessels’ operators on preferred times of departure. The second model optimizes the berth allocation problem under emergency conditions by maximizing the number of assigned vessels, minimizing the vessel’s waiting time, and maximizing the satisfaction level on the served ships. Two real examples are provided for model illustration under regular and emergent vessel arrivals. Results show that the proposed models effectively provide optimal vessel scheduling in the terminal, reduce costs at an acceptable satisfaction level of vessels’ operators, decrease the waiting time of vessels, and shorten the delay in departures under both regular and emergent vessel arrivals. In conclusion, the proposed models may provide valuable assistance to decision-makers in marine container terminals on determining optimal berth allocation under daily and emergency vessel arrivals. Future research considers quay crane assignment and scheduling problems.


Sign in / Sign up

Export Citation Format

Share Document