模拟退火算法是一种启发式算法,是受到加热紧缩的退火过程所启发而提出来的求解组合优化问题的一种逼近算法。算法要优于传统的贪婪算法,避免了陷入局部最优的可能,从而达到全局最优解。在物流配送网络中经常有一些寻求最短路径等问题出现,为了能够达到最短、最优、最经济等,需要进行物流配送路径寻优。文中采用模拟退火算法进行一个示例的验证,效果证明可行。
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.