Abstract
Traditional (non-stochastic) iterative methods for optimizing functions with multiple optima require a good procedure for selecting starting points. This paper illustrates how the selection of starting points can be made automatically by using a method based upon simulated annealing. We present a hybrid algorithm, possessing the accuracy of traditional routines, whilst incorporating the reliability of annealing methods, and illustrate its performance for a particularly complex practical problem.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
