| 基于序列对和模拟退火算法的布局问题研究 |
| |
| 引用本文： | 孙翠翠,林都. 基于序列对和模拟退火算法的布局问题研究[J]. 微计算机信息, 2010, 0(4) |
| |
| 作者姓名： | 孙翠翠 林都 |
| |
| 作者单位： | 中北大学经济与管理学院;中北大学信息与通信工程学院; |
| |
| 摘 要： | 结合布局问题的具体特点,采用序列对来间接描述布局问题的解结构,并且在模拟退火算法的基础上对布局问题的优化算法进行了研究,综合构成了一种有效求解布局问题的模拟退火算法。还将传统模拟退火算法和加回火策略的模拟退火算法的测试结果进行了比较。通过测试模块验证,传统算法取得了很优的结果,加回火策略的算法略微优于传统优化算法但却大大增加了时间复杂度。
|
| 关 键 词： | 布局问题 模拟退火算法 回火策略 序列对 |
Research on packing problem based on sequence pair and simulated annealing algorithm |
| |
| SUN Cui-cui LIN Du. Research on packing problem based on sequence pair and simulated annealing algorithm[J]. Control & Automation, 2010, 0(4) |
| |
| Authors: | SUN Cui-cui LIN Du |
| |
| Abstract: | A effective simulated annealing algorithm to solve packing problems is introduced. Traditional simulated annealing algorithm and temper strategy based on traditional simulated annealing algorithm are both adopted 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. Vali-dated by calculation,traditional algorithm get very good result and temper strategy is a little better comparing with trad... |
| |
| Keywords: | packing problem simulated annealing algorithm temper strategy sequence pair |
| 本文献已被 CNKI 等数据库收录！ |
