On the optimal robot routing problem in wireless sensor networks

IEEE Transactions on Knowledge and Data Engineering

Volumn 19, Issue 9, 2007, Pages 1252-1261

  Yuan, Bo ^a,b   Orlowska, Maria ^b   Sadiq, Shazia ^b  

^a IEEE

^b UNIVERSITY OF QUEENSLAND   (Australia)

Author keywords

Global optimization; Heuristic algorithms; Wireless sensor networks

Indexed keywords

APPROXIMATION ALGORITHMS; GLOBAL OPTIMIZATION; HEURISTIC ALGORITHMS; MOBILE ROBOTS; NETWORK ROUTING; TRAVELING SALESMAN PROBLEM;

DISTRIBUTED SENSORS; TRAVELING SALESMAN PROBLEM WITH NEIGHBORHOODS (TSPN);

WIRELESS SENSOR NETWORKS;

EID: 34547988280     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2007.1062     Document Type: Article

References (20)

1. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, "Wireless Sensor Networks: A Survey," Computer Networks, vol. 38, no. 4, pp. 393-422, 2002.
2. E.M. Arkin and R. Hassin, "Approximation Algorithms for the Geometric Covering Salesman Problem," Discrete Applied Math., vol. 55, no. 3, pp. 197-218, 1994.
3. Handbook of Evolutionary Computation, T. Bäck, D.B. Fogel, and Z. Michalewicz, eds. IOP Publishing and Oxford Univ. Press, 1997.
4. M. de Berg, J. Gudmundsson, M.J. Katz, C Levcopoulos, M.H. Overmars, and A.F. van der Stappen, "TSP with Neighborhoods of Varying Size," J. Algorithms, vol. 57, no. 1, pp. 22-36, 2005.
5. A. Dumitrescu and J.S.B. Mitchell, "Approximation Algorithms for TSP with Neighborhoods in the Plane," J. Algorithms, vol. 48, no. 1, pp. 135-159, 2003.
6. K. Elbassioni, A. Fishkin, N. Mustafa, and R. Sitters, "Approximation Algorithms for Euclidean Group TSP," Proc. 32nd Int'l Colloquium Automata, Languages, and Programming (ICALP '05), pp. 1115-1126, 2005.
7. D.E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, 1989.
8. J. Gudmundsson and C Levcopoulos, "A Fast Approximation Algorithm for TSP with Neighborhoods," Nordic J. Computing, vol. 6, no. 4, pp. 469-488, 1999.
9. N. Hansen and A. Ostermeier, "Completely Derandomized Self-Adaptation in Evolution Strategies," Evolutionary Computation, vol. 9, no. 2, pp. 159-195, 2001.
10. Y. Jin and J. Branke, "Evolutionary Optimization in Uncertain Environments - A Survey," IEEE Trans. Evolutionary Computation, vol. 9, no. 3, pp. 303-317, 2005.
11. T. Jones and S. Forrest, "Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms," Proc. Sixth Int'l Conf. Genetic Algorithms (ICGA '95), pp. 184-192, 1995.
12. The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys, eds. Wiley, 1985.
13. C.S. Mata and J.S.B. Mitchell, "Approximation Algorithms for Geometric Tour and Network Design Problems," Proc. 11th ACM Ann. Symp. Computational Geometry (SoCG '95), pp. 360-369, 1995.
14. C.H. Papadimitriou, "The Euclidean Traveling Salesman Problem Is NP-Complete," Theoretical Computer Science, vol. 4, no. 3, pp. 237-244, 1977.
15. S. Safra and O. Schwartz, "On the Complexity of Approximating TSP with Neighborhoods and Related Problems," Computational Complexity, vol. 14, no. 4, pp. 281-307, 2006.
16. H.-P. Schwefel, Evolution and Optimum Seeking. Wiley, 1995.
17. B. Yuan and M. Gallagher, "Experimental Results for the Special Session on Real-Parameter Optimization at CEC 2005: A Simple, Continuous EDA," Proc. Congress Evolutionary Computation (CEC '05), pp. 1792-1799, 2005.
18. B. Yuan and M. Gallagher, "On the Importance of Diversity Maintenance in Estimation of Distribution Algorithms," Proc. Genetic and Evolutionary Computation Conf. (GECCO '05), pp. 719-726, 2005.
19. Concorde TSP Solver, http://www.tsp.gatech.edu/concorde.html, 2006.
20. TSPLIB, http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/ , 2006.