一种改进的模拟退火算法在服装配送系统中的应用  

An Improved Simulated Annealing Algorithm in Clothing Allocation System

作　　者：贾祥素[1] 董方武[1] 

机构地区：[1]浙江纺织服装职业技术学院机电分院,浙江宁波315211

出　　处：《工业控制计算机》2009年第10期44-45,共2页Industrial Control Computer

摘　　要：服装配送可以归类为TSP问题的应用之一。处理TSP问题有很多算法,针对传统模拟退火算法在求解TSP问题中存在的收敛速度慢、易陷入局部最优等一些缺陷,提出了一种基于传统模拟退火算法的改进算法:将2变换法与3变换法结合起来产生新解。并添加具有记忆功能的模拟退火算法。不同温度下采用不同的迭代次数。并用C语言进行实现,实验结果表明,改进后的算法在稳定性、有效性以及收敛速度方面都优于传统的模拟退火算法。Clothing allocation is one of the application of TSP problem.The solution of TSP has lots of algorithms.An improved simulated annealing algorithm is proposed in view of the flaws such as slow convergence,get into the local minima that exist when traditional simulated annealing algorithm is used to solve the TSP problem.Unifies 2 methods of transformation with 3 methods of transformation has the new solution,and add a memory function,also Different temperatures using different number of iterations.The algorithm is realized under C environment,and the simulation results demonstrated that the improved algorithm is superior to the traditional simulated annealing algorithm in the stability,the efficiency as well as the convergent speed.

关 键 词：模拟退火 服装配送 TSP 路经优化 物流 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构] O224[自动化与计算机技术—计算机科学与技术]