• 한국정보디스플레이학회:학술대회논문집
• /
• 2009.10a
• /
• pp.964-967
• /
• 2009

A new hybrid-type touch screen panel (TSP) has been developed based on a-Si:H TFT which can detect the change of both $C_{LC}$ and photo-current. This TSP can detect the difference of $C_{LC}$ between touch and no-touch states in unfavorable conditions such as dark ambient light and shadows. The hybrid TSP sensor consists of a detection area which includes one TFT for photo sensing and two TFTs for amplification. Compared to a single internal capacitive TSP or an optical sensing TSP, this new proposed hybrid-type TSP enables larger sensing margin due to embedding of both optical and capacitive sensors.

• The KIPS Transactions:PartB
• /
• v.18B no.2
• /
• pp.73-82
• /
• 2011

There are a lot of people trying to solve the Traveling Salesman Problem (TSP) by using the Meta Heuristic Algorithms. TSP is an NP-Hard problem, and is used in testing search algorithms and optimization algorithms. Also TSP is one of the models of social problems. Many methods are proposed like Hybrid methods and Custom-built methods in Meta Heuristic. In this paper, we propose the S-MINE Algorithm to use the MINE Algorithm introduced in 2009 on the TSP.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.18 no.33
• /
• pp.111-118
• /
• 1995

This paper suggests a hybrid genetic algorithm for asymmetric traveling salesman problem(TSP). The TSP was proved to be NP-complete, so it is difficult to find optimal solution in reasonable time. Therefore it is important to develope an algorithm satisfying robustness. The algorithm applies dynamic programming to find initial solution. The genetic operator is uniform order crossover and scramble sublist mutation. And experiment of parameterization has been performed.

• The KSFM Journal of Fluid Machinery
• /
• v.15 no.2
• /
• pp.5-11
• /
• 2012

In this paper, the heat transfer coefficient measurement techniques using TSP(temperature sensitive paint) were introduced and the results of a comparative study on the heat transfer coefficient measurement by steady state and transient TSP techniques were discussed. The distributions of heat transfer coefficient by a single $60^{\circ}$ inclined impingement jet on a flat surface were measured by both techniques. Tested Reynolds number based on the jet diameter (d) was 30,000 and the distance between jet exit and target plate (L) was fixed at 10d. Results showed that the measured Nusselt number by both techniques indicated significant difference except near the center of impingement jet. Also, the heat transfer coefficients measured by the transient TSP technique were affected by the reference temperature of the jet. Based on the measured data, characteristics of both TSP techniques were analyzed and suggestions for applying them were also given.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.33 no.4
• /
• pp.58-68
• /
• 2010

Particle Swarm Optimization (PSO) which has been well known to solve continuous problems can be applied to discrete combinatorial problems. Several DPSO (Discrete Particle Swarm Optimization) algorithms have been proposed to solve discrete problems such as traveling salesman, vehicle routing, and flow shop scheduling problems. They are different in representation of position and velocity vectors, operation mechanisms for updating vectors. In this paper, the performance of 5 DPSOs is analyzed by applying to traditional Traveling Salesman Problems. The experiment shows that DPSOs are comparable or superior to a genetic algorithm (GA). Also, hybrid PSO combined with local optimization (i.e., 2-OPT) provides much improved solutions. Since DPSO requires more computation time compared with GA, however, the performance of hybrid DPSO is not better than hybrid GA.

• Journal of Korean Institute of Industrial Engineers
• /
• v.33 no.2
• /
• pp.201-212
• /
• 2007

Genetic algorithms (GAs) are very useful methods for global search and have been applied to various optimization problems. They have two kinds of important search mechanisms, crossover and mutation. Because the performance of GAs depends on these operators, a large number of operators have been developed for improving the performance of GAs. Especially, many researchers have been more interested in a crossover operator than a mutation operator. The reason is that a crossover operator is a main search operator in GAs and it has a more effect on the search performance. So, we also focus on a crossover operator. In this paper we first investigate the drawback of various crossovers, especially subtour-based crossovers and then introduce a new crossover operator to avoid such drawback and to increase efficiency. Also we compare it with several crossover operators for symmetric traveling salesman problem (STSP) for showing the performance of the proposed crossover. Finally, we introduce an efficient simple hybrid genetic algorithm using the proposed operator and then the quality and efficiency of the obtained results are discussed.

• International Journal of Computer Science & Network Security
• /
• v.23 no.6
• /
• pp.193-201
• /
• 2023

