• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2004.11a
• /
• pp.271-278
• /
• 2004

컨테이너 터미널에서 적하 작업을 수행할 때에는 선박의 안정성을 위하여 무거운 컨테이너들을 선박의 바닥쪽에 우선하여 배치한다. 그러므로 장치장(yard)에서 동일한 선박 베이(bay)에 선적할 컨테이너들을 무게가 무거운 순서로 효율적으로 반출할 수 있다면, 적하 계획의 수립과 수행일 수월해진다. 만일 장치장에서 적하를 위하여 지금 반출하여야 하는 컨테이너의 상단에 다른 컨테이너들이 장치되어 있다면, 부득이하게 위에 놓여 있는 컨테이너들을 임시로 옮겨야 하는데, 이러한 부가 작업을 재취급(rehandling)이라 한다. 채취급이 빈번히 발생하게 되면 적하 작업의 흐름은 차질을 빚게 되므로 재취급의 최소화는 작업 효율 측면에서 매우 중요하다. 본 논문에서는 컨테이너가 장치장에 반입되는 시점에 해당 컨테이너의 무게를 알 수 있다는 가정하에, 적하 작업을 위한 반출시 재취급이 적게 발생하도록 신규 반입된 컨테이너의 장치 위치를 결정하는 휴리스틱을 제안한다. 제안하는 휴리스틱은 각 스택(stack)별로 장치되어 있는 컨테이너들 중에서 자장 먼저 반출될 가장 무거운 컨테이너의 무게를 해당 스택의 대표 무게로 설정하고, 이를 신규 반입 컨테이너의 무게와 비교하여 장치 위치를 결정한다. 장치장 베이 하나로 시뮬레이션한 실험 결과 4단 6열 및 6단 9열의 장치장 베이 구조에서 임의의 위치에 신규 반입 컨테이너를 장치하는 방식에 비해 재취급 횟수를 1/5이하로 줄일 수 있음을 확인하였다

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.10
• /
• pp.169-173
• /
• 2014

Nobody has yet been able to determine the optimal solution conclusively whether NP-complete problems are in fact solvable in polynomial time. Gu$\acute{e}$ret et al. tries to obtain the optimal solution using linear programming with $O(m^4)$ time complexity for barge loading problem a kind of bin packing problem that is classified as nondeterministic polynomial time (NP)-complete problem. On the other hand, this paper suggests the loading rule of profit priority rank algorithm with O(m log m) time complexity. This paper decides the profit priority rank firstly. Then, we obtain the initial loading result using the rule of loading the good has profit priority order. Finally, we balance the loading and capability of barge swap the goods of unloading in previously loading in case of under loading. As a result of experiments, this algorithm reduces the $O(m^4)$ of linear programming to O(m log m) time complexity for NP-complete barge loading problem.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.1
• /
• pp.793-800
• /
• 2015

This study is to analyze correlation between Daniel Libeskind's architecture works and the effects as a series of music works be learning in youth and opera "Aron and Mose". The results showed that First, Libeskind created convergence of invisible line by borrowing the composition of freely flowed scales in score from his architecture. Second, he composed geometrical shapes of contrapuntal reiteration based on double tune in music structure, in other words forms of polyphonic proportion. and he expressed the geometrically, freely line rhythm by planning composition of multidimensional spaces, "Hybrid", planning the contrast of material, form by results of Intertextually combination between Architecture and Music. Third, he tried to express the pain, fear, anxiety, etc. of the past spatially, and constructed "the spaces of absence" on his works through inspiration from Arnold Sch$\ddot{o}$nberg's works.

• 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 Korea Society of Computer and Information
• /
• v.10 no.1 s.33
• /
• pp.201-208
• /
• 2005

Recently, the container terminal requires the study of method to increase efficiency through change of its operation method. Loading plan is a very important part to increase the efficiency of container terminal. Loading Plan is largely divided into two cases, deciding loading location and loading scheduling and this Paper proposes a more efficient method of container loading scheduling. Container loading scheduling is a problem of combination optimization to consider several items of loading location and operation equipments. etc. An existing method of cluster composition that decides the order of container loading scheduling has a restriction to increase the efficiency of work owing to rehandling problem. Therefore, we Propose a more efficient method of container loading scheduling which composes containers with identical attribution, based on ship loading list and yard map, into stack units of cluster, applying to hierarchical clustering method, and defines the restriction of working order. In this process, we can see a possible working path among clusters by defining the restriction of working order and search efficiency will be increased because of restricted search for working path.

• 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.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2002.11a
• /
• pp.63-70
• /
• 2002

The main subject to become a hub pen is automation The automated container terminal has already operated in advanced pons and it bas been planned for the basic planning and operation design in domestic case. The key of automated container terminal is effective operation of both ATC(automated transfer crane) and AGV(automated guided vehicle) which is automated handling equipments. This is essential to productivity of automated container terminal. This study suggests the moat optimal method of equipment operation in order to minimize loading time using each three types of effective AT operation methods and AGV dispatching rules in automated container terminals. As the automated equipment operation causes unexpected deadlocks or interferences, it should be proceeded on event-based real tine. Therefore we propose the most effective ATC operation methods and AGV dispatching rules in this paper. The various states occurred in real automated container terminals are simulated to evaluate these methods. This experiment will show the most robust automated equipment operation method on various parameters(the degree of yard re-marshaling, the number of containers and the number of AGVs).

