期刊文献+

青岛保税港区物流企业货运路线优化研究 被引量:2

Research on Freight Transport Route Optimization of Logistics Enterprises in Qingdao Bonded Port Area
下载PDF
导出
摘要 基于现有的研究理论及其研究成果,结合青岛保税港区A公司的运输现状,针对A公司货运路线具有一个配送中心、多个配送点、时间窗限制、开环的VRP等货运特点,在同时满足运输路径、运输时间、运输载重、车辆需求等约束条件下,以总运输成本最低为目标,构建了青岛市保税港区A公司货运路线VRP模型,采用节约里程法进行货运线路优化,优化后的线路可以提高货运效率、服务满意率并降低货运成本,为青岛保税港区A公司货运决策提供了科学参考。 In this paper, based on existing theories and research findings, combined with the transportation status of a company A in the Qingdao Bonded Port Area, in light of the characteristics of the freight transport route of the company such as single distribution center,multiple distribution points, time window restrictions and open-loop VRP, etc., and aiming to minimize the total transportation cost while simultaneously meeting the constraints of transportation route, transportation time, transportation load, and vehicle demand, we built the VRP model of the freight transportation routes of the company, and used the mileage-saving method to optimize them which could improve the freight efficiency and service satisfaction, and reduce the freight cost of the company.
作者 王海燕 鲁宁 Wang Haiyan;Lu Ning(Wuhan University of Technology,Wuhan 430070,China)
机构地区 武汉理工大学
出处 《物流技术》 2018年第6期72-76,共5页 Logistics Technology
关键词 保税港区 物流配送 VRP 节约里程法 青岛 bonded port area logistics distribution VRP mileage-saving method Qingdao
  • 相关文献

参考文献4

二级参考文献25

  • 1王荣花.基于节约里程法的快递企业配送线路优化[J].管理学家,2011,(05):345-346.
  • 2Theodore A, Ioannis M. Efficient techniques for the muhi-period vehicle routing problem with time windows within a branch and price framework[J]. Annals of Operations Research, 2013,206:1-22.
  • 3Alireza R-V, Teodor GC, Michel G, et al. A path relinking algorithm for a multi-depot periodic vehicle routing problem[J]. Heuristics, 2013,19:497-524.
  • 4Mohammad Mirabi. A hybrid electromagnetism algorithm for multi-depot periodic vehicle routing problem[J]. Int J Adv Manuf Technol, 2014,71:509-518.
  • 5Phuong Khanh Nguyen, Teodor Gabriel Crainic, Michel Toulouse. A hybrid generational genetic algorithm for the periodic ve- hicle routing problem with time windows[J]. J Heuristics, 2014,20:383-416.
  • 6V. Cacchiani, V. C. Hemmelmayr, F. Tricoire. A set-covering based heuristic algorithm for the periodic vehicle routing prob- lem[J]. Discrete Applied Mathematics, 2014,163:53-64.
  • 7Julien Michallet, Christian Prins, Lionel Amodeo, et al. Multi-start iterated local search for the periodic vehicle routing prob- lem with time windows and time spread constraints on services[J]. Computers & Operations Research, 2014,41:196-207.
  • 8Suyanto C, Herman M. A model for periodic vehicle routing problem with delivery and pick-up considering maximum dis- tance[J]. International Journal of Science and Advanced Technology, 2014,4(8):1-9.
  • 9Narges Norouzi, Mohsen Sadegh-Amalnick, Mehdi Alinaghiyan. Evaluating of the particle swarm optimization in a periodic vehicle routing problem[J]. Measurement, 2015,62:162-169.
  • 10Mohammad M. A novel hybrid genetic algorithm for the muhidepot periodic vehicle routing problem[J]. Artificial Intelligence for Engineering Design, 2015,29:45-54.

共引文献7

同被引文献15

引证文献2

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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