Abstract
This paper provides insight into combining stochastic and deterministic search methods using evolutionary algorithms (EAs) such as evolutionary programming, evolutionary strategies, and genetic algorithms integrated with depth-first search with backtracking, branch and bound, and best-first search algorithms such as A*. An important view of such an integration focuses on both theoretical analysis and experimental evaluation. Included in the discussion is the constraining impact of the “No Free Lunch Theorem” on combined search performance. Also, a variety of combinations of EAs and deterministic combined search methods are proposed along with expert system components. Discussion of anticipated results of such architectures speculates about existence of high performance integrated search environments. A particular successful specific NPC problem environment is presented that employs search metrics for short-term performance evaluation and combined search algorithm selection.
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.
