• Journal of the Korean Operations Research and Management Science Society
• /
• v.31 no.3
• /
• pp.11-25
• /
• 2006

Space may be a scarce resource in manufacturing shops, warehouses, freight terminals, and container terminals. This Paper discusses how to locate temporary storage Inventories In limited storage areas. A typical inventory is delivered from the location of the preceding process to the storage area and stored In the storage area during the certain period of time. And it may be relocated from the storage position to another. Finally. it is delivered from the final storage area to the location of the next process. Because this logistic process for an inventory requires handling activities, transportation activities, and storage spaces, the limitation in capacities of handling equipment, transportation equipment, and storage space must be considered when allocating spaces to the inventory. This problem Is modeled as a multicommodity minimal cost flow problem. And a heuristic algorithm for the Problem is proposed. Numerical experiments are presented to validate the mathematical model and the heuristic algorithm.

• Journal of Navigation and Port Research
• /
• v.30 no.4
• /
• pp.285-290
• /
• 2006

Shipping companies consider most of the ship turnaround time as a critical factor when selecting a rolling port for reducing costs. So, many researchers have been studying for the optimization of preplanning and high~performance of the Gantry Cranes (GCs) in container terminals for faster loading and unloading. Therefore, in this paper, we propose an RFID (Radio Frequency Identification) based RTLS (Real-Time Location System) for reducing the ship turnaround time in ubiquitous port environment. In addition, pre-planning based on ubiquitous computing environment will support the GC and Yard Tractors (YTs), and reduce ship turnaround time more effectively. Especially, the proposed method enormously enhances the productivity of loading for the twin-lift system It will reduce the whole lead-time in the process of port logistics.

• Journal of Korean Port Research
• /
• v.14 no.2
• /
• pp.165-173
• /
• 2000

Major factors that are considered to determine lease charges of container terminals are, among others, construction cost of berth, discount rate, financing cost, and size of annual equivalent recovery. This paper aims to calculate construction costs at PECT and GCT and their annual equivalent recovery on the basis of historical data, and to identify whether or not the relationship of the above result and current lease charges at the two terminals are justifiable.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 1999.10a
• /
• pp.11-18
• /
• 1999

Major factors that are considered to determine lease charges of container terminals are, among others, construction cost of berth, discount rate, financing cost, and size of annual equivalent recovery. This paper aims to calculate construction costs at PECT and GCT and their annual equivalent recovery on the basis of historical data, and to identify whether or not relationship of the above result and current lease charges at the two terminals are justifiable.

• Journal of Korean Institute of Industrial Engineers
• /
• v.38 no.2
• /
• pp.157-172
• /
• 2012

In most container terminals, containers are piled up and stored in a yard in order to utilize the space efficiently. Hence, it requires unproductive container-handling operations to retrieve a container that is not placed on the top of a container stack. As a result, to streamline container-loading operations by which containers are transferred from a yard to a vessel, it is necessary to pre-marshal (i.e., shuffle in advance) containers in accordance with container-loading plan. We propose $A^*$ algorithm to find the optimal container-relocation sequence for the intra-bay container pre-marshalling problem. To work out the heuristic estimate for the proposed $A^*$ algorithm, we introduce the container rearrangement problem and obtain the lower bound of the length of the optimal relocation sequence. The performance of the algorithm is validated extensively by the numerical experiments on the problem instances that are given in the previous studies and generated randomly with various parameters.

• Journal of the Korean Institute of Navigation
• /
• v.22 no.3
• /
• pp.51-63
• /
• 1998

This paper presents the results of a study that looks into the different operating structures of terminals in the United States and attempts to find the type of terminal management scheme (All-Comers Common User Facilities, Programmed Common User Facilities, and Program-Tied User Facilities) that is most efficient with regard to crane usage. The paper uses gross and net crane moves per hour to develop an efficiency ratio that is then used to compare terminals. A total of thirty-one terminals were compared in an attempted to find the most efficient management scheme. While the hypothesis that Program-Tied User Facilities are the most efficient operating scheme was accepted, the sample was too small to provide conclusive results pertinent to the terminals in the United States.

• Journal of the Korean Institute of Navigation
• /
• v.25 no.1
• /
• pp.23-32
• /
• 2001

This paper treats the berth planning problem which is encountered at public container terminals. The main issue of the berth planning problem is to decide how to allocate the berths to scheduled calling containerships of which the ETA' s are given beforehand. Three optimization models for the berth planning problem are proposed in the formulation of set problems. Some heuristic algorithms for generating the decision variables of the models are also devised by using the concept of the ship's waiting time and the modified berth occupancy rate. Computational experiments based on the data arising from the real public container terminal are also carried out and the results are reported to show that the proposed optimization models and the heuristic algorithms for generating the decision variables are applicable and useful for the berth planning problem at public container terminals.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1999.10a
• /
• pp.87-87
• /
• 1999

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1999.04a
• /
• pp.306-307
• /
• 1999

• Journal of Korea Port Economic Association
• /
• v.21 no.1
• /
• pp.59-72
• /
• 2005

There were many theoretical studies using mathematical models about a yard storage capacity in a container terminal so far, but a simulation approach is newly popularizing. The reason why the simulation studies about yard storage capacity were a few was that once the most important part in a container terminal was a quay part. However, from the economic crisis year of 1977, the yard storage part in a container terminal became a critical resource because of the shortage of SOC investment resources. Therefore, after discharging or loading even through there was a waiting in the quay part or not, it can be swiftly improved the efficiency of a container terminal if it was handled rapidly or smoothly in a container yard. So the accurate assessment of yard storage capacity in a container terminal was needed. This study planed to assess the operation capability of a container yard via a simulation model. The model included many chatacteristics of three Korean container terminals such as Gamman Hanjin, Uam, and Hutchinson Busan at the period of 1999 to 2000. The 95% percentile was chosen as a criterion for judging of the storage capability by the recommendation of KPC (1998) and JWD (1998). A simulation approach with system dynamics concept considering the multi-directional impacts within the related variables can probavly foresee the future storage capacity of a terminal not just the past.