期刊文献+

干线运输优化的两阶段局部搜索启发式算法 被引量:1

Two-phase Local Search Heuristic Algorithm for Optimization of Line-haul Freight Transportation
在线阅读 下载PDF
导出
摘要 干线运输的车货匹配及车辆运输路径优化对于降低大规模、多分布网点的物流企业的运输成本有重要意义。建立了干线运输的发车费用模型及总费用模型,提出应用一种基于直达网络搜索和车辆行驶路径搜索的两阶段局部搜索启发式算法进行求解。通过对企业实际数据的计算,表明该算法优化了干线运输的运输路径,减少了运输车辆数,降低了运输总费用,具有较好的应用前景。 The optimization of loading and route-selecting in line-haul freight transportation is of great significance for large-scale logistics corporation with many distributed points in its transportation network, for it can reduce the system cost. The vehicle-dispatching cost model and the total expenditure model in line-haul transportation were built. A two-phase local search heuristic algorithm based on direct-network searching and route searching was proposed, By computational results based on practical data of a corporation, this algorithm proved to be capable of improving the routes, decreasing the vehicle number, and saving the total transportation cost, hence it has great potential usage.
出处 《系统仿真学报》 EI CAS CSCD 北大核心 2008年第15期4141-4145,共5页 Journal of System Simulation
基金 北京市科委科技奥运专项基金(H030630020520)
关键词 干线运输 局部搜索算法 边际调整算法 路径优化 line-haul transportation local search algorithm marginal cost heuristic algorithm optimization of route
  • 相关文献

参考文献10

  • 1孙丽君,胡祥培,王征.车辆路径规划问题及其求解方法研究进展[J].系统工程,2006,24(11):31-37. 被引量:46
  • 2蒋忠中,汪定伟.物流配送车辆路径优化的模糊规划模型与算法[J].系统仿真学报,2006,18(11):3301-3304. 被引量:33
  • 3Stefan Irnich. A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles [J]. European Journal of Operational Research (S0377-2217), 2000, 122(2): 310-328.
  • 4Magnanti T L, Wong R T. Network design and transportation planning: Models and algorithms [J]. Transportation Science (S0041-1655), 1986, 18(1): 12-55.
  • 5王永县.运筹学,规划论及网络[M],北京:清华大学出版社,2005,46-51.
  • 6Martin Jobom, Teodor Gabriel Crainic, Michel Gendreau, Kaj Holmberg, Jan T Lundgren. Economies of Scale in Empty Freight Car Distribution in Scheduled Railways [J]. Transportation Science (S0041-1655), 2004, 38(2): 121-134.
  • 7万华,叶耀华.一种带路径约束的多商品流网络设计问题及其禁忌算法[J].复旦学报(自然科学版),2005,44(2):220-223. 被引量:6
  • 8Janny M Y Leung, Thomas L Magnant, Vijay Singhal. Routing in Point-to-Point Delivery Systems: Formulations and Solution Heuristics [J]. Transportation Science (S0041-1655), 1990, 24(4): 245-260.
  • 9Warren B Powell. Local Improvement Heuristic for the design of Less-Than-Truckload Motor Carrier Network [J]. Transportation Science (S0041-1655), 1986, 20(4): 246-257.
  • 10Warren B Powell, Ioannis A Koskosidis. Shipment Routing Algorithms with Tree Constraints [J]. Transportation Science (S0041- 1655), 1992, 26(3): 230-245.

二级参考文献71

共引文献82

同被引文献12

  • 1LI Wen quan, WANG Wei, DENG Wei Transportation College, Southeast University, Nanjing 210096, China.Capacity of Multi- vehicle- types Mixed Traffic Flow[J].Journal of Systems Science and Systems Engineering,2001,13(1):7-14. 被引量:1
  • 2丁秋雷,胡祥培,李永先.求解有时间窗的车辆路径问题的混合蚁群算法[J].系统工程理论与实践,2007,27(10):98-104. 被引量:27
  • 3王江晴,康立山.动态车辆路径问题仿真器的设计与实现[J].核电子学与探测技术,2007,27(5):991-994. 被引量:3
  • 4CHERKASSKY B V, GOLDBE-RG A V, RADZIK T. Shortest path's algorithmsz theory and experi- mental evaluation [J]. Mathematical Programming, 1996,73 : 129-174.
  • 5PAOLO T, DANIELE V. The vehicle routing Prob-lem[M],北京:清华大学出版社.2011.
  • 6YANG H,BELL M G H. Models and algorithms for road network design: a reaiew and some new devel- opments[J]. Transport Review , 1998,18 : 257-278.
  • 7MICHAEL Z,STEFANO F. BROWAND F K. Drag measurements on 2,3 and 4 car platoons[C]. SAE Paper, 940421.
  • 8FENG Pengcheng, GAO Shesheng, SONG Feibiao. Are- a-layered paths optimizing algorithms of plation vehicle [C]//International Conference on Industrial Control & Electronics Engineering, 2011 :2780- 2788.
  • 9STIG N,BENGT R. Computer cartography Shortest route program[M]. Sweden: The Royal University of Lund,1969.
  • 10何方国,齐欢,范琼.有约束的随机最短路问题模型及算法[J].武汉理工大学学报(交通科学与工程版),2008,32(6):1125-1128. 被引量:7

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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