Abstract
In this article, we propose new approaches for maximal constraint satisfaction problems (Max-CSPs), inspired by the marriage process of honeybees. Our approaches consist on honeybees for optimization and constraint reasoning. The first one is centralized and the second one is distributed. Our approaches are enhanced by a new parameter. Experimental comparison between the two approaches and their explanations are provided. Compared to the Dynamic Distributed Double Guided Genetic Algorithm, the Distributed Honeybee Algorithm for Optimization and Constraint Reasoning is better in term of solution quality. © 2011 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Methlouthi, I., & Bouamama, S. (2011). A new honeybee optimization for constraint reasoning: Case of Max-CSPs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6882 LNAI, pp. 325–334). https://doi.org/10.1007/978-3-642-23863-5_33
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
