Abstract
AbstractThe method of simulated annealing is modified so that the concept of messy chromosomes is applied. Constituent genes of messy chromosomes are specified by their respective names (indices) and values (alleles) simultaneously. Unlike simple chromosomes (binary vectors), messy chromosomes may be either under‐ or overspecified with respect to the problem being solved. The messy simulated annealing algorithm is a very robust and efficient stochastic optimization method which is able to find correct minima of deceptive or highly multimodal objective functions. This is shown by way of a number of simulations.
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.
