| 模拟退火算法求解指派问题新探 |
| |
| 引用本文： | 赵越. 模拟退火算法求解指派问题新探[J]. 吉林建筑工程学院学报, 2011, 0(4): 61-63 |
| |
| 作者姓名： | 赵越 |
| |
| 作者单位： | 吉林建筑工程学院计算机科学与工程学院; |
| |
| 基金项目： | 吉林省教育厅“十一五”科学技术研究项目(吉教科合字2010第314号) |
| |
| 摘 要： | 模拟退火算法是一种随机搜索算法,能渐进地收敛于全局最优解.指派问题是组合优化问题中的一种,可用模拟退火算法来解此问题.模拟退火算法解决指派问题时,需要考虑实现此算法的技术问题,例如解的形式、初始温度的计算等.实验结果表明,该方法能够以一定的概率跳出局部最优,从而实现全局寻优.
|
| 关 键 词： | 模拟退火算法 指派问题 组合优化 |
A New Way to Solve Assignment Problem Using Simulated Annealing Algorithm |
| |
| ZHAO Yue. A New Way to Solve Assignment Problem Using Simulated Annealing Algorithm[J]. Journal of Jilin Architectural and Civil Engineering, 2011, 0(4): 61-63 |
| |
| Authors: | ZHAO Yue |
| |
| Affiliation: | ZHAO Yue(School of Computer Science and Engineering,Jilin Institute of Architecture and Civil Engineering,Changchun,China 130118) |
| |
| Abstract: | Simulated annealing algorithm is a random search algorithm,and it can be gradual convergence in the global optimal solution.The assignment problem is one of combinatorial optimization problems.Simulated annealing algorithm can be used to solve assignment problem.When using the algorithm,various technical issues of the algorithm must be considered,such as the form of solution,the initial temperature account etc.Examples simulation shows that the method can jump out of local optimum solution with a certain pr... |
| |
| Keywords: | simulated annealing algorithm assignment problem combinatorial optimization |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
