Abstract
Abstract Guided genetic algorithm and dynamic distributed double guided genetic algorithm are based on nature laws and by the Neo-Darwinism theory. These evolutionary approaches were very successful addressing Maximal Constraint Satisfaction Problems (Max-CSPs). Our work is inspired by a little mistake when dealing with in these two algorithms guidance. In fact these approaches are guided by the min-conflict heuristic and the template concept. The used template is distorted. So, we introduce a new template concept in order to allow a better guidance. We suggest considering the percentages of violated constraints in place of their number. This concept is, then, applied to guide the genetic algorithms. In this paper, we compare the latter guided genetic algorithm with our new template guided genetic algorithm. The experimentations show that our new template guidance improves the optimization process to find best solutions in better time.
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.
