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

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

{"title":"旅行商问题的蜂群优化算法","authors":"L. Wong, M. Low, C. Chong","doi":"10.1109/AMS.2008.27","DOIUrl":null,"url":null,"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.","PeriodicalId":122964,"journal":{"name":"2008 Second Asia International Conference on Modelling & Simulation (AMS)","volume":"195 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"161","resultStr":"{\"title\":\"A Bee Colony Optimization Algorithm for Traveling Salesman Problem\",\"authors\":\"L. Wong, M. Low, C. Chong\",\"doi\":\"10.1109/AMS.2008.27\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":122964,\"journal\":{\"name\":\"2008 Second Asia International Conference on Modelling & Simulation (AMS)\",\"volume\":\"195 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-05-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"161\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 Second Asia International Conference on Modelling & Simulation (AMS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AMS.2008.27\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 Second Asia International Conference on Modelling & Simulation (AMS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AMS.2008.27","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 161

摘要

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

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

查看原文本刊更多论文

A Bee Colony Optimization Algorithm for Traveling Salesman Problem

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

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

自引率

0.00%

发文量