Abstract
This paper describes an optimization technique based on an heuristic procedure which is applied to analyse and improve the efficiency of the design of Global Positioning System (GPS) surveying networks. GPS is a valuable survey tool because of its ability to increase the accuracy, speed and flexibility of a survey. A GPS network can be defined as a number of stations, which are co-ordinated by a series of sessions, formed by placing receivers on stations. The goal is to select the best order in which these sessions can be organised to give the best possible schedule. Generally, solving large networks to optimality requires impractical computational time. This paper proposes a Tabu Search technique which provides optimal or near-optimal solutions for large networks with an acceptable amount of computational effort. Computational results for several case studies with known and unknown optimal schedules have been presented to assess the performance of the proposed technique.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Elliott, D. (1996), Understanding GPS Principles and Applications, Boston, MA. Artech House, USA.
Leick, A. (1995), GPS Satellite Surveying, 2nd. ed., Wiley, Chichester.
Saleh, H.A. (1996), Improvements to The GPSdemoUCL Simulation Software, MSc Dissertation in Surveying, Department of Geomatic Engineering, University College London, U.K.
Dare, P. and Saleh, H.A. (1998), The use of heuristics in the design of GPS networks, in (ed.) Brunner F., Advances in Positioning and Reference Frames, Proceedings of the Scientific Assembly of the International Association of Geodesy (IAG97), Riocentro-Rio De Janeiro, Brazil. 3-9, September 1997, Springer Verlag, New York, USA, pp. 120-124, ISBN 3-540-64604-3.
Glover, F. (1989), Tabu Search part I, ORAS J. Comput. 1(3): 190-206.
Glover, F. (1990), Tabu Search part II, ORAS J. Comput. 2(1): 004-032.
De Werra, D. and Hertz, A. (1989), Tabu search techniques: A tutorial and an application to neural networks, OR Spectrum 131-141.
Taillard, E. (1991). Robust Taboo Search for the Quadratic Assignment Problem. Parallel Computing, 17: 443-455.
Widmer, M. and Hertz, A. (1989), A New Heuristic for the Flow Shop Sequencing Problem, European Journal of Operational Research, 4: 186-193.
Nawaz, M., Enscore, E. and Ham, I. (1983), A Heuristic Algorithm for the m-Machine, n-Job Flow-Shop Sequencing Problem, Omega, 11: 91-95.
Taillard, E. (1990), Some Efficient Heuristic Methods for the Flow Shop Sequencing Problem, European Journal of Operational Research, 47: 65-74.
Osman, I. and Christofides, N. (1994), Capacitated Clustering Problems by Hybrid SA and TS, International Transactions in Operational Research, 1: 317-336.
Hertz, A. and de Werra, D. (1990), The Tabu Search Metaheuristic: How We Used It, Annals of Mathematics and Artificial Intelligence, 1: 111-121.
Skorin-Kapov, J. (1990), TS Applied to the Quadratic Assignment Problem, OR Society of America, Journal of Computing, 2: 33-45.
Taillard, E. (1994), Parallel Taboo Search Techniques for the Job Shop Scheduling Problem, ORSA Journal on Computing, 6: 108-117.
Osman, I.H. (1995), Heuristics for the generalised assignment problem: Simulated Annealing and tabu search approaches, OP Spektrum, 17: 211-225.
Lin, S. (1965), Computer solutions of the travelling salesman problem, Bell System Technical Journal, 44: 2245-2269.
Glover, F. and Laguna, M. (1997), Tabu Search, Kluwer Academic Publishers, Boston.
Dare, P. (1995), Optimal Design of GPS Networks: Operational Procedures, Ph.D. thesis, School of Surveying, University of East London, UK.
Dare, P. and Saleh, H. A. (2000), GPS network design: logistics solution using optimal and near-optimal methods, Journal of Geodesy. 74: 467-478.
Saleh, H. A. and Dare, P., (2000), Local Search Strategy to produce Schedules for a GPS Surveying Network. In Tuson A., ed., Tutorial and keynote papers of the Eleventh Young Operational Research Conference (YOR11), University of Cambridge, Cambridge, 28-30 March, 2000-ORS, UK, pp. 87–103. ISBN 0-903440-202.
Dare, P. (1994), Project Malta' 93: The Establishment of a New Primary Network for the Republic of Malta by use of the Global Positioning System, Report for Mapping Unit, Planning Directorate, Floriana, Malta.
Saleh, H. A. and Dare, P., (2001), Effective Heuristics for the GPS Survey Network of Malta: Simulated Annealing and Tabu Search Techniques, Journal of Heuristics, 7(6): 533-549.
Dare, P. (2000), Seychelles Densification Project 98: The Densification of a control network for the Republic of Seychelles by use of the Global Positioning System, Report for Lands and Survey Division, Ministry of Land Use and Habitat, Victoria, Seychelles.
Saleh, H. A. (1999), A heuristic Approach to the Design of GPS Networks, Ph.D. thesis, School of Surveying, University of East London, UK.
Dammeyer, F. and Voss, S. (1993), Dynamic Tabu List Management using the Reverse Elimination Method, Annals of Operations Research, 41: 31-46.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Saleh, H.A., Dare, P. Near-optimal design of Global Positioning System (GPS) networks using the Tabu Search technique. Journal of Global Optimization 25, 183–208 (2003). https://doi.org/10.1023/A:1021953714975
Issue Date:
DOI: https://doi.org/10.1023/A:1021953714975