Abstract
Many applications require either the maximisation or minimisation of a function. For example, in many fields of theoretical physics, a sum of least squares must be minimised, or the energy of a system must be minimised. Many of the standard numerical techniques which exist for the optimisation of functions apply to functions which can be specified in a relatively straightforward manner. However, many of the functions which arise in the modelling of semiconductor devices cannot be specified in this manner, and some of these functions can only be evaluated using many subsidiary functions and integrals. Genetic algorithms allow such sets of functions to be optimised using random processes to “breed” generations of solutions which should converge to the optimal solution. This chapter presents an introduction to genetic algorithms and simulated annealing. Sections of code written in C++ are used to illustrate the implementation of aspects of the subjects. The coefficients involved in the numerical approximation of the associated Fermi integrals are evaluated using these methods.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2009 Springer-Verlag London
About this chapter
Cite this chapter
Cole, E.A.B. (2009). Genetic algorithms and simulated annealing. In: Mathematical and Numerical Modelling of Heterostructure Semiconductor Devices: From Theory to Programming. Springer, London. https://doi.org/10.1007/978-1-84882-937-4_14
Download citation
DOI: https://doi.org/10.1007/978-1-84882-937-4_14
Published:
Publisher Name: Springer, London
Print ISBN: 978-1-84882-943-5
Online ISBN: 978-1-84882-937-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)