Abstract

Randomized search heuristics are an alternative to specialized and problem-specific algorithms. They are applied to NP-hard problems with the hope of being efficient in typical cases. They are an alternative if no problem-specific algorithm is available. And they are the only choice in black-box optimization where the function to be optimized is not known. Evolutionary algorithms (EA) are a special class of randomized algorithms with many successful applications. However, the theory of evolutionary algorithms is in its infancy. Here many new contributions to constructing such a theory are presented and discussed.

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 call

Disclaimer: 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.