• Korean Journal of Computational Design and Engineering
• /
• v.2 no.1
• /
• pp.1-10
• /
• 1997

Finding the optimum route of ship's pipes is complicated and time-consuming process. Experience of designers is the main tool in this process. To reduce design man-hours and human errors a design expert system shell and a geometric modeler is used to automate the design process. In this paper, a framework of the intelligent CAD system for pipe auto-routing is suggested, which consists of general-purpose expert system shell and a geometric modeler. The design expert system and the geometric modeling kernel have been integrated. The CADDS5 of Computervision is used as the overall CAD environment. The Nexpert Object of Neuron Data is used as the expert system shell. The CADDS5 ISSM is used as the interface that creates and modifies geometric models of pipes. Existing algorithms for the routing problem have been analyzed. Most of them are to solve the 2-D circuit routing problems. Ship piping system, specially within the engine room, is a complicated, large scale 3-D routing problem. Methods of expert system have been used to find the route of ship pipes on the main deck.

• Journal of the Society of Naval Architects of Korea
• /
• v.42 no.1 s.139
• /
• pp.57-63
• /
• 2005

This paper introduces basic research of optimum routing assessment system as voyage support purpose which can obtain safe and efficient route. In view point of safety, the prediction of ship motion should be evaluated in the condition of rough weather This part includes general seakeeping estimation based on 3 dimensional panel method and parametric roil prediction. For increasing voyage efficiency, ETA(Estimated Time of Arrival) and fuel consumption should be calculated considering speed reduction and power increase due to wave effects based on added resistance calculation and ship performance characteristics. Basically, the weather forecast is assumed to be prepared previously to operate this system. The idea of these factors in this system will be helpful to escape from dangerous voyage situation by wave conditions and to make optimum route planning based on ETA and fuel consumption.

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

The precise prediction of ships propulsion performance is very important to find out the ships optimum route. This paper describes the development of computer program to generate the database of propulsion performance for the ships optimum routing system. The propulsion performance of ship in the sea is caused by not only ships conditions such as drift and hull roughness, but also various sea conditions such as wave and wind. These prediction methods of added resistance are based on the ships speed trial analysis methods of the ISO 15016:2002 standard, and a few prediction methods of the wind and hull roughness are supplemented. These prediction methods have been applied to the comprehensive computer program. And the database calculation for the research ice breaker the Araon has been carried out, which shall be used for the calculation of optimum route. Furthermore, this program shall be used for the route optimization in global shipping routes.

• Management Science and Financial Engineering
• /
• v.11 no.2
• /
• pp.45-60
• /
• 2005

This paper investigates the application of the computer method COMSOAL (Computer Method of Sequencing Operations for Assembly Lines) to the process routing (PR) problem with multiple objectives. In any computer aided process planning (CAPP) system, one of the most critical activities for manufacturing a part could be to generate the sequence that optimizes production time, production cost, machine utilization or with multiple these criteria. The COMSOAL has been adopted to find the optimum sequence of operations that optimizes two major conflicting criteria : production cost and production quality. The COMSOAL is here slightly modified to simultaneously generate and evaluate a set of possible solutions (called as population) instead of processing a solution stepwise in each iteration. The significant features of the COMSOAL include : no parameters settings needed, and a guarantee of feasible solutions. Experimental results show that COMSOAL is a simple but powerful method to quickly generate multiple feasible solutions which are as good as the ones obtained from several other well-known process routing algorithms.

• Korean Management Science Review
• /
• v.30 no.2
• /
• pp.31-42
• /
• 2013

The vehicle routing problem (VRP) can be described as a problem to find the optimum traveling routes from one or several depot (s) to number of geographically scattered customers. This study executes a revised Heterogeneous Vehicle Routing Problem (HVRP) to minimize the cost that needs to conduct efficiently the snow removal operations of Air Wing under available resources and limited operations time. For this HVRP, we model the algorithm of an hybrid Ant Colony System (ACS). In the initial step for finding a solution, the modeled algorithm applies various alterations of a parameter that presents an amount of pheromone coming out from ants. This improvement of the initial solution illustrates to affect to derive better result ultimately. The purpose of this study proves that the algorithm using Hybrid heuristic incorporated in tabu and ACS develops the early studies to search best solution.

• Water Engineering Research
• /
• v.2 no.2
• /
• pp.113-121
• /
• 2001

The objective of this study is to develop a prediction mode for a flood forecasting system in the downstream of the Nakdong river basin. Ranging from the gauging station at Jindong to the Nakdong estuary barrage, the hydraulic flood routing model(DWOPER) based on the Saint Venant equation was calibrated by comparing the calculated river stage with the observed river stages using four different flood events recorded. The upstream boundary condition was specified by the measured river stage data at Jindong station and the downstream boundary condition was given according to the tide level data observed at he Nakdong estuary barrage. The lateral inflow from tributaries were estimated by the rainfall-runoff model. In the calibration process, the optimum roughness coefficients for proper functions of channel reach and discharge were determined by minimizing the sum of the differences between the observed and the computed stage. In addition, the forecasting lead time on the basis of each gauging station was determined by a numerical simulation technique. Also, we suggested a model structure for a real-time flood forecasting system and tested it on the basis of past flood events. The testing results of the developed system showed close agreement between the forecasted and observed stages. Therefore, it is expected that the flood forecasting system we developed can improve the accuracy of flood forecasting on the Nakdong river.

