摘要
对单车线路优化问题进行重点阐述。求解过程采用了最节约插值法与混合遗传算法,较好地解决了单车配送线路优化问题。通过实例数据测试,表明两种算法的结合优化效果显著。
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.
出处
《计算机工程》
CAS
CSCD
北大核心
2005年第11期32-34,共3页
Computer Engineering
基金
教育部普通高校人文社会科学重点研究基地浙江工商大学现代商贸研究中心基金资助项目
关键词
物流配送
车辆路线问题
最节约插值法
混合遗传算法
Physical distribution
Vehicle routing problem
Saving/Insertion algorithm
Hybrid GA
