• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.11
• /
• pp.1-6
• /
• 2010

In Sensor Networks, the problem of finding the optimal routing path dynamically, which passes through all terminals or nodes once per each, may come up. Providing a generalized scheme of approximations that can be applied to the kind of problems, and formulating the bounds of the run time and the results of the algorithm made from the scheme, one may evaluate mathematically the routing path formed in a given network. This paper, dealing with Euclidean TSP(Euclidean Travelling Sales Person) that represents such problems, provides the scheme for constructing the approximated Euclidean TSP by parallel computing, and the ground for determining the difference between the approximated Euclidean TSP produced from the scheme and the optimal Euclidean TSP.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.5
• /
• pp.19-27
• /
• 2007

We have implemented a WWW homepage which finds an optimal route for users. There already exist many web sites which provide the optimal route when a start and a destination cities are given. However, none of them can find the optimal route when a number of cities to be visited. The problem of finding the optimal route starting at a given start city and visiting through all the given intermediate cities and finally returning to the start city is called Travelling Sales Person(TSP) problem. TSP is a well known exponential time complexity problem. We have implemented an artificial intelligent search algorithm for TSP on our homepage. The main feature of our algorithm is that the destination may not be the same as the start city whereas all of the existing heuristic algorithms for TSP assume that the start and the destination cities are the same. The web page asks a user to select all the cities he or she wants to visit(including start and destination city), then it finds a sequence of the cities such that the user would travel minimum distance if he or she visits the cities in the order of the sequence. This paper presents algorithms used in the homepage.