Simulated Annealing: A Monte Carlo Method for GPS Surveying

  • Stefka Fidanova
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3991)


This paper describes simulated annealing technique,which is a Monte Carlo method, to analyze and improve the efficiency of the design of Global Positioning System (GPS) surveying networks. The paper proposes various local search procedures which can be coupled with the simulated annealing technique.


Global Position System Local Search Global Position System Simulated Annealing Algorithm Local Search Procedure 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Dowsland, K.: Variants of Simulated Annealing for Practical Problem Solving. In: Rayward-Smith, V. (ed.) Applications of Modern Heuristic Methods, Henley-on-Thames. Alfred Walter Ltd. in association with UNICOM (1995)Google Scholar
  2. 2.
    Kirkpatrick, S., Gelatt, C.D., Vecchi, P.M.: Optimization by Simulated Annealing. Science 220, 671–680 (1983)CrossRefMathSciNetGoogle Scholar
  3. 3.
    Rene, V.V.: Applied Simulated Annealing. Springer, Berlin (1993)MATHGoogle Scholar
  4. 4.
    Saleh, H.A., Dare, P.: Effective Heuristics for the GPS Surveying Network of Malta: Simulated Annealing and Tabu Search Techniques. J. of Heuristics 7(6), 533–549 (2001)MATHCrossRefGoogle Scholar
  5. 5.
    Saleh, H.A., Dare, P.: Heuristic Methods for Designing Global Positioning System Surveying Network in the Republic of Seychelles. The Arabian Journal for Science and Engineering 26, 73–93 (2002)Google Scholar
  6. 6.
    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)MathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Stefka Fidanova
    • 1
  1. 1.IPP – BASSofiaBulgaria

Personalised recommendations