Browse > Article
http://dx.doi.org/10.3745/KTSDE.2020.9.1.17

Multi-Dimensional Traveling Salesman Problem Scheme Using Top-n Skyline Query  

Jin, ChangGyun (삼육대학교 컴퓨터-메카트로닉스 공학부)
Oh, Dukshin (삼육대학교 경영정보학과)
Kim, Jongwan (삼육대학교 스미스학부대학)
Publication Information
KIPS Transactions on Software and Data Engineering / v.9, no.1, 2020 , pp. 17-24 More about this Journal
Abstract
The traveling salesman problem is an algorithmic problem tasked with finding the shortest route that a salesman visits, visiting each city and returning to the started city. Due to the exponential time complexity of TSP, it's hard to implement on cases like amusement park or delivery. Also, TSP is hard to meet user's demand that is associated with multi-dimensional attributes like travel time, interests, waiting time because it uses only one attribute - distance between nodes. This paper proposed Top-n Skyline-Multi Dimension TSP to resolve formerly adverted problems. The proposed algorithm finds the shortest route faster than the existing method by decreasing the number of operations, selecting multi-dimensional nodes according to the dominance of skyline. In the simulation, we compared computation time of dynamic programming algorithm to the proposed a TS-MDT algorithm, and it showed that TS-MDT was faster than dynamic programming algorithm.
Keywords
Traveling Salesman Problem; Top-n Skyline; Skyline Query; Multi-Dimension Data; Dynamic Programming; Shortest Path;
Citations & Related Records
Times Cited By KSCI : 2  (Citation Analysis)
연도 인용수 순위
1 K. B. Kim and D. H. Song, "Path Search Method using Genetic Algorithm," The journal of the Korea Institute of Maritime Information & Communication Sciences, Vol.15, No.6, pp.1251-1255, 2011.   DOI
2 Z. H. Li and Y. B. Park, "Efficient Processing using Static Validity Circle for Continuous Skyline Queries," Journal of KIISE:Databases, Vol.33, Issue 6, pp.631-643, 2006.
3 J. Chomicki, P. Godfrey, J. Gryz, and D. Liang, "Skyline with Presorting," Proceedings 19th International Conference on Data Engineering, pp.717-719, 2003.
4 C. Y. Chan, H. V. Jagadish, K. L. Tan, A. K. H. Tung, and Z. Zhang, "Finding K-dominant Skyline in High Dimensional Space," Proc. of the 2006 ACM SIGMOD International Conference on Management of Data, pp.503-514, 2006.
5 H. S. Park and J. W. Lee, "Correct Linear Skyline Algorithm in High-Dimensional Space," Journal of KIISE, Vol.45, No.10, pp.1089-1095, 2018.   DOI
6 R. Neapolitan and K. Naimipour, "Foundation of Algorithms Using C++ Pseudocode 3rd edition," Jones & Bartlett, 2004.
7 S. M. Nam, M. S. Park, K. S. Kim, and S. J. Kim, "A Study on the Regulations and Market of Location Based Service (LBS)," Journal of Internet Computing and Services, Vol. 15, No.4, pp.141-152, 2014.   DOI
8 C. G. Jin, J. Kim, and D. Oh, "Multi-dimensional Traveling salesman problem using Top-n Skyline query," Korea Information Processing Society Spring Conference, Vol.26, No.1, pp.371-374, 2019.
9 S. H. Kwon, S. M. Kim, and M. K. Kang, "Cost Relaxation Method to Escape from a Local Optimum of the Traveling Salesman Problem," Journal of Korean institute of industrial engineers, Vol.30, No.2, pp.120-129, 2004.