摘要： 对单车线路优化问题进行重点阐述。求解过程采用了最节约插值法与混合遗传算法,较好地解决了单车配送线路优化问题。通过实例数据测试,表明两种算法的结合优化效果显著。
关键词:
物流配送,
车辆路线问题,
最节约插值法,
混合遗传算法
Abstract: This paper focuses on the single vehicle routing problem (SVRP). Two algorithms with good generality are adopted. One is the saving/insertion and the other is the hybrid genetic algorithm (hybrid GA) that HC algorithm is added GA. At last, the SVRP is well solved by combining the above two algorithms. A case verifies the efficiency of the algorithm.
中图分类号:
陈子侠,叶庆泰. 基于城市配送的单车线路算法研究[J]. , 2005, 31(11): 41-43.
CHEN Zixia 1, YE Qingtai 2. An Algorithm Research on Single Vehicle Routing Problem Based on Real Streets Distribution[J]. , 2005, 31(11): 41-43.