A family of honey-bee optimization algorithms for Max-CSPs

摘要

This paper presents new approaches for maximal constraint satisfaction problems (Max-CSPs). Inspired by the honeybee marriage process, our approaches try to reach a solution that satisfies as many constraints as possible in a reasonable period of time. Our approaches are a centralized and distributed honey-bee optimization enhanced by a new parameter called local optimum detector. The latter allows detection of the local optimum. In this paper, newer algorithms and their experimental results are presented.