• Title/Summary/Keyword: TSP 알고리듬

Search Result 4, Processing Time 0.019 seconds

2 Dimensional TSP Modeling Using Finite Element Method (유한 요소법을 이용한 2차원 TSP 모델링)

  • Lee, Hong;Suh, Jung-Hee;Shin, Chang-Soo
    • Geophysics and Geophysical Exploration
    • /
    • v.6 no.1
    • /
    • pp.13-22
    • /
    • 2003
  • TSP (Tunnel Seismic Profiling) survey is a technique for imaging and characterizing geological structures ahead of a tunnel face. The seismic modeling algorithm and the synthetic data could be helpful for TSP surveys. However, there is few algorithm to describe the propagation of the elastic waves around the tunnel. In this study, existing 2-dimensional seismic modeling algorithm using finite element method was modified to make a suitable algorithm for TSP modeling. Using this algorithm, TSP modeling was practiced in some models. And the synthetic data was analyzed to examine the propagation characteristics of the elastic waves. First of all, the modeling for the homogeneous tunnel model was practiced to examine the propagation characteristics of the direct waves in the vicinity of the tunnel. And the algorithm was applied to some models having reflector which is perpendicular or parallel to the excavation direction. From these, the propagation characteristics of the reflected waves were examined. Furthermore, two source-receiver arrays were used in respective models to investigate the properties of the two arrays. These modeling algorithm and synthetic data could be helpful in interpreting TSP survey data, developing inversion algorithm and designing new source-receiver arrays.

An Efficient Algorithm based on Self-Organizing Feature Maps for Large Scale Traveling Salesman Problems (대규모 TSP과제를 효과적으로 해결할 수 있는 SOFM알고리듬)

  • 김선종;최흥문
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.30B no.8
    • /
    • pp.64-70
    • /
    • 1993
  • This paper presents an efficient SOFM(self-organizing feature map) algorithm for the solution of the large scale TSPs(traveling salesman problems). Because no additional winner neuron for each city is created in the next competition, the proposed algorithm requires just only the N output neurons and 2N connections, which are fixed during the whole process, for N-city TSP, and it does not requires any extra algorithm of creation of deletion of the neurons. And due to direct exploitation of the output potential in adaptively controlling the neighborhood, the proposed algorithm can obtain higher convergence rate to the suboptimal solutions. Simulation results show about 30% faster convergence and better solution than the conventional algorithm for solving the 30-city TSP and even for the large scale of 1000-city TSPs.

  • PDF

The Development of a Tour Route Guidance System Using a Traveling Salesman Problem Algorithm (TSP 알고리듬을 이용한 관광노선 안내 시스템 개발)

  • 정영아;구자용
    • Spatial Information Research
    • /
    • v.11 no.3
    • /
    • pp.275-289
    • /
    • 2003
  • This study focused on offering a helpful information for the touring. To develop a tour route guidance tool, it is needed to use a GIS function, which can suggest a possible shortest path based on time and distance. A Traveling salesman problem algorithm, which was developed to solve multi destination problem in network analysis, was used to implement a tour guidance system. This system was developed using ArcObjects programming components within ArcGIS 8.3. Jeju city was selected for the case study to apply the tool and to test the effectiveness of it. This study demonstrated that this tool was considerably effective for finding a probable optimum tour path in the following aspects. First, it can help tourists to select several attractions from numerous tour sites in an area given limited time. Second, tourist can manage time efficiently by organizing their tour courses on the basis of the tool. Third, tourists can reduce the uncertainties that may happen under unexpected situations in unfamiliar places by obtaining specific spatial information using the tool. Fourth, the Graphic User Interface of the tool can be easily used to obtain visual information of spatial data.

  • PDF

Optimal Teaching for a Spot Welding Robot Using CAD Data (CAD 데이타를 이용한 용접용 로보트의 최적 교시)

  • Yi, Soo-Yeong;Chung, Myung-Jin;Bien, Zeung-Nam
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.27 no.10
    • /
    • pp.24-33
    • /
    • 1990
  • Since a number of welding points are distributed in an automobile part, the number of welding points alloted to each robot are large. So, there is an increasing need of an optimal sequence planning to minimize the total welding time. In this paper, an off-line programming scheme for effective teaching of a spot welding robot is presented. A collision free, optimal welding sequence planning is done through applying the modified Traveling Salesman Problem algorithm. Also, a data extraction method from an existing general CAD system is presented for reuse of the existing exact model data produced by a model designer and easy constructing the world model data base. The result show that the proposed system could enhance the efficiency of spot welding robot in automobile industry.

  • PDF