Abstract
In designing Global Positioning System (GPS) surveying network, a given set of earth points must be observed consecutively (schedule). The cost of the schedule is the sum of the time needed to go from one point to another. The problem is to search for the best order in which this observation is executed. Minimizing the cost of this schedule is the goal of this work. Solving the problem for large networks to optimality requires impractical computational times. In this paper, several Simulated Annealing (SA) algorithms are developed to provide near-optimal solutions for large networks with bounded computational effort.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arts, E., Van Loarhoven, P.: Statistical Cooling: A General Approach to Combinatorial Optimization Problems. Phillips Journal of Research 40, 193–226 (1985)
Chen, T.-C., Chang, Y.-W.: Modern Floorplaning Based on B* Fast Simulated Annealing. IEEE Trans. on Computer Aided Design 25(4), 637–650 (2006)
Dare, P.J., Saleh, H.A.: GPS Network Design:Logistics Solution Using Optimal and Near-Optimal Methods. J. of Geodesy 74, 467–478 (2000)
Dowsland, K., Thomson, J.: Variants of Simulated Annealing for the Examination Timetabling Problem. Annals of OR 63, 105–128 (1996)
Fidanova, S.: An Heuristic Method for GPS Surveying Problem. In: Shi, Y., van Albada, G.D., Dongarra, J., Sloot, P.M.A. (eds.) ICCS 2007. LNCS, vol. 4490, pp. 1084–1090. Springer, Heidelberg (2007)
Hart, W.E., Krasnogor, N., Smith, J.E. (eds.): Recent Advances in Memetic Algorithms. Studies in Fuzziness and Soft Computing, vol. 166 (2005)
Kirkpatrick, S., Gellat, C.D., Vecchi, P.M.: Optimization by Simulated Annealing. Science 220, 671–680 (1983)
Metropolis, N., Rosenbluth, A., Rosenbluth, M., Teller, A., Teller, E.: Equation of State Calculations by Fast Computing Machines. J. of Chem Phys. 21(6), 1087–1092 (1953)
Rene, V.V.: Applied Simulated Annealing. Springer, Berlin (1993)
Saleh, H.A., Dare, P.: Effective Heuristics for the GPS Survey Network of Malta: Simulated Annealing and Tabu Search Techniques. Journal of Heuristics 7(6), 533–549 (2001)
Schaffer, A.A., Yannakakis, M.: Simple Local Search Problems that are Hard to Solve. Society for Industrial Applied Mathematics Journal on Computing 20, 56–87 (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fidanova, S., Alba, E., Molina, G. (2009). Memetic Simulated Annealing for the GPS Surveying Problem. In: Margenov, S., Vulkov, L.G., Waśniewski, J. (eds) Numerical Analysis and Its Applications. NAA 2008. Lecture Notes in Computer Science, vol 5434. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00464-3_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-00464-3_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00463-6
Online ISBN: 978-3-642-00464-3
eBook Packages: Computer ScienceComputer Science (R0)