• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.15 no.5
• /
• pp.2724-2731
• /
• 2014

As the future national defense plan of government focus on advanced weapon system, military maintenance facility becomes more important. However, military maintenance facility has been managed by director's experience and simple mathematical calculation until now. Thus, the optimization for the management of military maintenance facility is suggested by more scientistic and logical methods in this study. The study follows the procedure below. First, simulation is designed according to the analysis of military maintenance facility. Second, independent variable and dependent variable are defined for optimization. Independent Variable includes the number of maintenance machine, transportation machine, worker in the details of military maintenance facility operation, and dependent variable involves total maintenance time affected by independent variable. Third, warmup analysis is performed to get warmup period, based on the simulation model. Fourth, the optimal combination is computed with evolution strategy, meta-heuristic, to enhance military maintenance management. By the optimal combination, the management of military maintenance facility can gain the biggest effect against the limited cost. In the future, the multipurpose study, to analyze the military maintenance facility covering various weapon system equipments, will be performed.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.20 no.6
• /
• pp.314-321
• /
• 2019

The Self-Adaptive Vision Correction Algorithm (SAVCA) developed in this study was suggested for improving usability by modifying four parameters (Modulation Transfer Function Rate, Astigmatic Rate, Astigmatic Factor and Compression Factor) except for Division Rate 1 and Division Rate 2 among six parameters in Vision Correction Algorithm (VCA). For verification, SAVCA was applied to two-dimensional mathematical benchmark functions (Six hump camel back / Easton and fenton) and 30-dimensional mathematical benchmark functions (Schwefel / Hyper sphere). It showed superior performance to other algorithms (Harmony Search, Water Cycle Algorithm, VCA, Genetic Algorithms with Floating-point representation, Shuffled Complex Evolution algorithm and Modified Shuffled Complex Evolution). Finally, SAVCA showed the best results in the engineering problem (speed reducer design). SAVCA, which has not been subjected to complicated parameter adjustment procedures, will be applicable in various fields.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.9
• /
• pp.1193-1201
• /
• 2020

Cell planning, which determines the cell structure for location management of mobile terminals in mobile communications, has been dealt with as an important research task to determine network performance. Among the factors influencing the cell structure planning in mobile communication, the signal cost for location management plays the most important role. In this paper, we propose an optimization algorithm that minimizes the location management cost of all the cells used to plan the cell structure in the network with reporting cell structure in mobile communication. The proposed algorithm uses a Tabu search algorithm, which is a meta-heuristic algorithm, and the proposed algorithm proposes a new neighborhood generation method to obtain a result close to the optimal solution. In order to evaluate the performance of the proposed algorithm, the simulation was performed in terms of location management cost and algorithm execution time. The evaluation results show that the proposed algorithm outperforms the existing genetic algorithm and simulated annealing.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.3
• /
• pp.177-183
• /
• 2022

There is no known polynomial time algorithm for QAP that is a NP-complete problem. This paper suggests O(n²) polynomial time algorithm for random type quadratic assignment problem (QAP). The proposed algorithm suggests incremental augmenting matching strategy that is to set the matching set M={(l_i,f_j)} from l_i with minimum sum of distance in location matrix L and f_j with maximum sum of quantity in facility matrix F, and incremental augmenting of matching set M from M to l_i with minimum sum of distance and to f_j with maximum sum of quantity. Finally, this algorithm performs swap strategy that is to reflect the complex correlations of distances in locations and quantities in facilities. For the experimental data, this algorithm, in spite of O(n²) polynomial time algorithm, can be improve the solution than genetic algorithm a kind of metaheuristic method.

• Journal of the Korea Society for Simulation
• /
• v.19 no.1
• /
• pp.73-82
• /
• 2010

Productivity improvement is considered as one of hot potato topics in international shipyards by the increasing amount of orders. In order to improve productivity of lines, shipbuilders have been researching and developing new work method, process automation, advanced planning and scheduling and so on. An optimization approach was accomplished on short-term scheduling of subassembly lines in this research. The problem of subassembly line scheduling turned out to be a non-deterministic polynomial time problem with regard to SKID pattern’s sequence and worker assignment to each station. The problem was applied by simulated annealing algorithm, one of meta-heuristic methods. The algorithm was aimed to avoid local minimum value by changing results with probability function. The optimization result was compared with discrete-event simulation's to propose what pros and cons were. This paper will help planners work on scheduling and decision-making to complete their task by evaluation.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2021.06a
• /
• pp.429-429
• /
• 2021