• Journal of Korean Society of Transportation
• /
• v.22 no.5
• /
• pp.89-97
• /
• 2004

The Korea Air Force(KAF) has operated freight flights based on the prefixed time and route schedule, which is adjusted once in a month. The major purpose of the operation of freight flights in the KAF is to distribute necessary supplies from the home air base to other air bases. The secondary purpose is to train the young pilots to get more experiences in navigation. Each freight flight starts from and returned to the home air base everyday except holidays, while it visits several other air bases to accomplish its missions. The study aims to forecast freight demand at each base by using time series analysis, and then it tried to optimize the cost of operating flights by solving vehicle routing problem. For more specifically, first, several constraints in operating cargos were defined by reviewing the Korea Air Force manuals and regulation. With such constraints, an integer programming problem was formulated for this specific routing problem allowing several visits in a tour with limitation of maximum number of visits. Then, an algorithm to solve the routing problem was developed. Second, the time series analysis method was applied to find out the freight demand at each air base from the mother air base in the next month. With the forecasted demands and the developed solution algorithm, the oprimum routes are calculated for each flight. Finally, the study compared the solved routing system by the developed algorithm with the existing routing system of the Korea Air Force. Through this comparison, the study proved that the proposed method can provide more (economically) efficient routing system than the existing system in terms of computing and monetary cost. In summary, the study suggested objective criteria for air routing plan in the KAF. It also developed the methods which could forecast properly the freight demands at each bases by using time series analysis and which could find the optimum routing which minimizes number of cargo needed. Finally, the study showed the economical savings with the optimized routing system by using real case example.

• Journal of Korean Society of Transportation
• /
• v.23 no.4 s.82
• /
• pp.81-91
• /
• 2005

The Traveling Salesman Problem(TSP) is one of the NP-complete (None-deterministic Polynomial time complete) route optimization problems. Its calculation time increases very rapidly as the number of nodes does. Therefore, the near optimum solution has been searched by heuristic algorithms rather than the real optimum has. This paper reviews the Ant System Algorithm(ANS), an heuristic algorithm of TSP and its applicability in the parcel delivery service in Korea. ASA, which is an heuristic algorithm of NP-complete has been studied by M. Dorigo in the early 1990. ASA finds the optimum route by the probabilistic method based on the cumulated pheromone on the links by ants. ASA has been known as one of the efficient heuristic algorithms in terms of its calculation time and result. Its applications have been expanded to vehicle routing problems, network management and highway alignment planning. The precise criteria for vehicle routing has not been set up in the parcel delivery service of Korea. Vehicle routing has been determined by the vehicle deriver himself or herself. In this paper the applicability of ASA to the parcel delivery service has been reviewed. When the driver s vehicle routing is assumed to follow the Nearest Neighbor Algorithm (NNA) with 20 nodes (pick-up and drop-off places) in $10Km{\times}10Km$ service area, his or her decision was compared with ASA's one. Also, ASA showed better results than NNA as the number of nodes increases from 10 to 200. If ASA is applied, the transport cost savings could be expected in the parcel delivery service in Korea.

• Journal of the Society of Naval Architects of Korea
• /
• v.52 no.2
• /
• pp.110-118
• /
• 2015

Weather routing method is one of the best practices of SEEMP (Ship Energy Efficiency Management Plan) for fuel-efficient operation of ship. KR is carrying out a basic research for development of the weather routing algorithm and making a monitoring system by FOC (Fuel Oil Consumption) analysis compared to the reference, which is the great circle route. The added resistances applied global sea/weather data can be calculated using ship data, and the results can be corrected to ship motions. The global sea/weather data such as significant wave height, ocean current and wind data can be used to calculate the added resistances. The reference route in a usual navigation is the great circle route, which is the shortest distance route. The global sea/weather data can be divided into grids, and the nearest grid data from a ship's position can be used to apply a ocean going vessel's sea conditions. Powell method is used as an optimized routing technique to minimize FOC considered sea/weather conditions, and FOC result can be compared with the great circle route result.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.35 no.1
• /
• pp.140-147
• /
• 2012

Vehicle routing problem is one of the traveling salesman problems with various conditions such as vehicle capacity limits, delivery time windows, as well as time dependent speeds in metropolitan area. In this research hourly vehicle moving speeds information in a typical metropolitan area are analyzed to use the results in the design procedure of VRP heuristic. Quality initial vehicle routing solutions can be obtained with adaption of the analysed results of the time periods with no vehicle speed changes. This strategy makes complicated time dependent vehicle speed simple to solve. Time dependent vehicle speeds are too important to ignore to obtain optimum vehicle routing search for real life logistics systems.