• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.20 no.10
• /
• pp.58-67
• /
• 2006

In this paper, real-time reactive power/power factor compensating equipment is suggested for improving power quality at electrical railway's substation in marshalling yard and designing optimal capacity of compensating equipment for actual apply at current marshalling yard. For this purpose, several kind of real-time reactive power/power factor compensating equipments are introduced and SVG(Static Var Generator) as optimal compensating equipment that is suitable for load characteristics of substation in marshalling yard is suggested. This paper shows proper simulations by suggested equipment using PSIM software and describe basic compensating principle and simulation results. Optimal capacity design for applying current marshalling yard is based on real measured power quality data. Power quality improvement that is performed by SVG as real-time reactive power/power factor compensating equipment is estimated at electrical railway's substation in marshalling yard. As reference, real-time reactive power/power factor compensating equipment is composed by voltage source inverter and DC capacitors.

• Journal of Navigation and Port Research
• /
• v.44 no.3
• /
• pp.219-226
• /
• 2020

The container terminal operators established a re-marshalling plan to reduce the loading operation time and the release operation time. Re-marshalling is to rearrange the containers in the container yard to the advantageous position to shorten the working time using the spare time of the automated yard crane. This study assumed the automated container terminal with a perpendicular layout and deals with the inter-bay re-marshalling planning problem in a yard block. The inter-bay re-marshalling plan determines the container to be moved, the location to be relocated, and the sequence of relocation operations. This study presents a mixed integer programming model that simultaneously determines the storage location and the operation sequence while satisfying the spatial availability during the re-marshalling. Numerical experiments are conducted to understand re-marshalling operation using a beam search method.

• 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 Korea Society of Computer and Information
• /
• v.20 no.10
• /
• pp.61-68
• /
• 2015

This paper deals with the pre-marshalling problem that the containers of container yard at container terminal are relocated in consensus sequence of loading schedule of container vessel. This problem is essential to improvement of competitive power of terminal. This problem has to relocate the all of containers in a bay with minimum number of movement. There are various algorithms such as metaheuristic as genetic algorithm and heuristic algorithm in order to find the solution of this problem. Nevertheless, there is no unique general algorithm that is suitable for various many data. And the main drawback of metaheuristic methods are not the solution finding rule but can be find the approximated solution with many random trials and by coincidence. This paper can be obtain the solution with O(m) time complexity that this problem deals with bin packing problem for m stack bins with descending order of take out ranking. For various experimental data, the proposed algorithm can be obtain the optimal solutions for all of data. And to conclude, this algorithm can be show that most simple and general algorithm with simple optimal solution finding rule.

• Journal of the Korea Society for Simulation
• /
• v.19 no.2
• /
• pp.29-41
• /
• 2010

Due to the recent technological advance, new types of AS/RS which can handle containers are being developed, and it is expected that they will be applied to related industries before long. Some companies and institutes in our country have constructed pilot systems for high-density-high-stacking systems and tested them to develop AS/RS-typed warehouses for containers. Along with this kind of construction efforts, development of rules to operate such systems efficiently and safely is also important. When outward-bound shipment is scheduled in container port, re-marshalling which rearranges containers in the yard to make shipment easy is conducted. In this paper, operating rules for the re-marshalling as well as simulation experiments to evaluate the performance of the rules are presented. We suggested two kinds of alternative sets of operating rules for re-marshalling and described the relevant logics corresponding to all possible cases for each alternative of operating rules. Through various simulation experiments, we found that each alternative has the merits and demerits at the same time and we could not say the one is always superior to the other. As a useful strategy, changing the applying operating rule is recommended from moment to moment depending on the expected number of operations at the landside input/output position.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2004.11a
• /
• pp.203-208
• /
• 2004

The objective of this study is to analyze the efficiency of marshalling work using ATC(automated transfer crane) for ACT(automated container terminal). It is important fact to assignment of containers, because the character of ACT which block layout is vertical for berth and there are four other works which are inbound, oubound, loading and unloading in one block. And then there is need which assignment of containers with remarshaling work using ATCs in one block. Therefore, we analyze the efficiency of remarshaling work using simulation and suggest the assignment methodology of containers in yard

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.11
• /
• pp.2168-2174
• /
• 2009

Electrical railway system consists of rolling stock, track, signal and streetcar line system. Track circuit system is a vital system due to checking the location of trains. Track circuits are divided by using frequency and isolated electrically. Currently, there is not a regulation for the distance between track circuits using identical frequency. In case of installing additional track circuits in large stations or marshalling yard, the problem which is that the signal is not exactly transmitted to the track circuit occurs due to the mutual interference. In other words, the track circuit properly is not operated on account of wrong induction current by the mutual inductance between track circuits. In this paper, we suggest the electrical model between track circuits and numerically calculate demanded parameters in electrical model. The distance between track circuits satisfying the mutual inductance which does not happen to the mutual interference phenomenon is presented about the distance of track circuit. It is proved by using Matlab and PSpice program as the amplitude of mutual induced current.