| 基于模拟退火算法的布局问题研究 |
| |
| 引用本文： | 张和君,张跃. 基于模拟退火算法的布局问题研究[J]. 计算机工程与设计, 2006, 27(11): 1985-1988 |
| |
| 作者姓名： | 张和君 张跃 |
| |
| 作者单位： | 清华大学,深圳研究生院,广东,深圳,518055;清华大学,深圳研究生院,广东,深圳,518055 |
| |
| 摘 要： | 在传统模拟退火算法的基础上,对布局问题的优化算法进行了研究,采用回火策略,改进一般模拟退火算法寻优的效果;结合布局问题的具体特点,采用Sequence Pair来描述布局问题的解结构,综合构成了一种新的求解布局问题的模拟退火算法.通过算例验证,该算法优于传统优化算法和普通启发式搜索算法,并且对增量布局也能够取得较好的效果.
|
| 关 键 词： | 布局问题 增量布局 模拟退火算法 回火策略 序列对 算法设计 |
| 文章编号： | 1000-7024（2006）11-1985-04 |
| 收稿时间： | 2005-04-18 |
| 修稿时间： | 2005-04-18 |
Research on packing problem based on simulated annealing algorithm |
| |
| ZHANG He-jun,ZHANG Yue. Research on packing problem based on simulated annealing algorithm[J]. Computer Engineering and Design, 2006, 27(11): 1985-1988 |
| |
| Authors: | ZHANG He-jun ZHANG Yue |
| |
| Affiliation: | Graduate School at Shenzhen, Tsinghua University, Shenzhen 518055, China |
| |
| Abstract: | A new simulated annealing algorithm to solve packing problems is introduced. Temper strategy is adopted based on traditional simulated annealing algorithm so as to improve result optimization, Considering the characteristics of packing problem, Sequence pair is used to describe the structure of the answer to packing problems. Validated by calculation, this algorithm is not only enhanced result optimization comparing with traditional algorithm, but also improves packing problems. |
| |
| Keywords: | packing problem increment packing problem simulated annealing algorithm temper strategy sequence pair algorithm design |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
