Abstract
Honey bee is famous as the social insects. Many optimization algorithms are recently invented by mimicking the honey bee foraging which using the "waggle dance" as local search algorithm. However, bees have a system called "cross inhibition" which controls nectar influx by bees' personal judgment. Each bee determines the necessity of foraging nectar with frequency of the number of encounter other bees in the hive and judges if a bee dances to advertise the place of its own nectar source to other bees. We propose the novel optimization algorithm which is refereed to this "cross inhibition" mechanism; in this algorithm, each agent possesses a threshold value and judges whether will take exploitation or exploration search and adjust the value autonomously with referring to the frequency of the number of encounter agents. In this contribution, we develop the local search using the waggle dance adding and apply it to solve a combinatorial problem.
