Finding the optimal path in 3D spaces using EDAs -The wireless sensor networks scenario

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4431 LNCS, Issue PART 1, 2007, Pages 536-545

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

^a UNIVERSITY OF QUEENSLAND   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

MOBILE ROBOTS; MOTION PLANNING; THREE DIMENSIONAL COMPUTER GRAPHICS; TRAVELING SALESMAN PROBLEM;

3D SPACES; ESTIMATION OF DISTRIBUTION ALGORITHMS (EDA); OPTIMAL PATH;

WIRELESS SENSOR NETWORKS;

EID: 38049052180     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71618-1_59     Document Type: Conference Paper

References (12)

1. Arkin, E. M., Hassin, R.: Approximation algorithms for the geometric covering salesman problem. Discrete Applied Mathematics, Vol. 55 (3), (1994) 197-218.
2. Back, T., Fogel, D. B.,Michalewicz, Z., Eds.: Handbook of Evolutionary Computation, IOP Publishing Ltd and Oxford University Press (1997).
3. de Berg, M., Gudmundsson, J., Katz, M. J., Levcopoulos, C., Overmars, M. H.,van der Stappen, A. F.: TSP with Neighborhoods of Varying Size. Journal of Algorithms, Vol. 57 (1), (2005) 22-36.
4. Dumitrescu, A., Mitchell, J. S. B.: Approximation algorithms for TSP with neighborhoods in the plane. Journal of Algorithms, Vol. 48 (1), (2003) 135 - 159.
5. Elbassioni, K., Fishkin, A., Mustafa, N.,Sitters, R.: Approximation Algorithms for Euclidean Group TSP. In the 32nd International Colloquium on Automata, Languages and Programming, (2005) 1115-1126.
6. Gudmundsson, J., Levcopoulos, C.: A fast approximation algorithm for TSP with neighborhoods. Nordic Journal of Computing, Vol. 6 (4), (1999) 469 - 488.
7. Helsgaun, K.: An Effective Implementation of the Lin-Kernighan Traveling Salesman Heuristic. European Journal of Operational Research, Vol. 126 (1), (2000) 106-130.
8. Larrañaga, P., Lozano, J. A., Eds.: Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation, Kluwer Academic Publishers (2001).
9. Mata, C. S., Mitchell, J. S. B.: Approximation algorithms for geometric tour and network design problems (extended abstract). In the eleventh annual symposium on computational geometry, (1995) 360 - 369.
10. Papadimitriou, C. H.: The Euclidean travelling salesman problem is NP-complete. Theoretical Computer Science, Vol. 4 (3), (1977) 237-244.
11. Safra, S., Schwartz, O.: On the complexity of approximating tsp with neighborhoods and related problems. Computational Complexity, Vol. 14 (4), (2006) 281 - 307.
12. Yuan, B., Gallagher, M.: On the Importance of Diversity Maintenance in Estimation of Distribution Algorithms. In the 2005 Genetic and Evolutionary Computation Conference, (2005)719-726.