• Journal of the Korean Association of Geographic Information Studies
• /
• v.13 no.1
• /
• pp.16-27
• /
• 2010

A street, as a linear factor constituting the city, is an axis of urban development. The substantial function of the street is the traffic space for the passage but now it plays the important role of the place of community where contains various activities such as meeting between people and people, rest, entertainment etc. A street is basically the 3 dimensional space consisted of the sidewalk, roadway and the roadside structures surrounding the street. In this case, the roadside structures are the physical composition factors for the street space and the facade of the roadside structures acts as important variables to form the image of street space. Thus, this study is to provide the basic data to be applied in the future urban street landscape plan by extracting the superior factors in visual and perceptional aspects which affect the image of street view from the shape composition factors which constitute the facade of the roadside structures, and by searching and analyzing the satisfaction degree and preference of each factors.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2007.05a
• /
• pp.2013-2018
• /
• 2007

최근에 발생하는 홍수특성은 단기간의 국지성 집중호우로 본류 대하천보다는 상류지역 지류하천이 특히 취약하여 이에 대해 하류보다는 상류, 본류보다는 지류위주로 과거와 다른 치수정책 전환이 요구되고 있다. 정부에서도 과거 치수대책이 제방위주의 선적인 개념에서 면적인 개념의 유역치수 중심의 방어형태로 추진하고 있으나, 상류지류 하천에 대한 홍수방어 계획은 부족한 실정이다. 지류하천에 홍수가 발생하면 홍수도달시간이 짧아 첨단홍수예보시스템으로도 대처가 곤란한 문제가 있으며, 이외에도 홍수와 함께 산사태가 빈번히 발생되고 토석류, 유목류가 한꺼번에 동반 유입되어 인명과 재산피해가 크게 발생하는 특징을 가지고 있다. 작년 7월 강원지역 집중호우에서도 인제군, 평창군 등 지류에 인명과 재산피해가 크게 발생한 것도 이와는 무관하지 않을 것이다. 최근 국지성 집중호우가 빈번히 발생하는 것은 기상적 측면이 아니더라도 우리나라는 하천경사가 급하고 산지가 국토의 약 70%로 구성되어 있어 지형적 측면에서 평화의댐(지체댐), 군남홍수조절지, 한탄강 홍수조절댐 등 대규모 홍수방어댐 도입시 홍수조절 효과가 우수하나, 대규모 댐건설에 따른 지역민의 불신, 환경단체 반발, 사회적 미합의 등 현실적인 제약조건이 많으므로 현실적이고 상류지역 지류하천에 효과적인 홍수조절을 위해서는 보호하고자 하는 도시 및 주요시설물시설에 대하여 소규모 홍수저류지(Detention Dam)를 상류 지류하천에 단일 또는 군(群)으로 도입하여 설치하는 방안을 적극적으로 추진하여야 한다고 사료된다. 소규모의 홍수저류지는 평상시에는 자연상태와 같이 전량 방류하고 갑작스런 홍수발생시 첨두홍수량을 지체하거나 감소시켜 하류지역에 홍수피해를 줄이는 시설로 기존의 댐보다는 규모가 적고 평상시에는 자연하천과 같이 물을 담지 않아 환경변화에 의한 영향이 적어 사회적 합의가 유리하고 친환경적이며, 홍수기에는 비어 있는 저류용량을 전량 활용이 가능하여 저수규모에 비해 홍수조절효과는 큰 장점이 있다. 특히 홍수조절의 본래 목적 외에도 초목류, 토석류 및 각종 부유쓰레기를 차단하는 사방댐 역할과 하류하천의 퇴사량 감소 등 다방면으로 효과가 있어 독일, 일본 등 선진국에서는 적극적으로 추진되고 있다. 본 연구에서는 선진 외국에 도입된 홍수저류지 사례를 조사 및 검토하여 국내에 적용 가능한 유역분담형 홍수저류지 규모 및 방식, 홍수저류지 도입방안과 향후 연구방향 제시하였다.

• The Journal of Bigdata
• /
• v.7 no.2
• /
• pp.129-137
• /
• 2022

With the development of the 4th industry, the logistics industry is evolving into a smart logistics system. However, ship work that transports vehicles is progressing slowly due to various problems. In this paper, we propose an stowage automation algorithm that can be used for cargo loading of vehicle carriers that shortens loading and unloading work time. The stowage automation algorithm returns the shortest distance by searching for a loading space and a movable path in the ship in consideration of the structure of the ship. The algorithm identifies walls, ramps and vehicles that have already been shipped, and can work even with randomly placed. In particular, it is expected to contribute to developing a smart logistics system for vehicle carriers by referring to the ship's master plan to search for vehicle loading and unloading space in each port and predict the shortest movable path.