| 基于遗传算法求解复杂时间-空间布局问题 |
| |
| 引用本文： | 马成业,李永礼. 基于遗传算法求解复杂时间-空间布局问题[J]. 兰州理工大学学报, 2007, 33(1): 151-154 |
| |
| 作者姓名： | 马成业 李永礼 |
| |
| 作者单位： | 1. 兰州理工大学,理学院,甘肃,兰州,730050
2. 兰州大学,信息科学与工程学院,甘肃,兰州,730000 |
| |
| 摘 要： | 给空间布局问题加入时间约束的多目标、多约束化布局问题(复杂时间-空间布局问题)是NP完全问题.探讨了遗传算法在求解这一复杂问题过程中的应用,提出用分层型遗传算法处理复杂时间-空间布局问题,给出了有效的编码形式和解码运算.根据混合原则和算例,该算法优于普通的遗传算法.
|
| 关 键 词： | 复杂时间-空间布局 分层型遗传算法 多目标优化 混合原则 |
| 文章编号： | 1673-5196（2007）01-0151-04 |
| 收稿时间： | 2005-09-21 |
| 修稿时间： | 2005-09-21 |
Solution complicated time-space layout problem with genetic algorithm |
| |
| MA Cheng-ye,LI Yong-li. Solution complicated time-space layout problem with genetic algorithm[J]. Journal of Lanzhou University of Technology, 2007, 33(1): 151-154 |
| |
| Authors: | MA Cheng-ye LI Yong-li |
| |
| Abstract: | Multi-objective and multi-constraint layout problem of space layout with the time as an added temporal constraint (complicated time-space layout) is an NP-complete problem. In this paper the genetic algorithm for complicate time-space layout is studied. The application of genetic algorithm to solution of complicated time-space layout was discussed and a hierarchical genetic algorithm was used for its solution. The effective coding configuration and decoding operation were also given. It was shown by using the mixture principle and an example that the hierarchical genetic algorithm was superior to the general genetic algorithm. |
| |
| Keywords: | complicated time-space layout hierarchical genetic algorithm multiple-objective optimization mixture principle |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
