多目标0-1规划问题的蜂群算法  

Bee Colony Algorithm for Multi-objective 0-1 Programming Problem

作　　者：樊小毛[1] 马良[1] 

机构地区：[1]上海理工大学,200090

出　　处：《微计算机信息》2010年第30期207-208,107,共3页Control & Automation

摘　　要：蜂群算法是一种新型的群体智能算法,为求解复杂的组合优化NP问题提供了一种新的思路。蜂群算法具有算法简单、并行性、鲁棒性强等优点,在求解多目标0-1规划问题中,经大量实验算例测试,并与其它智能算法进行比较,能够获得较多的非劣解。Bee colony algorithm is a novel swarm intelligence algorithm,which provides a new idea for complicated combinatorial optimization NP problems.In solving the muliti -objective 0 -1 programming problem,a lot of experimental examples are tested.The test results are compared with other intelligent algorithms,the proposed algorithm with the properties of simple,parallelism,robustness etc,can get more non-dominated solutions.

关 键 词：多目标 优化 蜂群算法 群集智能 

分 类 号：O22[理学—运筹学与控制论]