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

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.5
• /
• pp.31-39
• /
• 2015

The degree-constrained minimum spanning tree (d-MST) problem is considered NP-complete for no exact solution-yielding polynomial algorithm has been proposed to. One thus has to resort to an heuristic approximate algorithm to obtain an optimal solution to this problem. This paper therefore presents a polynomial time algorithm which obtains an intial solution to the d-MST with the help of Kruskal's algorithm and performs k-opt on the initial solution obtained so as to derive the final optimal solution. When tested on 4 graphs, the algorithm has successfully obtained the optimal solutions.

• Journal of Dental Rehabilitation and Applied Science
• /
• v.37 no.3
• /
• pp.138-146
• /
• 2021

The diagnosis and treatment plan for forming ideal occlusal plane in full mouth rehabilitation are difficult because each process is complicated and information exchange between dentist and technician is subjective. The OP finder^® system simplifies this process and helps to deliver more objective and accurate information. In this case, full mouth rehabilitation was performed using OP finder^® system for patients with old bad fixed prosthesis and severely worn mandibular teeth, and reported that the result of proper occlusal plane setting and masticatory function recovery was obtained.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.12
• /
• pp.75-82
• /
• 2013

This paper proposes a $O(n^2)$ polynomial time algorithm to obtain optimal solution for Traveling Salesman problem that is a NP-complete because polynomial time algorithm has been not known yet. The biggest problem in a large-scale Traveling Salesman problem is the fact that the amount of data to be processed is $n{\times}n$, and thus as n increases, the data increases by multifold. Therefore, this paper proposes a methodology by which the data amount is first reduced to approximately n/2. Then, it seeks a bi-directional route at a random point. The proposed algorithm has proved to be successful in obtaining the optimal solutions with $O(n^2)$ time complexity when applied to TSP-1 with 26 European cities and TSP-2 with 46 cities of the USA. It could therefore be applied as a generalized algorithm for TSP.