• Journal of Navigation and Port Research
• /
• v.33 no.10
• /
• pp.723-734
• /
• 2009

Container Vessel is becoming larger and faster thanks to the rapid growth of global trade and development of technology. Therefore, 15,000TEU vessel is expected to be ordered in near future. Every nations in north-east Asia are facing strong competition to be logistics hub to get the initiatives of logistics in response to the rapid change of logistics environment. According to the globalization of economy and major ports in this region also are trying to catch big shipping line for their survival. Considering above circumstances of the advent of ultra-large container vessel and spoke-and-hub strategy, it is inevitably necessary to make a fast and accurate vessel job in the terminal in order to be a leading port To meet this objective, current vessel planning system has to be improved innovatively. Therefore, this thesis propose multi distributed vessel planning system which enables multi loading/discharging planning with several planner simultaneously for faster and more accurate than existing planning and enhances quality of planning through information sharing among planners. Also this thesis uses simulation through Arena to verify the efficiency of this multi-distributed vessel planning system.

• Journal of Navigation and Port Research
• /
• v.40 no.3
• /
• pp.113-120
• /
• 2016

If there are containers stacked upon the container to be fetched out of a container yard to vessel, rehandling which moves those containers to other places temporarily is needed. In order to avoid such rehandling, remarshalling which rearranges containers should be done before the vessel arrives. The remarshalling plan is commonly generated within a bay. It happens, however, that the generation of the intra-bay remarshalling plan within the permitted time is not possible because of bad stacking conditions. This paper presents the remarshalling algorithm which uses the empty slots of the neighboring bay as a temporary storage space. Simulation experiments have shown that the presented algorithm can generate the remarshalling plan within the permitted time under any staking conditions.

• Journal of Korean Institute of Industrial Engineers
• /
• v.23 no.4
• /
• pp.645-660
• /
• 1997

