期刊名称：International Journal of Computer Science & Technology
印刷版ISSN：2229-4333
电子版ISSN：0976-8491
出版年度：2011
卷号：2
期号：2(Version 2)
出版社：Ayushmaan Technologies
摘要：In this paper an algorithm is designed for multiple intercepting moving target traveling salesman problem is designed in which there are total number of n targets which are moving away from the origin with the positive constant velocity in a straight line and there is a single pursuer and that pursuer has to intercept exactly two number of targets before coming back to the origin and the goal is to intercept the targets in such a way that the total time taken by the pursuer can be minimized. An algorithm is also designed for multiple intercepting moving target traveling salesman problem is designed in which there are total number of n targets which are moving away from the origin with the positive constant velocity in a straight line and there is a single pursuer and that pursuer has to intercept exactly two number of targets before coming back to the origin and the goal is to intercept the targets in such a way that the total distance traveled by the pursuer can be minimized.
关键词：Traveling salesman problem; Moving target traveling salesman;problem with resupply
