HABCO: A robust agent on hybrid ant-bee colony optimization

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

研究成果: Article

摘要

The purpose of this research is to generate a robust agent by combining bee colony optimization (BCO) and ELU-Ants for solving traveling salesman problem (TSP), called HABCO. The robust agents, called ant-bees, firstly are grouped into three types scout, follower, recruiter at each stages. Then, the bad agents are high probably discarded, while the good agents are high probably duplicated in earlier steps. This first two steps mimic BCO algorithm. However, constructing tours such as choosing nodes, and updating pheromone are built by ELU-Ants 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.

原文English
頁(從 - 到)1247-1256
頁數10
期刊Telkomnika (Telecommunication Computing Electronics and Control)
15
發行號3
DOIs
出版狀態Published - 2017 九月 1

指紋

Ant colony optimization
Traveling salesman problem

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

引用此文

@article{fc631aee0077412eb0339338307ebd79,
title = "HABCO: A robust agent on hybrid ant-bee colony optimization",
abstract = "The purpose of this research is to generate a robust agent by combining bee colony optimization (BCO) and ELU-Ants for solving traveling salesman problem (TSP), called HABCO. The robust agents, called ant-bees, firstly are grouped into three types scout, follower, recruiter at each stages. Then, the bad agents are high probably discarded, while the good agents are high probably duplicated in earlier steps. This first two steps mimic BCO algorithm. However, constructing tours such as choosing nodes, and updating pheromone are built by ELU-Ants 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.",
author = "Girsang, {Abba Suganda} and Tsai, {Chun Wei} and Chu-Sing Yang",
year = "2017",
month = "9",
day = "1",
doi = "10.12928/telkomnika.v15.i3.3656",
language = "English",
volume = "15",
pages = "1247--1256",
journal = "Telkomnika",
issn = "1693-6930",
publisher = "Institute of Advanced Engineering and Science (IAES)",
number = "3",

}

HABCO : A robust agent on hybrid ant-bee colony optimization. / Girsang, Abba Suganda; Tsai, Chun Wei; Yang, Chu-Sing.

於: Telkomnika (Telecommunication Computing Electronics and Control), 卷 15, 編號 3, 01.09.2017, p. 1247-1256.

研究成果: Article

TY - JOUR

T1 - HABCO

T2 - A robust agent on hybrid ant-bee colony optimization

AU - Girsang, Abba Suganda

AU - Tsai, Chun Wei

AU - Yang, Chu-Sing

PY - 2017/9/1

Y1 - 2017/9/1

N2 - The purpose of this research is to generate a robust agent by combining bee colony optimization (BCO) and ELU-Ants for solving traveling salesman problem (TSP), called HABCO. The robust agents, called ant-bees, firstly are grouped into three types scout, follower, recruiter at each stages. Then, the bad agents are high probably discarded, while the good agents are high probably duplicated in earlier steps. This first two steps mimic BCO algorithm. However, constructing tours such as choosing nodes, and updating pheromone are built by ELU-Ants 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.

AB - The purpose of this research is to generate a robust agent by combining bee colony optimization (BCO) and ELU-Ants for solving traveling salesman problem (TSP), called HABCO. The robust agents, called ant-bees, firstly are grouped into three types scout, follower, recruiter at each stages. Then, the bad agents are high probably discarded, while the good agents are high probably duplicated in earlier steps. This first two steps mimic BCO algorithm. However, constructing tours such as choosing nodes, and updating pheromone are built by ELU-Ants 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.

UR - http://www.scopus.com/inward/record.url?scp=85033785488&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85033785488&partnerID=8YFLogxK

U2 - 10.12928/telkomnika.v15.i3.3656

DO - 10.12928/telkomnika.v15.i3.3656

M3 - Article

AN - SCOPUS:85033785488

VL - 15

SP - 1247

EP - 1256

JO - Telkomnika

JF - Telkomnika

SN - 1693-6930

IS - 3

ER -