In this paper, we consider the maximum scatter traveling salesman problem (MSTSP), a travelling salesman problem (TSP) variant. The problem aims to maximize the minimum length edge in a salesman's tour that travels each city only once in a network. It is a very complicated NP-hard problem, and hence, exact solutions can be found for small sized problems only. For large-sized problems, heuristic algorithms must be applied, and genetic algorithms (GAs) are found to be very successfully to deal with such problems. So, this paper develops a hybrid GA (HGA) for solving the problem. Our proposed HGA uses sequential sampling algorithm along with 2-opt search for initial population generation, sequential constructive crossover, adaptive mutation, randomly selected one of three local search approaches, and the partially mapped crossover along with swap mutation for perturbation procedure to find better quality solution to the MSTSP. Finally, the suggested HGA is compared with a state-of-art algorithm by solving some TSPLIB symmetric instances of many sizes. Our computational experience reveals that the suggested HGA is better. Further, we provide solutions to some asymmetric TSPLIB instances of many sizes.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.6
• /
• pp.661-667
• /
• 2005

In this paper, we propose a new hybrid genetic algorithm for sequential ordering problem (SOP). In the proposed genetic algorithm, the Voronoi quantized crossover (VQX) is used as a crossover operator and the path-preserving 3-Opt is used as a local search heuristic. VQX is a crossotver operator that uses the epistasis information of given problem instance. Since it is a crossover proposed originally for the traveling salesman problem (TSP), its application to SOP requires considerable modification. In this study, we appropriately modify VQX for SOP, and develop three algorithms, required in the modified VQX, named Feasible solution Generation Algorithm, Precedence Cycle Decomposition Algorithm, and Genic Distance Assignment Method. The results of the tests on SOP instances obtained from TSPLIB and ZIB-MP-Testdata show that the proposed genetic algorithm outperforms other genetic algorithms in stability and solution quality.

• Proceedings of the Korean Vacuum Society Conference
• /
• 2013.02a
• /
• pp.413-413
• /
• 2013

대면적 터치패널은 현재까지 저항막 방식, 적외선, Camera 방식을 주로 사용하고 있다. 저항막 방식의 Sensitivity, 높은 가격, 적외선 방식의 경우 빛의 간섭에 의한 오동작이 일어날 수 있는 문제를 가지고 있다. 최근의 Mobile용 터치스크린은 정전용량 방식의 터치기술 채택으로 저항막, 적외선, Camera 방식의 모든 단점을 해소할 수 있으나 터치 스크린 면적이 커지게 되면서 요구저항을 맞출 수 없는 문제로 현재 크기의 제한적이다. 본 연구에서는 완전일체형 터치(G2 Touch Hybrid) 방식의 ITO 터치필름을 사용하지 않고, 강화유리 기판을 사용하여 저(低)저항, 고(高)투과, 대형화(15 Inch), 경량화를 고려한 Zero-gap ITO를 코팅한 커버 유리용 투명전극에 대하여 전기적, 광학적, 구조적, 표면적 특성을 분석하였다. ITO 박막의 두께를 최소화하여 패턴 인비저블의 특성을 갖는 것이 필요로 하는데, 이는 ITO박막 패턴후에 패턴이 보이지 않게 하기 위해서이며, 이러한 시장의 요구를 충족하기 위해 RF/DC 고자력 Magnetron Sputtering System을 사용하여 면저항 $80{\Omega}$/${\Box}$, 표면특성 Rp-v 2.1 nm, 최고 광투과율 90.5%@550 nm, 반사율 차이 0.5 이하의 특성을 확인하였다. 또한, 저항 경시변화를 줄이기 위해서 Sheath heater를 이용한 진공코팅 중 발생되는 BM Ink out-gassing을 줄여 out-gassing에 의한 박막 손상을 줄일 수 있었으며 진공 성막중 결정성을 갖는 ITO 막을 형성시킬 수 있었다.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.6
• /
• pp.2269-2275
• /
• 2010

The performance of Genetic Algorithms (GA) is affected by various factors such as parameters, genetic operators and strategies. The traditional approach with random initial population is efficient however the whole initial population may contain many infeasible solutions. Thus it would take a long time for GA to produce a good solution. The GA have been modified in various ways to achieve faster convergence and it was particularly recognized by researchers that initial population greatly affects the performance of GA. This study proposes modified GA with sorted initial population and applies it to solving Travelling Salesman Problem (TSP). Normally, the bigger the initial the population is the more computationally expensive the calculation becomes with each generation. New approach allows reducing the size of the initial problem and thus achieve faster convergence. The proposed approach is tested on a simulator built using object-oriented approach and the test results prove the validity of the proposed method.