A Bee Colony Optimization Algorithm for Traveling Salesman Problem

2008 Second Asia International Conference on Modelling & Simulation (AMS) Pub Date : 2008-05-13 DOI:10.1109/AMS.2008.27

L. Wong, M. Low, C. Chong

引用次数: 161

Abstract

A bee colony optimization (BCO) algorithm for traveling salesman problem (TSP) is presented in this paper. The BCO model is constructed algorithmically based on the collective intelligence shown in bee foraging behaviour. Experimental results comparing the proposed BCO model with some existing approaches on a set of benchmark problems are presented.

查看原文本刊更多论文

旅行商问题的蜂群优化算法

提出了一种求解旅行商问题的蜂群优化算法。BCO模型是基于蜜蜂觅食行为中显示的集体智慧算法构建的。在一组基准问题上，将所提出的BCO模型与现有的一些方法进行了比较。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

2008 Second Asia International Conference on Modelling & Simulation (AMS)

自引率

0.00%

发文量