• Journal of the Korea Society of Computer and Information
• /
• v.17 no.10
• /
• pp.155-165
• /
• 2012

This paper suggests traveling salesman problem algorithm that have been unsolved problem with NP-Hard. The proposed algorithm is a heuristic with edge-swap method. The classical method finds the initial solution starts with first node and visits to mostly adjacent nodes then decides the traveling path. This paper selects minimum weight edge for each nodes, then perform Min-Min method that start from minimum weight edge among the selected edges and Min-Max method that starts from maximum weight edges among it. Then we decide tie initial solution to minimum path length between Min-Min and Min-Max method. To get the final optimal solution, we apply previous two-opt to initial solution. Also, we suggest extended 3-opt and 4-opt additionally. For the 7 actual experimental data, this algorithm can be get the optimal solutions of state-of-the-art with fast and correct.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.7
• /
• pp.1309-1314
• /
• 2007

The assignment of cells to reporting or non-reporting cells is an NP-hard problem having an exponential complexity in the Reporting Cell Location Management (RCLM) system. Frequent location update may result in degradation of quality of service due to interference. Miss on the location of a mobile terminal will necessitate a search operation on the network when a call comes in. The number of reporting cells and which cell must be reporting cell should be determined to balance the registration (location update) and search (paging) operations to minimize the cost of RCLM system. T1is paper compares Max-Min ant system (MMAS), rank-based ant system (RAS) and hybrid method of MMAS and RAS that generally used to solve combinatorial optimization problems. Experimental results demonstrate that hybrid method of MMAS and RAS is an effective and competitive approach in fairly satisfactory results with respect to solution quality and execution time for the optimal design of location management system.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.21 no.10
• /
• pp.1561-1570
• /
• 1997

This study explores the treatment of the max-value cost function over a parameter interval in parametric optimization. To avoid the computational burden of the transformation treatment using an artificial variable, a direct treatment of the original max-value cost function is proposed. It is theoretically shown that the transformation treatment results in demanding an additional equality constraint of dual variables as a part of the Kuhn-Tucker necessary conditions. Also, it is demonstrated that the usability and feasibility conditions on the search direction of the transformation treatment retard convergence rate. To investigate numerical performances of both treatments, typical optimization algorithms in ADS are employed to solve a min-max steady-state response optimization. All the algorithm tested reveal that the suggested direct treatment is more efficient and stable than the transformation treatment. Also, the better performing of the direct treatment over the transformation treatment is clearly shown by constrasting the convergence paths in the design space of the sample problem. Six min-max transient response optimization problems are also solved by using both treatments, and the comparisons of the results confirm that the performances of the direct treatment is better than those of the tranformation treatment.

• International Journal of Internet, Broadcasting and Communication
• /
• v.10 no.2
• /
• pp.39-44
• /
• 2018

Wideness variation technique is compounded the smooth diffusivity-vibration status of the fulgurate-space realization level (FSRL) on the wideness realization morph. The realization level condition by the wideness realization morph system is associated with the diffusivity-vibration system. As to search a position of the dot situation, we are acquired of the wideness value with constructed-point point by the diffusivity upper structure. The concept of realization level is composed the reference of fulgurate-space level for variation signal by the wideness vibration morph. Further displaying a smooth variation of the FSRL of the maximum-minimum in terms of the diffusivity-vibration morph, and wideness position vibration that was the a wideness value of the far variation of the $Wid-rm-FA-{\alpha}_{MAX-MIN}$ with $23.24{\pm}3.37units$, that was the a wideness value of the convenient variation of the $Wid-rm-CO-{\alpha}_{MAX-MIN}$ with $7.83{\pm}1.32units$, that was the a wideness value of the flank variation of the $Wid-rm-FL-{\alpha}_{MAX-MIN}$ with $2.99{\pm}0.51units$, that was the a wideness value of the vicinage variation of the $Wid-rm-VI-{\alpha}_{MAX-MIN}$ with $0.51{\pm}(-0.01)units$. The diffusivity vibration will be to evaluate at the smooth ability of the diffusivity-vibration morph with constructed-point by the wideness realization level on the FSRL that is displayed the fulgurate-space morph by the realization level system. Diffusivity realization system will be possible to control of a morph by the special signal and to use a wideness data of diffusivity vibration level.

• Journal of Intelligence and Information Systems
• /
• v.2 no.1
• /
• pp.93-107
• /
• 1996

