• 산업공학
• /
• 제22권1호
• /
• pp.63-72
• /
• 2009

This paper considers a transporter scheduling problem under dynamic block transportation environment in shipbuilding. In dynamic situations, there exist the addition, cancellation or change of block transportation requirements, sudden breakdowns and maintenance of transporters. The transportation of the blocks in the shipyard has some distinct characteristics. Some blocks are available to be picked up at a specific time during the planning horizon while some other blocks need to be delivered before a specific time. These requirements cause two penalty times: 1) delay times incurred when a block is picked up after a required start time, and 2) tardy times incurred when a block shipment is completed after the required delivery time. The blocks are located at different areas in the shipyard and transported by transporters. The objective of this paper is to propose a heuristic algorithm based on a network flow model which minimize the weighted sum of empty transporter travel times, delay times, and tardy times. Also, a rolling-horizon scheduling method is proposed for dynamic block transportation environment. The performance of the proposed heuristic algorithms are evaluated through a simulation experiment.

• 대한조선학회논문집
• /
• 제50권5호
• /
• pp.298-306
• /
• 2013

Nowadays, a transporter manager plans the schedule of the block transportation by considering the experience of the manager, the production process of the blocks and the priority of the block transportation in shipyard. The schedule planning of the block transportation should be rearranged for the reflection of the path blocking cases occurred by unexpected obstacles or delays in transportation. In this paper, the optimal block transportation path planning system is developed for rearranging the schedule of the block transportation by considering the damaged path. $A^*$ algorithm is applied to calculate the new shortest path between the departure and arrival of the blocks transported through the damaged path. In this algorithm, the first node of the damaged path is considered as the starting position of the new shortest path, and then the shortest path calculation is completed if the new shortest path is connected to the one of nodes in the original path. In addition, the data structure for the algorithm is designed. This optimal block transportation path planning system is applied to the Philippine Subic shipyard and the ability of the rapid path modification is verified.

• 산업공학
• /
• 제21권3호
• /
• pp.274-282
• /
• 2008

This paper considers a transporter scheduling problem under dynamic block transportation environment in shipbuilding. In dynamic situations, there exist the addition or cancellation of block transportation requirements, sudden breakdowns and maintenance of transporters. The transportation of the blocks in the shipyard has some distinct characteristics. Some blocks are available to be picked up at a specific time during the planning horizon while some other blocks need to be delivered before a specific time. These requirements cause two penalty times : 1) delay times incurred when a block is picked up after a required start time, and 2) tardy times incurred when a block shipment is completed after the required delivery time. The blocks are located at different areas in the shipyard and transported by transporters. The objective of this paper is to propose heuristic algorithms which minimize the weighted sum of empty transporter travel times, delay times, and tardy times. Four heuristic algorithms for transporter scheduling are proposed and their performance is evaluated.

• 대한조선학회논문집
• /
• 제45권6호
• /
• pp.646-655
• /
• 2008

A main issue about production management of shipyards is to efficiently manage the work in process and logistics. However, so far the management of a transporter for moving building blocks has not been efficiently performed. To solve the issues, optimal block transporting scheduling system is developed for minimizing of the travel distance without overload of a transporter. To implement the developed system, a hybrid optimization algorithm for an optimal block transportation scheduling is proposed by combining the genetic algorithm and the ant algorithm. Finally, to evaluate the applicability of the developed system, it is applied to a block transportation scheduling problem of shipyards. The result shows that the developed system can generate the optimal block transportation scheduling of a transporter which minimizes the travel distance without overload of the transporter.

• 한국CDE학회논문집
• /
• 제21권2호
• /
• pp.177-185
• /
• 2016

In this paper, an optimal planning system for operating transporters in shipyard is developed. The system is designed to utilize the geometries of shipyard, and manage the data of blocks and transporters directly. There are four major menus such as shipyard map management based on GIS, block transportation request, transporter management, and optimal transportation planning in the system. The geometries and properties of the shops, roads, and addresses are manipulated in the shipyard map management menu. The block transportation requests and the properties of transporters are managed in the block transportation request and transporter management menus, respectively. The optimum transportation is planned automatically for minimizing the unload times of the transporters, and the optimum transportation plans are confirmed and printed to the transporter drivers. The effectiveness of the system was verified through the application to a large-sized shipyard.

• 대한조선학회논문집
• /
• 제46권6호
• /
• pp.595-602
• /
• 2009

Great number of ships has been built by Korean Shipyards since early of 2,000 due to the expanding worldwide trade. Most of shipyards have enlarged the weight of erection block and many blocks have been assembled in block fabrication factories outside the shipyards to reduce the shipbuilding period. Especially, Giga blocks that exceed 2,000 tons are often assembled by the block fabrication factories outside the shipyard. Generally, the blocks are transported to building dock in shipyard by towing barges. Accident can be occurred during the sea transportation and it may bring about not only the delay of delivery but also a disaster on the ocean environments. Transportation condition of GPE (Grand Pre-Erection) block differs from the ocean going conditions of marine vessels. Special consideration should be included before transportation work in order to guarantee the safety of GPE blocks and barge carriers. In this paper, several examples, which have been investigated to set up the safety standard of transportation of the GPE blocks on coastal routes, are introduced. For the barge transportation on coastal sea route, the design criteria are discussed, considering the design wave, the acceleration induced by wave, structural strength, and the fixture condition of blocks.

