Capítulo de livro Revisado por pares

A Hybrid Ant-Bee Colony Optimization for Solving Traveling Salesman Problem with Competitive Agents

2013; Springer Science+Business Media; Linguagem: Inglês

10.1007/978-3-642-40675-1_95

ISSN

1876-1119

Autores

Abba Suganda Girsang, Chun‐Wei Tsai, Chu-Sing Yang,

Tópico(s)

Advanced Multi-Objective Optimization Algorithms

Resumo

This paper presents a new method called hybrid ant bee colony optimization (HABCO) for solving traveling salesman problem which combines ant colony system (ACS), bee colony optimization (BCO) and ELU-Ants. The agents, called ant-bees, are grouped into three types, scout, follower, recruiter at each stages as BCO algorithm. However, constructing tours such as choosing nodes, and updating pheromone are built by ACS method. To evaluate the performance of the proposed algorithm, HABCO is performed on several benchmark datasets and compared to ACS and BCO. The experimental results show that HABCO achieves the better solution, either with or without 2opt.

Referência(s)