An application of the genetic algorithm(GA) to the loading sequencing problem in port container terminals is presented in this paper. The efficiency of loading operations in port container terminals is highly dependent on the loading sequence of export containers. In order to sequence the loading operation, we hove to determine the route of each container handling equipment (transfer crane or straddle carried in the yard during the loading operation. The route of a container handling equipment is determined in a way of minimizing the total container handling time. An encoding method is developed which keeps intermediate solutions feasible and speeds up the evolution process. We determine the sequence of each individual container which the container handling equipment picks up at each yard-bay as well as the visiting sequence of yard-bays of the equipment during the loading operation. A numerical experiment is carried out to evaluate the performance of the algorithm developed.

• Journal of Mushroom
• /
• v.16 no.1
• /
• pp.22-30
• /
• 2018

This study was performed to determine optimal extraction conditions of fermented Polygonum multiflorum root by Lentinula edodes (JMI10079) Pegler mycelials using response surface methodology. The independent factors were extraction temperature (X1: $40-100^{\circ}C$), extraction time (X2: 2-10 hrs.), and the ratio of water to sample (X3: 33-100 mg/mL). Their effects were assessed on dependent variables of the extract properties, which included soluble solid contents (Y1), $^{\circ}Brix$ of sample extract (Y2), total polyphenol content (Y3), total flavonoid content (Y4), 2,2'-azino-bis(3-ethylbenzothiazoline-6-sulphonic acid) radical cation scavenging activity (Y5) and 2,2-diphenyl-1-picrylhydrazyl radical scavenging activity (Y6). The experimental data obtained were fit to a second-order polynomial equation. The optimal extraction conditions for fermented P. multiflorum root were: X1: $91.22^{\circ}C$, X2: 7.72 hrs, and X3: 39.71 mg/mL.

• Journal of Navigation and Port Research
• /
• v.28 no.1
• /
• pp.83-90
• /
• 2004

Navy surface vessels require pier services such as emergency repair, oil supply, arm loading / unloading, craning, standby readiness, normal repair, gun arrangement, ammunition loading, and food loading during the period in port. The purpose of this study is to establish efficient berth allocation plan for navy surface vessels in home port under the limited resources of piers and equipments. This study suggests Mixed Integer Programming model for berth allocation problem, considering precedence relationships among services. For an effective analysis, the model is implemented by ILOG OPL(Optimization Programming Language) Studio 3.1 and ILOG CPLEX 7.0. The results of the model show reduction of berth shifts and increasement of service benefits.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2010.10a
• /
• pp.110-111
• /
• 2010

Recently, container terminal managers make an experiment on the double cycle and dual cycle operation, which ship loading and unloading were carried out simultaneously, for increasing the productivity of quay side. However, if we make an experiment on dual cycle operation in a real job site, the efficiency is poor up to terminal operation method as YTs(Yard Tractors)' allocation method, QCs(Quay Cranes)' working speed, and position of export containers. So, this paper examine more efficient terminal operation method, when terminal uses dual cycle operation.

• Journal of the military operations research society of Korea
• /
• v.32 no.1
• /
• pp.36-50
• /
• 2006

It is required to transport a considerable amount of wartime strategic materials from US to Korea via airlift operation. This study attempts to formulate the wartime airlift operation model and evaluate the airlift capability of mobilized resources, including civil aircrafts. Although an airlift plan has been annually updated by the Korea Transportation Command, it is necessary to evaluate the feasibility through simulation due to uncertainties in the process of airlift operation. Uncertain parameters are as follows; the inter-arrival time of materials in the US airfields, loading and unloading times, the distribution of aircraft's initial location at the time of mobilization order. The simulation is executed under two scenarios and the results are analyzed through a sensitivity analysis. Simulation result shows that the irregularity of inter-arrival time and the number of mobilized civil aircrafts are the most critical factors in influencing airlift capability.

• Journal of Intelligence and Information Systems
• /
• v.14 no.4
• /
• pp.103-116
• /
• 2008

This paper proposes quay crane (QC) scheduling algorithms that determine the working sequence of QCs over ship bays in a container vessel in automated container terminals. We propose two scheduling algorithms that examine the distribution of export containers in the stacking yard and determine the sequence of ship bays to balance the workload distribution among the yard blocks. One of the algorithms is a simple heuristic algorithm which dynamically selects the next ship bay based on the entropy of workloads among yard blocks whenever a QC finishes loading containers at a ship bay and the other uses genetic algorithm to search the optimal sequence of ship bays. To evaluate the fitness of each chromosome in the genetic algorithm, we have devised a method that is able to calculate an approximation of loading time of container vessels considering the workloads among yard blocks. Simulation experiments have been carried out to compare the efficiency of the proposed algorithms. The results show that our QC scheduling algorithms are efficient in reducing the turn-around time of container vessels.

• Journal of Navigation and Port Research
• /
• v.35 no.8
• /
• pp.657-665
• /
• 2011

This study deals with an integrated problem for deciding sequencing and storage location of export containers together at its receiving operation in the container terminal with a perpendicular layout. The preferred storage location of an export container varies with the priority of the corresponding loading operation and the waiting time of an external truck depends on its storage time. This paper proposes the mixed integer programming model considering the expected arrival time and expected finish time of an external truck and the preferred storage location for its loading operation. And we suggest the heuristic algorithm based on a simulated annealing algorithm for real world adaption. We compare the heuristic algorithm with the optimum model in terms of the computation times and total cost and the performance of the heuristic algorithm is analyzed through a numerical experiment.

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

In order to increase the productivity of container terminals, automation is being considered seriously in nowadays. A yard is usually automated by running autumated RMGs (rail mounted gantries) which may require somewhat a different stacking strategy to archive a better performance. In this paper, we present a simulation model for RMGs and summarize experimental results with two different stacking strategies applied to a horizontal block which has two non-crossable RMGs. The concentrating strategy, which stacks containers belong to a single ship together and dedicateds each RMG to either ship services or external truck services, showed a good performance in ship unloading. In the contrast, the distributing strategy, which partitions a block into two regions and binds each RMG to one of the regions to improve the productivity of ship services by running each RMG alternately, is suggested for blocks of exporting.