2019년 발생한 인천광역시 붉은 수돗물 사태로 급수구역에 포함된 26만 1천 세대, 63만 5천 명이 직·간접적인 피해를 입은 바 있다. 경제적 피해액으로 추정할 경우 최소 1,280억 원 이상으로 보고된 바 있으며, 이와 같은 상수관망의 수질사고 확산은 장기간 동안 시민의 건강과 생활환경 수준을 저하시킨다. 따라서 상수도시스템의 수질사고확산 모델링 및 방지기술을 통한 수질안전성의 재확인이 필요하며, 이것은 상수도시스템의 지속가능성을 높여 국민이 체감하는 물 환경 수준 제고에 기여가 가능하다. 관망 내 수질해석을 직접적으로 수행하는 모델은 국외적으로 다양하게 개발(PODDS, EPANET-MSX, EPANET2.2 등)된 바 있으나 검·보정을 위한 수질측정 자료 부족 등으로 적용이 제한적이라는 한계가 현재에도 존재한다. 이를 보완하기 위해 수질자료에 비해 그 양이 많고 획득방법이 상대적으로 수월한 수리학적 계측자료 및 해석결과를 활용한 관로 내 체류시간 등을 활용한 연구가 수행된 바 있다. 그러나 이와 같은 수리학적 해석 결과를 활용하는 경우에도 계측자료를 기반으로 한 수리학적 검·보정은 필수적이라 할 수 있다. 본 연구에서는 관로 내 체류시간에 직접적인 영향을 미치는 유량 및 유속자료를 중심으로 수리학적 관망해석의 결과를 최적 검·보정하는 방법론을 제안하였다. 기존 상수관망 수리해석의 검·보정은 일부 지점에서 수압을 측정하고, 수리해석 결과로 도출되는 해당 지점의 수압이 실측된 결과와 유사하도록 관로의 유속계수를 적절히 보정하는 형태로 진행되었다. 그러나 본 연구에서는 관로유량과 유속자료의 목적함수 내 가중치를 수압자료보다 크게 설정하여 체류시간 중심의 검·보정이 수행될 수 있도록 하였으며, 검·보정 대상인자 역시 대수용가의 수요량, 수요패턴, 그리고 관로유속계수로 확장된 모형을 구축하였다. 최적화 기법으로는 메타휴리스틱 기법중 하나인 화음탐색법을 활용하였다. EPANET 2.2 Toolkit과 Visual Basic .Net을 연계하여 프로그래밍하였으며, 개발된 모형을 실제 지방상수도 시스템에 적용하여 분석하였다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.793-796
• /
• 2008

본 논문은 생산 물류 시스템최적화의 실현에 가장 대표적인 생산수송계획문제인 수송문제(TP: Transportation Problem)에 고정비용을 고려한 고정비용 수송문제(fcTP: Fixed charge Transportation Problem)를 다룬다. 특히 NP-hard문제로 널리 알려진 TP에서 수송량에 비례하는 가변비용과 함께 추가적으로 모든 경로에서 발생하는 고정비용을 함께 고려한 fcTP를 다룬다. 따라서 이러한 fcTP를 해결하기 위해 메타 휴리스틱기법 중에 가장 널리 이용되고 있는 유전 알고리즘(CA: Genetic Algorithm)을 이용한 해법을 제시하고자 한다. 본 논문에서는 CA를 이용해 고정비용 수송문제의 해를 우선순위기반 유전자 표현법을 이용해 fcTP에 적용해 보고 수치 실험을 통해 그 성능에 대한 연구를 한다.

• IE interfaces
• /
• v.24 no.4
• /
• pp.281-294
• /
• 2011

This paper considers the rail crane scheduling problem which is defined as determining the sequence of loading/unloading container on/from a freight train. The objective is to minimize the weighted sum of the range of order completion time and makespan. The range of order completion time implies the difference between the maximum of completion time and minimum of start time of each customer order consisting of jobs. Makespan refers to the time when all the jobs are completed. In a rail freight terminal, logistics firms as a customer wish to reduce the range of their order completion time. To develop a methodology for the crane scheduling, we formulate the problem as a mixed integer program and develop three metaheuristics, namely, genetic algorithm, simulated annealing, and tabu search. To validate the effectiveness of heuristic algorithms, computational experiments are done based on a set of real life data. Results of the experiments show that heuristic algorithms give good solutions for small-size and large-size problems in terms of solution quality and computation time.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.7
• /
• pp.1416-1427
• /
• 2012

This paper proposes a design technique of a survivable ship backbone network, which describes a near optimal configuration scheme of physical and logical topologies of which the survivable ship backbone network consists. We first analyze and present an efficient architecture of a survivable ship backbone network consisting of redundant links and ship devices with dual communication interfaces. Then, we present an integer linear programming-based configuration scheme of a physical topology with regard to the proposed ship backbone network architecture. Finally, we present a metaheuristic-based configuration scheme of a logical topology, underlying the physical topology.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.969-972
• /
• 2007

수송문제는 산업공학 및 전자계산학 분야에서 중요한 문제 중의 하나로 인식된다. 수송문제가 시설을 수립하거나 고객들의 요구를 이행하기 위한 추가적인 고정 비용과 연관될 때, 이를 고정비용을 고려한 비선형 수송문제(Fixed Charge Non-linear Transportation Problem)라 한다. 고정비용을 고려한 비선형 수송문제는 한 종류의 상품을 다수의 공급처에서 다수의 수급처로 수송할 때, 수송비용과 고정비용이 최소가 되도록 수송량을 결정하는 문제이다. 본 논문에서는 이 비선형 수송문제에 가장 많이 쓰이는 메타 휴리스틱 방법들 중 유전 알고리즘을 이용한 해법을 제시한다. 유전 알고리즘을 적용함에 있어서 가장 중요한 것 중에 하나는 해의 유전자표현을 어떻게 나타낼 것인가 인데, 본 논문에서는 수송문제의 해를 걸침나무로 표현할 수 있다는 점에 착안하여 유전자 표현법들을 수송문제에 적용해 보고 수치 실험을 통해 그 성능에 대한 비교를 한다.