Secure CheckoutPersonal information is secured with SSL technology.
Free ShippingFree global shipping
No minimum order.
- Simulated annealing and generalizations (I.O. Bohachevsky et al.). 2. Comparison of algorithms for wavelength selection (U. Hörchner, J.H. Kalivas). 3. Robust principal component analysis and constrained background bilinearization for quantitative analysis (R. Yu et al.). 4. Kalman filter quantitative resolution of overlapped shifted peaks after optimal alignment by simulated annealing (T. Rotunno). 5. Selection of molecular descriptors for quantitative structure-activity relationships (J.M. Sutter, P.C. Jurs). 6. Fundamentals of cluster analysis using simulated annealing (D.E. Brown, C.L. Huntley). 7. Classification of materials (R. Yu et al.). 8. Chemical batch process scheduling (I.A. Karimi, S. Hasebe). 9. Nuclear fuel management (G.T. Parks, D.J. Kropaczek). 10. Design of cost-effective emission control strategies (R.G. Derwent). 11. Determination of biexponential fluorescence lifetimes by using simulated annealing and simplex searching (S.L. Shew, C.L. Carter). 12. Simulated annealing applied to crystallographic structure refinement (A.T. Brünger, L.M. Rice). 13. Multi-dimensional searches in macromolecular X-ray crystallography (S. Subbiah). 14. Simulated annealing in the calculation of NMR structures (D. Zhao, O. Jardetzky). 15. Structural models of tetrahedrally bonded amorphous materials (F. Wooten, D. Weaire). 16. Conformational analysis of flexible molecules (S.R. Wilson et al.). 17. Simulated annealing-optimal histogram applications to the protein folding problem (D.M. Ferguson, D.G. Garrett). 18. Optimization of linear and non-linear parameters in a trial wavefunction by the method of simulated annealing (P. Dutta, S.P. Bhattacharyya). 19. Annealing to a moving target: first principles molecular dynamics (S.J. Singer). 20. A MATLAB algorithm for optimization of an arbitrary multivariate function (M.A. Curtis). Epilogue. Index.
Optimization problems occurring regularly in chemistry, vary from selecting the best wavelength design for optimal spectroscopic concentration predictions to geometry optimization of atomic clusters and protein folding. Numerous optimization tactics have been explored to solve these problems. While most optimizers maintain the ability to locate global optima for simple problems, few are robust against local optima convergence with regard to difficult or large scale optimization problems. Simulated annealing (SA) has shown a great tolerance to local optima convergence and is often called a global optimizer. The optimizaton algorithm has found wide use in numerous areas such as engineering, computer science, communication, image recognition, operation research, physics, and biology. Recently, SA and variations thereof have shown considerable success in solving numerous chemical optimization problems. The main thrust of this book is to demonstrate the use of SA in a wide range of chemical problems.
The potentiality of SA, GSA and other modifications of SA to serve specific needs in a variety of chemical disciplines are covered. A detailed discussion on SA and GSA is given in Chapter 1, presenting the theoretical framework from which a computer program can be written by the reader. The remainder of the book describes applications of SA type algorithms to a diverse set of chemical problems. The final chapter contains an algorithm for GSA written in the MatLab programming environment. This program can be easily adapted to any optimization problem and with only slight modifications, can be altered to perform SA. A general flowchart is also given.
- No. of pages:
- © Elsevier Science 1995
- 1st August 1995
- Elsevier Science
- eBook ISBN:
Idaho State University, Pocatello, ID, USA
Elsevier.com visitor survey
We are always looking for ways to improve customer experience on Elsevier.com.
We would like to ask you for a moment of your time to fill in a short questionnaire, at the end of your visit.
If you decide to participate, a new browser tab will open so you can complete the survey after you have completed your visit to this website.
Thanks in advance for your time.