计算机工程与应用2016，Vol.52Issue(12)：256-260,5.DOI:10.3778/j.issn.1002-8331.1510-0306
供应链中车辆路径问题的改进模拟退火算法
Improved simulated annealing algorithm for vehicle routing problem in supply chain
吴艳群 1董鹏1
作者信息
- 1. 兰州交通大学 交通运输学院，兰州 730070
- 折叠
摘要
Abstract
The optimization of vehicle route is an important link in supply chain optimization. An improved simulated annealing algorithm is designed to solve the vehicle routing problem with following three constraints:customer demand, maximum load and maximum distance of vehicles. Main improvement includes:using the order of the customer code in encoding scheme, designing a special decoding method which can take all three constraints into account, comprehensively applying three kinds of operators in neighborhood generation to improve local search ability, adopting basic linear cooling method to control the cooling process. Three simulation experiments are conducted for the same calculation example. Each of them has a different cooling coefficient, and a better delivery scheme is achieved in each experiment. Experimental results show that the proposed algorithm is not only fast, but also has a conspicuous increase in search ability.关键词
供应链优化/物流配送/车辆路径问题/模拟退火算法Key words
supply chain optimization/logistics distribution/vehicle routing problem/simulated annealing algorithm分类
交通工程引用本文复制引用
吴艳群,董鹏..供应链中车辆路径问题的改进模拟退火算法[J].计算机工程与应用,2016,52(12):256-260,5.
