Accepted:
December 2004
| |
/vol11/sarker02/ | © Copyright 2005 | |||
| Volume 11 | Received: Accepted: |
November 2004 December 2004 |
|||
|
Tracking moving targets and the nonstationary traveling salesman problem
Q. Jiang, R. Sarker and H. Abbass |
|
| Abstract | |
| The Traveling Salesman Problem (TSP) has been studied extensively in the literature with the assumption that all cities to be visited are stationary. In this paper, we investigate a non-stationary version of TSP (NTSP) where all cities (objects/targets) are moving at known velocities. This problem is motivated by many real life problems in security and defence. We propose a genetic algorithm based solution approach for NTSP and analyse the solutions obtained. | |
| Full Text |
|
|
Multimedia Links (none) Reference Links (none) Citation Reference Q. Jiang, R. Sarker and H. Abbass 2005, Tracking moving targets and the nonstationary traveling salesman problem, Complexity International, Volume 11, Paper ID: sarker02, URL: http://www.complexity.org.au/vol11/sarker02/ |
Get viewers for PS & PDF   |
