Effective Heuristics for the GPS Survey Network of Malta: Simulated Annealing and Tabu Search Techniques

  • Authors:

  • Hussain Aziz Saleh;Peter Dare

  • Affiliations:

  • Institut de Recherches Interdisciplinaires et de Développements en Intelligence Artificielle, IRIDIA, CP 194/6, Universite' Libre de Bruxelles, Avenue Franklin Roosevelt 50, 1050 Bruxelles, B ...;Geodetic Research Laboratory, Department of Geodesy and Geomatics Engineering, University of New Brunswick, Post Office Box 4400, Fredericton, New Brunswick, Canada, E3B 5A3. Dare@unb.ca

  • Venue:
  • Journal of Heuristics
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

A GPS network can be defined as a set of stations, co-ordinated by a series of sessions formed by placing receivers on the stations. This paper shows how to search for the best order in which to observe these sessions giving the cheapest schedule. The complexity of observing GPS networks increases with their size and become highly difficult to solve effectively. To obtain good methods to solve this problem a new area of research is implemented. This area is based on developed heuristic techniques that provide an optimal or near optimal solution for large networks. Comparing their outcome in terms of solution quality and computational effort proves the performance of the developed techniques.