摘要
分析了梯队铁路装载组合优化问题的复杂性，分别应用全排列算法和模拟退火算法对问题进行求解，并分析了2种算法的时间和空间复杂度。通过实例证明了模拟退火算法的有效性。
The difficulty of optimization of military transportation loading combination is analyzed. Enumerating algorithm and simulated annealing algorithm are used to solve this problem,and time and space complexity of both two algorithms are analyzed. Validity of simulated annealing algorithm is checked by living example.
出处
《军事交通学院学报》
2010年第2期21-24,共4页
Journal of Military Transportation University
关键词
梯队铁路装载
组合优化
全排列算法
模拟退火算法
military transportation loading
combination optimization
enumerating algorithm
simulated annealing algorithm
