|
چکیده
|
Agent-based modeling is a relatively new approach to model complex systems composed of agents whose behavior is described using simple rules. As a consequence of the agent interactions emerges a complex global behavioral pattern not explicitly programmed. In the last decade, an increasing number of metaheuristic techniques have been reported in the literature where authors claim their novelty and their abilities to perform as powerful optimization methods. Although these schemes emulate very different processes or systems, the rules used to model individual behavior are very similar. The idea behind the design of many metaheuristic methods is to configure a recycled set of rules that has demonstrated to be successful in previous approaches for producing new optimization schemes. Such common rules have been designed without considering the final global result obtained by the individual interactions. On the other hand, agent-based systems provide a solid theory and a set of consistent models that allow characterizing global behavioral patterns produced by the collective interaction of the individuals from a set of simple rules. Under this perspective, several agent-based concepts and models that generate very complex global search behaviors can be used to produce or improve efficient optimization algorithms. In this paper, a new metaheuristic algorithm based on agent systems principles is presented. The proposed method is based on the agent-based model known as “Heroes and Cowards”. This model involves a small set of rules to produce two emergent global patterns that can be considered in terms of the metaheuristic literature as exploration and exploitation stages. To evaluate its performance, the proposed algorithm has been tested in a set of representative benchmark functions, including multimodal, unimodal, and hybrid benchmark formulations. The competitive results demonstrate the promising association between both paradigms.
|