Obtain the optimal of logistics delivery network with annealing algorithm

作     者：Duan Jingmin Chang Yuejun Li Zanxiang Cui Jianming 

作者机构：Department of Architectural EngineeringSanmenxia Polytechnic Department of Bridge EngineeringSouthwest Jiaotong University Henan Construction Engineering Department Building School of Information EngineeringChang'an University 

出 版 物：《Engineering Sciences》 (中国工程科学（英文版）)

年 卷 期：2013年第11卷第6期

页      面：44-47页

学科分类：12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 08[工学] 081202[工学-计算机软件与理论] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：National Natural Science Foundation of China(No.50574037) Henan Soft Science Research Project(No.102400410033 No.102400410032) 

主　　题：SA algorithm global optimum logistics and distribution network 

摘      要：Simulated annealing(SA) algorithm is a heuristic algorithm,proposed one approximation algorithm of solving optimization combinatorial problems inspired by objects in the annealing process of heating crunch. The algorithm is superior to the traditional greedy algorithm,which avoids falling into local optimum and reaches global optimum. There are often some problems to find the shortest path,etc in the logistics and 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 SA algorithm validation to verify it,and the method is proved to be feasible.