• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.4
• /
• pp.572-580
• /
• 2021

In order to reduce transmission delay and increase reliability in networks, mainly high-performance and high-power network equipment is used to guarantee network quality. In this paper, we propose an optimization algorithm to minimize the energy consumed when transmitting traffic in networks with a bundle link composed of multiple physical cables. The proposed optimization algorithm is a meta-heuristic method, which uses tabu search algorithm. In addition, it is designed to minimize transmission energy by minimizing the cables on the paths of the source and destination nodes for each traffic. In the proposed optimization algorithm, performance evaluation was performed in terms of the number of cables used in the transmission and the link utilization for all traffic on networks, and the performance evaluation result confirmed the superior performance than the previously proposed method.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.44 no.2
• /
• pp.58-65
• /
• 2021

Meta-heuristic algorithms have been developed to efficiently solve difficult problems and obtain a global optimal solution. A common feature mimics phenomenon occurring in nature and reliably improves the solution through repetition. And at the same time, the probability is used to deviate from the regional optimal solution and approach the global optimal solution. This study compares the algorithm created based on the above common points with existed SA and HS to show advantages in time and accuracy of results. Existing algorithms have problems of low accuracy, high memory, long runtime, and ignorance. In a two-variable polynomial, the existing algorithms show that the memory increases and the accuracy decrease. In order to improve the accuracy, the new algorithm increases the number of initial inputs and increases the efficiency of the search by introducing a direction using vectors. And, in order to solve the optimization problem, the results of the last experiment were learned to show the learning effect in the next experiment. The new algorithm found a solution in a short time under the experimental conditions of long iteration counts using a two-variable polynomial and showed high accuracy. And, it shows that the learning effect is effective in repeated experiments.

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

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.4
• /
• pp.571-581
• /
• 2022

Wireless sensor networks use the concept of connected dominating sets that can form virtual backbones for effective routing and broadcasting. In this paper, we propose an optimization algorithm that configures a connected dominating sets in order to balance the load of nodes to increase network lifetime and to perform effective routing. The proposed optimization algorithm in this paper uses the metaheuristic method of tabu search algorithm, and is designed to balance the number of dominatees in each dominator in the constituted linked dominance set. By constructing load-balanced connected dominating sets with the proposed algorithm, it is possible to extend the network lifetime by balancing the load of the dominators. The performance of the proposed tabu search algorithm was evaluated the items related to load balancing on the wireless sensor network, and it was confirmed in the performance evaluation result that the performance was superior to the previously proposed method.

• Journal of the Korea Society of Computer and Information
• /
• v.27 no.2
• /
• pp.1-8
• /
• 2022

In this paper, we design and implement a GPU-based parallel algorithm to effectively solve the traveling salesman problem through an ant color system. The repetition process of generating hundreds or thousands of tours simultaneously in TSP utilizes GPU's task-level parallelism, and the update process of pheromone trails data actively exploits data parallelism by 32x32 thread blocks. In particular, through simultaneous memory access of multiple threads, the coalesced accesses on continuous memory addresses and concurrent accesses on shared memory are supported. This experiment used 127 to 1002 city data provided by TSPLIB, and compared the performance of sequential and parallel algorithms by using Intel Core i9-9900K CPU and Nvidia Titan RTX system. Performance improvement by GPU parallelization shows speedup of about 10.13 to 11.37 times.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.15 no.5
• /
• pp.299-307
• /
• 2022

Harmony Search (HS) is a relatively recently developed meta-heuristic optimization algorithm, and various studies have been conducted on it. HS is based on the musician's improvisational performance, and the objective variables play the role of the instrument. However, each instrument is given only a sound range, and there is no concept of a scale that can be said to be the basis of music. In this study, the performance of the algorithm is improved by introducing a scale to the existing HS and quantizing the bandwidth. The introduced scale was applied to HM initialization instead of the existing method that was randomly initialized in the sound band. The quantization step can be set arbitrarily, and through this, a relatively large bandwidth is used at the beginning of the algorithm to improve the exploration of the algorithm, and a small bandwidth is used to improve the exploitation in the second half. Through the introduction of scale and bandwidth quantization, it was possible to reduce the algorithm performance deviation due to the initial value and improve the algorithm convergence speed and success rate compared to the existing HS. The results of this study were confirmed by comparing examples of optimization values for various functions with the conventional method. Specific comparative values were described in the simulation.

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

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.1
• /
• pp.9-15
• /
• 2009

Ant Colony System is new meta heuristic for hard combinatorial optimization problem. The original ant colony system accomplishes a pheromone updating about only the global optimal path using global updating rule. But, If the global optimal path is not searched until the end condition is satisfied, only pheromone evaporation happens to no matter how a lot of iteration accomplishment. In this paper, the length of the global optimal path does not improved within the limited iterations, we evaluates this state that fall into the local optimum and selects the next node using changed parameters in the state transition rule. This method has effectiveness of the search for a path through diversifications is enhanced by decreasing the value of parameter of the state transition rules for the select of next node, and escape from the local optima is possible. Finally, the performance of Best and Average_Best of proposed algorithm outperforms original ACS.

• 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을 연계하여 프로그래밍하였으며, 개발된 모형을 실제 지방상수도 시스템에 적용하여 분석하였다.