期刊文献+

以均衡为目标的车辆调度问题研究 被引量:2

Research on Vehicle Routing Problem Aimed at Balance
下载PDF
导出
摘要 针对物流配送企业私人承包车辆以及均衡配送线路工作量等新的物流管理理念,提出新的车辆调度模型,将车辆调度问题(VRP)转换为车辆选型和车辆路径优化两个子问题,设计Ak-FirstFit混合算法解决车辆选型问题,运用遗传算法解决车辆路径问题。基于JAVA编写计算机程序,运行结果表明该两阶段算法能够在有效时间内得到满意解。与基于传统物流管理理念的模型进行比较,得出新的两阶段模型能充分体现兼顾效率与公平思想的结论,其理念在物流配送企业中具有相当的借鉴性和推广前景。 A new vehicle routing model was put forward based on the new concepts of logistics management such as individual possession of trucks and balancing workload of the delivery routes.The vehicle routing problem was partitioned into two sub-problems:types of truck choosing problem and vehicle routing problem.The first problem was solved by designed Ak-First Fit hybrid algorithm and the second problem was solved by genetic algorithm(GA).The results of the computer program which based on JAVA showed the proposed twophased algorithm could obtain a good result in efficient time.Compared with the model which based on conventional concepts of logistics management,the conclusion that the new two-phased model indicated the idea of concerning efficiency and fairness at one time was proved.The new idea should be used for reference by other logistics companies and it had an extensive spreading perspective.
出处 《物流科技》 2010年第6期22-25,共4页 Logistics Sci-Tech
关键词 物流管理 车辆调度 遗传算法 运输经济 logistics management vehicle routing genetic algorithm transportation economics
  • 相关文献

参考文献4

二级参考文献26

  • 1张潜,高立群,胡祥培.集成化物流中的定位配给问题的启发式算法[J].东北大学学报(自然科学版),2004,25(7):637-640. 被引量:7
  • 2赵建有,闫旺,胡大伟.配送网络规划蚁群算法[J].交通运输工程学报,2004,4(3):79-81. 被引量:15
  • 3章兢,周泉.基于免疫克隆算法的物流配送车辆路径优化研究[J].湖南大学学报(自然科学版),2004,31(5):54-58. 被引量:10
  • 4Desrosiers J, Dumas Y, Solomon M M. A dynamic programming solution of the large-scale single-vehicle dial-a-ride problem with time windows[J]. American Journal of Mathematical and Management Sciences, 1986, 6(3~4): 301~325. 被引量:1
  • 5Dumas Y, Desrosiers J, Soumis F. The pickup and delivery problem with time windows[J]. European Journal of Operational Research, 1991, 54(1): 7-22. 被引量:1
  • 6Li H, Lim A. A metaheuristic for the pickup and delivery problem with time windows[A]. Proceedings of the 13th International Conference on Tools with Artificial Intelligence[C]. Dallas: IEEE Computer Society, 2001.160~167. 被引量:1
  • 7William P, Nanry J, Wesley B. Solving the pickup and delivery problem with time windows using reactive tabu search[J]. Transportation Research:Part B, 2000, 34(2):107-121. 被引量:1
  • 8Christos V, Edward T. Guided local search and its application to the traveling salesman problem[J]. European Journal of Operational Research, 1999,113(2): 469-499. 被引量:1
  • 9Paolo T , Daniele V. Models relaxations and exact approaches for the capacltated vehicle routing problem[J]. Discrete Applied Mathematics, 2002,123 ( 1 3) : 487- 512. 被引量:1
  • 10Wu Tai -his,Low C, Bai Jiunn- wei. Heuristic solutions to multi-depot location-routing problems[J]. Computers and Operation Research,2002,29;1 393-1 415. 被引量:1

共引文献39

同被引文献12

引证文献2

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部