平面选址问题的萤火虫算法  

Artificial Glowworm Swarm Optimization Algorithm for Location Problem

作　　者：程魁[1] 马良[1] 

机构地区：[1]上海理工大学管理学院,上海200093

出　　处：《上海理工大学学报》2013年第3期205-208,共4页Journal of University of Shanghai For Science and Technology

基　　金：国家自然科学基金资助项目(70871081);上海市研究生创新基金资助项目(JWCXSL1202)

摘　　要：平面选址问题是工程设计、线路布置、项目选址等工作中经常碰到的典型组合优化难题,根据群集智能优化原理,给出一种基于人工萤火虫群优化算法的求解方法,并针对平面选址问题进行求解.为避免算法陷入局部极值,将一种邻域搜索的局部搜索方法引入萤火虫算法中.通过对典型平面选址问题的仿真实验和与其它算法的比较,表明算法可行有效,且具良好的全局优化能力.The location problem is a typical combinatorial optimization problem in the work of engineering design, line routing, project location, etc. According to the principle of swarm intelligence,a new optimization algorithm based on the idea of glowworms-the glowworm swarm algorithm was presented to solve the location problem. To avoid getting stuck into local optima, a neighborhood search strategy was introduced into the artificial glowworm swarm optimization algorithm. Simulated tests of the location problem and comparisons with other algorithms show that the algorithm is feasible and effective and has strong global optimization ability.

关 键 词：平面选址 萤火虫群优化算法 优化算法 

分 类 号：O211.1[理学—概率论与数理统计] N94[理学—数学]