Abstract
The use of metaheuristic algorithms is proposed as a general method for searching the string landscape for string models with user-specified physical properties. One such algorithm, simulated annealing, is discussed at length and employed to carry out such surveys. Multiple energy functions are considered and it is shown that the particular energy function must be chosen wisely in order to drive the algorithms toward models with desirable properties. It is shown that a simple random sampling outperforms both simulated annealing and random search, likely due to the landscapes highly irregular structure. The chapter concludes with a brief discussion of the application of evolutionary, particularly genetic, algorithms to such surveys.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Even an exhaustive survey of layer three is approaching the limits of the Gauge Framework.
- 2.
Julia is a high-level, high-performance dynamic programming language for technical computing, with syntax that is familiar to users of other technical computing environments, http://julialang.org.
References
S. Kirkpatrick, C. Gelatt, M. Vecchi, Optimization by simulated annealing. Science 220(4598), 671–680 (1983)
V. Cerny, Thermodynamical approach to the traveling salesman problem: an efficient simulation algorithm. J. Optim. Theory Appl. 45(1), 41–51 (1985)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Moore, D.G. (2016). Landscape Surveys Through Metaheuristic Algorithms. In: The Landscape of Free Fermionic Gauge Models. Springer Theses. Springer, Cham. https://doi.org/10.1007/978-3-319-24618-5_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-24618-5_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-24616-1
Online ISBN: 978-3-319-24618-5
eBook Packages: Physics and AstronomyPhysics and Astronomy (R0)