• 대한조선학회논문집
• /
• 제53권2호
• /
• pp.115-126
• /
• 2016

In the process of ship building, it is known that the maintenance of working period and saving cost are one of the important part during the logistics of blocks transportation. Precise operational planning inside the shipyard plays a big role for a smooth transportation of blocks. But many problems arise in the process of block transportation such as the inevitable road damage during the transportation of the blocks, unpredictable stockyard utilization of the road associated with a particular lot number, addition of unplanned blocks. Therefore, operational plan needs to be re-established frequently in real time for an efficient block management. In order to find the shortest path between lot numbers, there are several representative methods such as Floyd algorithm that has the characteristics of many-to-many mapping, Dijkstra algorithm that has the characteristic of one-to-many mapping, and the A* algorithm which has the one-to-one mapping, but many authors have published without the mutual comparisons of these algorithms. In this study, some appropriate comparison have been reviewed about the advantages and disadvantages of these algorithms in terms of precision and cost analysis of calculating the paths and planning system to operate the transporters. The flexible operating plan is proposed to handle a situation such as damaged path, changing process during block transportation. In addition, an operational algorithm of a vacant transporter is proposed to cover the shortest path in a minimum time considering the situation of transporter rotation for practical use.

• International Journal of Concrete Structures and Materials
• /
• 제9권1호
• /
• pp.21-33
• /
• 2015

This study aimed to present a reinforced concrete block system that reduces the flange thickness of the existing form block used in new buildings and optimizes the web form, and can thus capable of being used in the seismic retrofit of new and existing buildings. By conducting a compression test and finite element analysis based on the block and grouted concrete strength, it attempted to determine the compression capacity of the form block that can be used in new construction and seismic retrofit. As a result, the comparison of the strength equation from Architectural Institute of Japan to the prism compression test showed that the mortar coefficient of 0.55 was suitable instead of 0.75 recommended in the equation. The stress-strain relation of the block was proposed as a bi-linear model based on the compression test result of the single form block. Using the proposed model, finite element analysis was conducted on the prism specimens, and it was shown that the proposed model predicted the compression behavior of the form block appropriately.

• 대한교통학회지
• /
• 제32권2호
• /
• pp.162-169
• /
• 2014

세계화의 진전으로 국가들 간 사람과 물자의 교류는 지속적으로 증가해왔고 이에 따라 공항네트워크 또한 점점 방대해지고 촘촘해지고 있다. 자연계의 다양한 네트워크를 연구하는 네트워크 과학은 공항네트워크를 분석하는 데에 유용하다. 본 연구는 사회과학 네트워크에서 사용되고 있는 구조적 등위성 개념을 아시아 태평양 공항네트워크에 적용하여 그 결과를 바탕으로 국가들 간의 항공 시장, 교류 관계 정도를 해석해보았다. 아시아 태평양 공항네트워크는 8개의 블록(block)으로 구분되었으며 각 Block의 특성과 Block들 간의 관계를 분석한 결과 Block 1(주요 허브 공항들의 집합)과 Block 5(호주와 뉴질랜드의 공항)는 다른 Block들보다 깊은 관계를 갖고 있는 Block의 수가 많았다(영향력이 컸다). 다른 곳과 관계가 낮은 곳으로는 Block 3(CIS 지역), Block 7(말레이시아 인도네시아), Block 8(남태평양 프렌치폴리네시아)이었다. 구조적 등위성 분석으로 방대하고 복잡한 네트워크를 소수의 Block으로 집단화시켜 분석할 수 있으며, 네트워크의 성격에 맞게 항공 시장의 관계, 교류와 교역의 정도를 해석하여 의미 있는 결과를 얻었다.

• 한국콘텐츠학회논문지
• /
• 제18권11호
• /
• pp.475-483
• /
• 2018

대부분의 물류시스템은 물류정보와 물류흐름의 불일치로 인한 실세계 문제로 운송물류 추적성에 어려움을 경험한다. 이의 해결 방안으로 쇼핑몰을 이용한 주문 상품의 운송에 참여하는 공급체인 기업에 대한 사례연구를 통해서 물류와 정보 흐름의 일치를 통한 주문 상품의 추적성을 확보할 수 있는 운송 물류 추적 모델을 도출하였다. 문헌연구를 통해서 운송 물류 추적 모델에 가장 적합한 참조 모델로 허가형 퍼블릭 블록체인 모델을 선정하였고 운송 물류 추적 모델의 실용성 검증을 위한 비교 분석과 평가를 위해서 중앙집중형 모델과 블록체인 모델을 사용하였다. 본 논문에서 제안하고 있는 운송 물류 추적 모델은 실세계의 물류시스템과 통합되어 운송 물류의 추적을 통해서 운송 정보와의 불일치를 탐지하는데 사용될 수 있고 기업 이미지 제고를 위한 마케팅 도구로 활용될 수 있다.