A fast bee colony optimization for traveling salesman problem

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

Research output: Contribution to conferencePaper

9 Citations (Scopus)

Abstract

This paper presents a modified bee colony optimization (BCO) by pattern reduction to reduce the computation time, called BCOPR. Although BCO was robustness optimization, but likes the other algorithm for solving optimization problem, BCO has many reduncation computations on its convergence process, as a consequence, it will more computation time. Two operators are developed to BCOPR in this paper. The first one BCOPR1, is used to cut down the computation time by avoiding performing the same process on the preferred edge. On the second operator, BCOPR2, a bee is possible to duplicate the best previous-iteration tour if her first stage tour is the same with part of the best previous-iteration tour. In addition, likes BCO original, BCOPR is also use local search to enhance the quality solution. To evaluate the performance of the proposed algorithm, BCOPR uses some various benchmarks of TSP. Our experimental results show BCOPR reduce computation time as well as achieve good solution.

Original languageEnglish
Pages7-12
Number of pages6
DOIs
Publication statusPublished - 2012 Dec 12
Event3rd International Conference on Innovations in Bio-Inspired Computing and Applications, IBICA 2012 - Kaohsiung City, Taiwan
Duration: 2012 Sep 262012 Sep 28

Other

Other3rd International Conference on Innovations in Bio-Inspired Computing and Applications, IBICA 2012
CountryTaiwan
CityKaohsiung City
Period12-09-2612-09-28

Fingerprint

Traveling salesman problem
Mathematical operators

All Science Journal Classification (ASJC) codes

  • Bioengineering
  • Software

Cite this

Girsang, A. S., Tsai, C. W., & Yang, C-S. (2012). A fast bee colony optimization for traveling salesman problem. 7-12. Paper presented at 3rd International Conference on Innovations in Bio-Inspired Computing and Applications, IBICA 2012, Kaohsiung City, Taiwan. https://doi.org/10.1109/IBICA.2012.44
Girsang, Abba Suganda ; Tsai, Chun Wei ; Yang, Chu-Sing. / A fast bee colony optimization for traveling salesman problem. Paper presented at 3rd International Conference on Innovations in Bio-Inspired Computing and Applications, IBICA 2012, Kaohsiung City, Taiwan.6 p.
@conference{4e98815e409c408db7ac4f51698b7cdd,
title = "A fast bee colony optimization for traveling salesman problem",
abstract = "This paper presents a modified bee colony optimization (BCO) by pattern reduction to reduce the computation time, called BCOPR. Although BCO was robustness optimization, but likes the other algorithm for solving optimization problem, BCO has many reduncation computations on its convergence process, as a consequence, it will more computation time. Two operators are developed to BCOPR in this paper. The first one BCOPR1, is used to cut down the computation time by avoiding performing the same process on the preferred edge. On the second operator, BCOPR2, a bee is possible to duplicate the best previous-iteration tour if her first stage tour is the same with part of the best previous-iteration tour. In addition, likes BCO original, BCOPR is also use local search to enhance the quality solution. To evaluate the performance of the proposed algorithm, BCOPR uses some various benchmarks of TSP. Our experimental results show BCOPR reduce computation time as well as achieve good solution.",
author = "Girsang, {Abba Suganda} and Tsai, {Chun Wei} and Chu-Sing Yang",
year = "2012",
month = "12",
day = "12",
doi = "10.1109/IBICA.2012.44",
language = "English",
pages = "7--12",
note = "3rd International Conference on Innovations in Bio-Inspired Computing and Applications, IBICA 2012 ; Conference date: 26-09-2012 Through 28-09-2012",

}

Girsang, AS, Tsai, CW & Yang, C-S 2012, 'A fast bee colony optimization for traveling salesman problem' Paper presented at 3rd International Conference on Innovations in Bio-Inspired Computing and Applications, IBICA 2012, Kaohsiung City, Taiwan, 12-09-26 - 12-09-28, pp. 7-12. https://doi.org/10.1109/IBICA.2012.44

A fast bee colony optimization for traveling salesman problem. / Girsang, Abba Suganda; Tsai, Chun Wei; Yang, Chu-Sing.

2012. 7-12 Paper presented at 3rd International Conference on Innovations in Bio-Inspired Computing and Applications, IBICA 2012, Kaohsiung City, Taiwan.

Research output: Contribution to conferencePaper

TY - CONF

T1 - A fast bee colony optimization for traveling salesman problem

AU - Girsang, Abba Suganda

AU - Tsai, Chun Wei

AU - Yang, Chu-Sing

PY - 2012/12/12

Y1 - 2012/12/12

N2 - This paper presents a modified bee colony optimization (BCO) by pattern reduction to reduce the computation time, called BCOPR. Although BCO was robustness optimization, but likes the other algorithm for solving optimization problem, BCO has many reduncation computations on its convergence process, as a consequence, it will more computation time. Two operators are developed to BCOPR in this paper. The first one BCOPR1, is used to cut down the computation time by avoiding performing the same process on the preferred edge. On the second operator, BCOPR2, a bee is possible to duplicate the best previous-iteration tour if her first stage tour is the same with part of the best previous-iteration tour. In addition, likes BCO original, BCOPR is also use local search to enhance the quality solution. To evaluate the performance of the proposed algorithm, BCOPR uses some various benchmarks of TSP. Our experimental results show BCOPR reduce computation time as well as achieve good solution.

AB - This paper presents a modified bee colony optimization (BCO) by pattern reduction to reduce the computation time, called BCOPR. Although BCO was robustness optimization, but likes the other algorithm for solving optimization problem, BCO has many reduncation computations on its convergence process, as a consequence, it will more computation time. Two operators are developed to BCOPR in this paper. The first one BCOPR1, is used to cut down the computation time by avoiding performing the same process on the preferred edge. On the second operator, BCOPR2, a bee is possible to duplicate the best previous-iteration tour if her first stage tour is the same with part of the best previous-iteration tour. In addition, likes BCO original, BCOPR is also use local search to enhance the quality solution. To evaluate the performance of the proposed algorithm, BCOPR uses some various benchmarks of TSP. Our experimental results show BCOPR reduce computation time as well as achieve good solution.

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

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

U2 - 10.1109/IBICA.2012.44

DO - 10.1109/IBICA.2012.44

M3 - Paper

SP - 7

EP - 12

ER -

Girsang AS, Tsai CW, Yang C-S. A fast bee colony optimization for traveling salesman problem. 2012. Paper presented at 3rd International Conference on Innovations in Bio-Inspired Computing and Applications, IBICA 2012, Kaohsiung City, Taiwan. https://doi.org/10.1109/IBICA.2012.44