| 注册
首页|期刊导航|计算机应用研究|模糊人工蜂群算法的旅行商问题求解

模糊人工蜂群算法的旅行商问题求解

柳寅 马良

计算机应用研究2013,Vol.30Issue(9):2694-2696,3.
计算机应用研究2013,Vol.30Issue(9):2694-2696,3.DOI:10.3969/j.issn.1001-3695.2013.09.033

模糊人工蜂群算法的旅行商问题求解

Fuzzy artificial bees colony algorithm for solving traveling salesman problem

柳寅 1马良1

作者信息

  • 1. 上海理工大学管理学院,上海200093
  • 折叠

摘要

Abstract

Aiming at the premature convergence problem in traditional intelligent optimization algorithm,this paper proposed a fuzzy artificial bees colony algorithm,it based on the principles of fuzzy processing and bees colony behavior.It introduced fuzzy inputs and fuzzy outputs into the algorithm to maintain dynamic updates of the nectar access probability.According to effective adjustment on nectar access probability during the different stages of algorithm calculation,the algorithm avoided local optima.Simulation tests of traveling salesman problem and comparisons with other algorithms show the performance of proposed algorithm.The computational results prove the algorithm is feasible and effective.

关键词

旅行商问题/模糊规则/智能优化算法/模糊人工蜂群算法

Key words

traveling salesman problem(TSP) / fuzzy rules/ intelligent optimization algorithm/ fuzzy artificial bees colony (FABC) algorithm

分类

信息技术与安全科学

引用本文复制引用

柳寅,马良..模糊人工蜂群算法的旅行商问题求解[J].计算机应用研究,2013,30(9):2694-2696,3.

基金项目

国家自然科学基金资助项目(70871081) (70871081)

上海市研究生创新基金资助项目(JWCXSL1201) (JWCXSL1201)

计算机应用研究

OA北大核心CSCDCSTPCD

1001-3695

访问量0
|
下载量0
段落导航相关论文