| 设施布置算法性能比较和仿真实现 |
| |
| 引用本文： | 赵晓华.设施布置算法性能比较和仿真实现[J].科学技术与工程,2012,12(17). |
| |
| 作者姓名： | 赵晓华 |
| |
| 作者单位： | 陕西交通职业技术学院 |
| |
| 基金项目： | 中央高校基本科研业务费专项资金(CHD2010ZY012) |
| |
| 摘 要： | 为了解决多目标的优化问题，本文提出了变动临近区域遗传算法。算法在解决设施布置问题时，改进了质化研究和量化研究中的一些不足。仿真结果表明，与传统的的NPGA、VEGA遗传算法相比较，该算法在最终解个数、算法的稳定性、染色体的均匀程度等评价指标上为最优。
|
| 关 键 词： | 遗传算法 Pareto最优解集 设施布置 多目标优化问题 |
| 收稿时间： | 3/4/2012 10:46:26 PM |
| 修稿时间： | 3/17/2012 2:17:25 PM |
The Performance Comparison and Simulation of |
| |
| zhaoxiaohua.The Performance Comparison and Simulation of[J].Science Technology and Engineering,2012,12(17). |
| |
| Authors: | zhaoxiaohua |
| |
| Abstract: | In order to solve multi-objective optimization problems, this paper presented neighbor change genetic algorithm. The algorithm improves some deficiencies in the qualitative research and quantitative research while solving facility layout problems. Simulation results show that algorithm performance is optimal compared with traditional NPGA, VEGA genetic algorithms in the final number, method of solution on stability, chromosome uniformity. |
| |
| Keywords: | |
|
| 点击此处可从《科学技术与工程》浏览原始摘要信息 |
| 点击此处可从《科学技术与工程》下载免费的PDF全文 |