A flexible flow line(FFL) consists of several groups of identical machines. All work-orders flow along the same path through successive machine groups. Thus, we emphasized the balancing of workloads between machine groups in order to maximize total productivity. On the other hand, many different types of work-orders, in varying batch or lot sizes, are produced simultaneously. The mix of work-orders, their lot sizes, and the sequence in which they are produced affect the amount of workload. However, the work-orders and their lot sizes are prefixed and cannot be changed. Because of these reasons, we have developed an optimal route selection model using heuristic search and Min-Max algorithm for balancing the workload between machine groups in the FFL.

• Journal of Digital Convergence
• /
• v.20 no.2
• /
• pp.345-351
• /
• 2022

For simple undirected graph G=(V,E), L(2,1)-coloring of G is a nonnegative real-valued function f : V → [0,1,…,k] such that whenever vertices x and y are adjacent in G then |f(x)-f(y)|≥ 2 and whenever the distance between x and y is 2, |f(x)-f(y)|≥ 1. For a given L(2,1)-coloring c of graph G, the c-span is λ(c) = max{|c(v)-c(v)||u,v∈V}. L(2,1)-coloring number λ(G) = min{λ(c)} where the minimum is taken over all L(2,1)-coloring c of graph G. In this paper, based on Harary's Theorem, we use Tabu Search to figure out the existence of Hamiltonian Path in a complementary graph and confirmed that if λ(G) is equal to n(=|V|).

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.2
• /
• pp.19-25
• /
• 2008

When there are numerous wireless communication systems co-existing in the limited available frequency resource, an unexpected time delay can be caused during the system switching. So, in order to reduce this time delay, a mode selection method is required. In this paper, we propose a mode selection method to minimize the time delay for multi-system wireless communication systems. For the sake of efficiency, the mode selection method is designed by analyzing the preamble characteristics of different standards. Instead of performing a full search, we propose the preamble partial search to reduce the time delay to a minimum. Simulated with Matlab in an additive white Gaussian noise(AWGN) environment with a signal to noise ratio(SNR) of 10dB and bit error rate(BER) of $10^{-6}$, we evaluated and showed the performance improvement gained by using our proposed mode selection method.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.05a
• /
• pp.389-391
• /
• 2013

본 논문에서는 초음파 검사자가 효율적으로 충수염을 진단할 수 있도록 하기 위하여 초음파 영상에서 충수를 추출하는 방법을 제안한다. 충수를 추출하는 과정은 초음파 영상에서 Ends_in Search Stretching 기법을 적용하여 명암 대비를 강조하고, Max-Min 이진화, 영역 레이블링, 잡음 제거, Cubic Spline 보간법을 적용하여 복부 근육의 하단 근막 부분을 추출한다. 초음파 영상에서 추출된 근막 영역을 제거한 후, K-Means 클러스터링과 영역 레이블링을 적용하여 충수 영역을 추출한다. 제안된 방법을 초음파 영상을 대상으로 실험한 결과, 충수염을 진단하기에 적합한 충수 영역이 추출되는 것을 영상의학과 전문의를 통하여 확인하였다.

• Journal of Institute of Control, Robotics and Systems
• /
• v.13 no.11
• /
• pp.1112-1118
• /
• 2007

We propose a new-focusing method for test handlers of compact camera module (CCM), The MMD (max-min difference) method is applied to calculate the focus value quickly considering the noisy output of CCM. Also, the fuzzy search method is applied to find the maximum focus value effectively. We design a fuzzy processor to control the lens position by focus values and brightness values, which improves the focusing performance in the sense of speed and processor memory. The proposed method is implemented by computer program and installed at the CCM test handler machines. The simulation results are presented to verify the usefulness of the proposed method.

• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.2
• /
• pp.66-75
• /
• 2010

This paper proposes an efficient method for design and implementation of the artificial intelligence (AI) of 'omok' game on the GPU. The proposed AI is designed on a cooperative structure using min-max game tree and genetic algorithm. Since the evaluation function needs intensive computation but is independently performed on a lot of candidates in the solution space, it is computed on the GPU in a massive parallel way. The implementation on NVIDIA CUDA and the experimental results show that it outperforms significantly over the CPU, in which parallel game tree and genetic algorithm on the GPU runs more than 400 times and 300 times faster than on the CPU. In the proposed cooperative AI, selective search using genetic algorithm is performed subsequently after the full search using game tree to search the solution space more efficiently as well as to avoid the thread overflow. Experimental results show that the proposed algorithm enhances the AI significantly and makes it run within the time limit given by the game's rule.