Hybrid Heuristic Algorithm for GPS Surveying Problem

This paper introduces several approaches based on ant colony optimization for efficient scheduling the surveying activities of designing satellite surveying networks. These proposed approaches use a set of agents called ants that cooperate to iteratively construct potential observation schedules. Within the context of satellite surveying, a positioning network can be defined as a set of points which are coordinated by placing receivers on these point to determine sessions between them. The problem is to search for the best order in which these sessions can be observed to give the best possible schedule. The same problem arise in Mobile Phone Surveying networks. Several case studies have been used to experimentally assess the performance of the proposed approaches in terms of solution quality and computational effort.