Abstract
Constraint satisfaction problems (CSPs) are globally used to perform real life problems. They are dealt with many optimization complete and incomplete approaches. In this context nature inspired methods are very successful. In our work and within this context, we introduce a new guided honey bee optimization algorithm for Maximal constraint satisfaction problems (Max-CSPs). The guidance consists of a new template concept and could be classified as a min-conflict heuristic. Our new template concept overcomes the former template concept guidance problems. It makes it possible to apply a fair min conflict heuristic. Compared to previous well-known honeybee algorithms for Max-CSPs, our approach is clearly better in term of CPU time and in term of solution quality.
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 call
