• Journal of Korean Institute of Industrial Engineers
• /
• v.35 no.2
• /
• pp.129-140
• /
• 2009

This paper introduces the planar storage location assignment problem (PSLAP) that no research has attempted to mathematically solve. The PSLAP can be defined as the assignment of the inbound and outbound objects to the storage yard with aim of minimizing the number of obstructive object moves. The storage yard allows only planar moves of objects. The PSLAP usually occurs in the assembly block stockyard operations at a shipyard. This paper formulates the PSLAP using a mathematical programming model, but which belongs to the NP-hard problems category. Thus this paper utilizes an efficient genetic algorithm (GA) to solve the PSLAP for real-sized instances. The performance of the proposed mathematical programming model and developed GA is verified by a number of numerical experiments.

• Industrial Engineering and Management Systems
• /
• v.11 no.3
• /
• pp.276-287
• /
• 2012

Determining storage locations of containers is an important issue for efficient operation of container terminals. This study assumes a storage yard with a horizontal layout in which blocks are laid out in parallel to the quay and trucks enter at the side of a block to deliver (receive) a container to (from) the yard crane. Various storage rules for determining storage locations of containers are introduced. Simulation studies are conducted for evaluating various rules. The following guidelines are derived from the result of our simulation study: when designing a block, consider a block configuration in which the longest gantry and the longest trolley travel times of rail-mounted gantry cranes (RMGCs) are similar; do not restrict the types of containers that can be stored in a storage area; if different roles are to be assigned to different storage areas, one possible way is to divide a bay into two areas so that some rows in the bay are allocated to inbound containers while the other rows in the same bay are allocated to outbound containers; reserve the space in bay unit for a high productivity of RMGCs but reserve the space in stack unit when the storage space is not enough; when the storage space is not sufficient, allocate storage location in a way of starting from the end and ending at the middle of a block; for reducing the travel distance of internal trucks, provide a higher priority to a block nearer to the berthing position of the corresponding vessel.

• Journal of Korean Society of Disaster and Security
• /
• v.9 no.2
• /
• pp.33-42
• /
• 2016

Domestic harbor yard storage facilities are a place specifically located in a container terminal for import and export of packaged dangerous goods, and due to the recent relaxed criteria for the secured open area, concerns for the extended damage upon accidents are increasing. In this study, the impact of damages by radiant heat was analyzed through a simulation of a pool fire caused by the leakage of flammable liquids from a tank container. As a result, it was analyzed that the distance of radiant heat according to threshold damage levels was beyond the current criteria of the secured open area, and the structural damage of adjacent containers could happen within a very short time if they were exposed to the early pool fire continuously. It is considered that this study will be helpful in preparing the proper criteria for the secured open area between yard storage facilities in a container terminal.

• IE interfaces
• /
• v.24 no.4
• /
• pp.362-372
• /
• 2011

Container pick-up scheduling problem is to minimize the total container handling time, which consists of the traveling distance and the setup time of yard cranes in a container yard. Yard cranes have to pick-up the containers which are stacked in the yard-bays to satisfy the work schedule requirement of quay crane, which loads and unloads containers on or from container ships. This paper allows the movement of multiple yard cranes among storage blocks. A mixed integer programming model has been formulated and a genetic algorithm (GA) has been proposed to solve problems of large sizes. Computational results show that the proposed GA is an effective method.

• Korean Management Science Review
• /
• v.12 no.3
• /
• pp.1-15
• /
• 1995

The Pusan Container Terminal faces a rapid increase in berthing time of container ships as well as in waiting time of external trucks, which is due to an absolute lack of yard space. This research is focused on the development of a decision support system for the planning of the container terminal yard assignment so that the yard space would be utilized most effectively. Efforts should be given to the reasonable assignment of the yard storage and the dynamic adaptation to the ever changing environment. The software introduced here is based on the know-how of the field exports and its framework takes the approach of the hierarchical decision making.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• v.29 no.1
• /
• pp.487-492
• /
• 2005

Domestic Container Terminals have a problem of Yard Planning to load containers at terminal storage because of the narrow yard area, incorrectness of container information and late transmission of information. So this paper has an object that is a plan to use the gate and the storage of container terminal. After the information of vehicle and container is collected in advance by RFID(Radio Frequence Identification) doing active research now.

• Journal of Navigation and Port Research
• /
• v.33 no.5
• /
• pp.353-359
• /
• 2009

Most domestic container terminals are lack of container storage capacity compared to the throughput of container. The main reason is the difference between the theoretical capacity applied to the development of terminals and the real capacity of a berth Another reason seems to be the increase of the container crane in number per berth to match the need for the getting larger vessel, which is resulted from the increase of the berth capacity from the start. This study, therefore, aims to suggest the economic size of container yard by comparing the existing one. For this the berth capacity was recalculated, the required yard size derived considering up to 10,000TEU vessel and then cost comparison done.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• v.1
• /
• pp.345-352
• /
• 2006

The purpose of this paper is to evaluate the efficiency of two yard layout of HSS at container terminal, one is that the container yard blocks are placed horizontally in parallel with berth, the other is that the yard blocks are arranged vertically in perpendicular to the berth. In stevedoring system of container terminal, stacking and transport performance are influenced according to block arrangement type of yard. Therefore, efficient design that can improve stacking and transport performance is required. In this paper, we compared their efficiency of two block arrangement concepts in terms of storage capacity, productivity, facility investments, truck service level.

• Journal of Navigation and Port Research
• /
• v.30 no.3 s.109
• /
• pp.203-209
• /
• 2006

Maritime transport has been occupying the biggest part of the container transportation market. With regard to container terminal management, the planning technology and the space allocation system on the yard are very significant factors to secure the stability of ship and to ensure the reliability of schedules of ship throughout keeping barycenter of vessel by right loading and fast handling of cargoes. The purposes of this paper are to illustrate the existing yard management systems such as Grouping method and Random Grounding method, and then to evaluate and compare the efficiency of yard availability between the existing management system(Grouping method) and Random Grouping which uses the forecasted inbound cargo volume at the gate by Time Base Operation.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.33 no.2
• /
• pp.75-86
• /
• 2008

A remarshalling is one of the operational strategies considered importantly at a port container terminal for the fast ship operations and heighten efficiency of slacking yard. The remarshalling rearranges the containers scattered at a yard block in order to reduce the transfer time and the rehandling time of container handling equipments. This Paper deals with the rearrangement problem, which decides to where containers are transported considering time value of each operations. We propose the mixed integer programming model minimizing the weighted total operation cost. This model is a NP-hard problem. Therefore we develope the heuristic algorithm for rearrangement problem to real world adaption. We compare the heuristic algorithm with the optimum model in terms of the computation times and total cost. For the sensitivity analysis of configuration of storage and cost weight, a variety of scenarios are experimented.