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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aarts, E. and P. Van Laarhoven. (1985). “Statistical Cooling: A General Approach to Combinatorial Optimization Problems.” Philips Journal of Research40, 193–226.
Cerny, V. (1985). “A Thermodynamical Approach to the Travelling Salesman Problem: An Efficient Simulated Annealing Algorithm.” Journal of Optimization Theory and Applications45, 41–51.
Dammeyer, F. and S. Voss. (1993). “Dynamic Tabu List Management Using the Reverse Elimination Method.” Annals of Operations Research41, 31–46.
Dare, P.J. (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.
Dare, P.J. (1995). “Optimal Design of GPS Networks: Operational Procedures.” Ph.D. Thesis, School of Surveying, University of East London, UK.
Dare, P. and H. Saleh. (1998). “The Use of Heuristics in the Design of GPS Networks.” In F. Brunner (ed.), Advances in Positioning and Reference Frames, Proceedings of the Scientific Assembly of the International Association of Geodesy, Rio de Janeiro, Brazil, September 8, 1997.New York: Springer Verlag, pp. 120–124.
De Werra, D. and A. Hertz. (1989). TS Techniques: A Tutorial and an Application to Neural Networks, OR Spektrum, Vol. 11. Berlin: Springer-Verlag, pp.131–141.
Dowsland, K. (1995). “Variants of Simulated Annealing for Practical Problem Solving.” In V. Rayward-Smith (ed.), Applications of Modern Heuristic Methods. Henley-on-Thames: Alfred Waller Ltd., in association with UNICOM.
Elliott, D. (1996). Understanding GPS: Principles & Applications. Boston; Artech House.
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),4–32.
Glover, F. (1995). “Tabu Search Fundamentals and Uses.” Technical Report, Graduate School of Business, University of Colorado, Boulder.
Glover, F. and M. Laguna. (1997). Tabu Search. Norwell, MA: Kluwer Academic Publishers.
Glover, F., E. Taillard, and D. de Werra. (1993). “A Users Guide to Tabu Search.” Annals of Operations Research 41,3–28.
Hertz, A. and D. De Werra. (1990). “The Tabu Search Meta-heuristic: How We Used It.” Annals of Mathematics and Artificial Intelligence1,111–121.
Kelly, J., B. Golden, and A. Assad. (1993). “Large-Scale Controlled Rounding using TS with Strategic Oscillation.” Annals of OR 41,69–84.
Kirkpatrick, S., C.D. Gelatt, and P.M. Vecchi. (1983). “Optimization by Simulated Annealing.” Science220, 671–680.
Leick, A. (1995).GPS Satellite Surveying,2nd ed.Chichester. England: Wiley.
Lin, S. (1965). “Computer Solutions of the Travelling Salesman Problem.” Bell System Technical Journal44, 2245–2269.
Osman, I.H. (1993). “Metastrategy Simulated Annealing and Tabu Search Algorithm for the Vehicle Routing Problem.” Annals of OR41, 421–451.
Osman, I.H. and C.N. Potts. (1989). “Simulated Annealing for Permutation Flow-Shop Scheduling.” Omega 17, 551–557.
Reeves, C.R. (ed.). (1993). Modern Heuristic Techniques for Combinatorial Problems. Oxford, England: Blackwell Scientific Publications.
Rene, V.V. Vidal. (1993). Applied Simulated Annealing. Berlin: Springer-Verlag.
Saleh, H.A. (1996). “Improvements to The GPSdemoUCL Simulation Software.” MSc. Dissertation in Surveying, Department of Geomatic Engineering, University College London, London, UK.
Saleh, H.A. and P.J. Dare. (1997a). “A Heuristic Approach to the Design of GPS Networks.” Paper presented at Untied Kingdom Geophysical Assembly-21, University of Southampton, UK, 2–4 April 1997.
Saleh, H.A. and P.J. Dare. (1997b). “The Design of GPS Networks using the Heuristic Techniques.” Paper presented at Young Researchers Forum in Operational Research and Management Science, University of Southampton, UK, and 17–18 April 1997.
Saleh, H.A. and P.J. Dare. (1997c). “A Simulated Annealing Approach for Designing a GPS surveying Network.” Paper presented at 2nd Meta-Heuristic International Conference (MIC'97), Sophia-Antipolis, France, 21–24 July 1997.
Saleh, H.A. and P.J. Dare. (1998a). “Efficient Simulated Annealing Heuristic Techniques for Designing GPS Surveying Networks.” Paper presented at Young OR10 Conference, University of Surrey, Guildford, UK, 31 March to 2 April 1998.
Saleh, H.A. and P.J. Dare. (1998b). “GPS Network Design An Application of The Simulated Annealing Heuristic Technique.” Paper presented at International Conference on Combinatorial and Global Optimization, Chania, Crete, Greece, 25–29, May 1998.
Saleh, H.A. and P.J. Dare. (1998c). “Heuristic Techniques for GPS Surveying.” Paper presented at UEL Postgraduate Conference, University of East London, Startford, UK, 5 June 1998.
Saleh, H.A. and P.J. Dare. (1998d). “A Tabu Search Approach for Designing a GPS Surveying Network for the Republic of Malta.” Paper presented at 16th European Conference on Operational Research, Brussels, Belguim, 12–15 July 1998.
Taillard, E. (1994). “Parallel Taboo Search Techniques for the Job Shop Scheduling Problem.” ORSA, Journal on Computing6, 108–117.
Teunissen, P. and A. Kleusberg. (1998). GPS for Geodesy,2nd ed.Berlin: Springer-Verlag.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Saleh, H.A., Dare, P. Effective Heuristics for the GPS Survey Network of Malta: Simulated Annealing and Tabu Search Techniques. Journal of Heuristics 7, 533–549 (2001). https://doi.org/10.1023/A:1011968924413
Issue Date:
DOI: https://doi.org/10.1023/A:1011968924413