Abstract
Despite some success of Genetic Algorithms (GAs) when tackling Constraint Satisfaction Problems (CSPs), they generally suffer from poor crossover operators. In order to overcome this limitation in practice, we propose a novel crossover specifically designed for solving CSPs including Temporal CSPs (TCSPs). Together with a variable ordering heuristic and an integration into a parallel architecture, this proposed crossover enables the solving of large and hard problem instances as demonstrated by the experimental tests conducted on randomly generated CSPs and TCSPs based on the model RB. We will indeed demonstrate, through these tests, that our proposed method is superior to the known GA-based techniques for CSPs. In addition, we will show that we are able to compete with the efficient MAC-based Abscon 109 solver for random problem instances as well as those instances taken from Lecoutre’s CSP library. Finally, we conducted additional tests on very large consistent and over constrained CSPs and TCSPs instances in order to show the ability of our method to deal with constraint problems in real time. This corresponds to solving the CSP or the TCSP by giving a solution with a quality (number of solved constraints) depending on the time allocated for computation.
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 callMore From: International Journal of Computational Intelligence and Applications
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.
