基于退火算法的物流配送网的求优研究  

Obtain the optimum of logistics delivery network with annealing algorithm

作　　者：段敬民[1,2] 常跃军 李赞祥[1] 崔建明[4] 

机构地区：[1]三门峡职业技术学院建筑工程系,河南三门峡472000 [2]西南交通大学桥梁及结构工程系,成都610031 [3]河南工程技术学校建筑工程系,河南焦作454000 [4]长安大学信息工程学院,西安710064

出　　处：《中国工程科学》2012年第7期109-112,共4页Strategic Study of CAE

基　　金：国家自然科学基金资助项目(50574037);河南省软科学研究项目(102400410033;102400410032;102400410035)

摘　　要：模拟退火算法是一种启发式算法,是受到加热紧缩的退火过程所启发而提出来的求解组合优化问题的一种逼近算法。算法要优于传统的贪婪算法,避免了陷入局部最优的可能,从而达到全局最优解。在物流配送网络中经常有一些寻求最短路径等问题出现,为了能够达到最短、最优、最经济等,需要进行物流配送路径寻优。文中采用模拟退火算法进行一个示例的验证,效果证明可行。Simulated annealing algorithm is a heuristic algorithm, proposed one approximation algorithm of solving optimization combinatorial problems inspired by objects in the annealing process by heating crunch. The al- gorithm is superior to the traditional greedy algorithm, which avoids falling into local optimum and reaches global op- timum. There are often some problems to find the shortest path, etc. , in the logistics and we distribution network, and we need optimization for logistics and distribution path in order to achieve the shortest, best, most economical, and so on. The paper uses an example of simulated annealing algorithm to verify it, and the method is proved to be feasible.

关 键 词：模拟退火算法 全局最优解 物流配送网 

分 类 号：TP311.13[自动化与计算机技术—计算机软件与理论]