现代电子技术2018，Vol.41Issue(11)：119-123,128,6.DOI:10.16652/j.issn.1004-373x.2018.11.027
混合遗传算法的带时间窗卷烟物流车辆路径优化
Hybrid genetic algorithm based cigarette logistics vehicle routing optimization with time window
摘要
Abstract
The vehicle routing problem(VRP)is the key link in logistics distribution. The excellent distribution strategy can improve the service experience and reduce the service cost for enterprises. In cigarette logistics distribution system,it is faced with the problems of a huge number of demand points and specified service time required by customer. In this paper,the route optimization problem for wide range cigarette distribution is studied,the actual demand is combined to construct the route optimization mathematical model of cigarette logistics,and the genetic algorithm is used to deal with the problem. On the basis of genetic algorithm,the hybrid genetic algorithm combining mountain climbing algorithm is put forward for local optimization. The example is calculated with Matlab simulation. The simulation results show that,in comparison with the general genetic algorithm, the optimized hybrid genetic algorithm can improve the convergence speed,and promote the quality of the global optimal solution.关键词
混合遗传算法/爬山算法/路径优化/烟草配送/物流配送/MatlabKey words
hybrid genetic algorithm/mountain climbing algorithm/path optimization/tobacco distribution/logistics distribution/Matlab分类
信息技术与安全科学引用本文复制引用
范文兵,冯文..混合遗传算法的带时间窗卷烟物流车辆路径优化[J].现代电子技术,2018,41(11):119-123,128,6.基金项目
国家自然科学基金项目(61306106)Project Supported by National Natural Science Foundation of China(61306106) （61306106）
