期刊文献+

基于并购算法的物流配送路径优化的研究 被引量:4

Research on Optimizing Physical Distribution Routing Based on Mergers & Acquisitions Algorithm
在线阅读 下载PDF
导出
摘要 优化物流配送路径是一个经典的NP问题,构造基于并购算法的物流配送路径优化的模型。经过多次模拟实验,可以快速获取物流配送路径优化问题的最优解或近似最优解。由此得出并购算法在求解物流配路径优化方面有较强的优越性。 Optimizing physical distribution routing is a classic NP problem; it constructs the model of optimizing physical distribution routing based on M & A algorithm. After making some experiments, it obtains quickly the optimal or nearly optimal solutions to the problem of optimizing physical distribution routing. Thus, M&A algorithm has its own superiority in solving the problem of optimizing physical distribution routing.
出处 《计算机与数字工程》 2009年第8期25-28,共4页 Computer & Digital Engineering
基金 浙江省科技计划项目(编号:2008C11106-2)资助
关键词 并购算法 物流配送 劣信度 路径优化 mergers&acquisitions algorithm, physical distribution, bad credit, optimizing routing
  • 相关文献

参考文献11

  • 1Baker M. Baker, M. A. Ayechew. Agenetic algorithm for the vehicle routing problem [J]. Computers & Operations Research, 2003,30(5) : 787-800.
  • 2Yannis Marinakis, Athanasios Migdalas, Panos M. Pardalos, A new bilevel formulation for the vehicle muting problem and a solution method using a genetic algorithm [J]. Journal of Global Optimization, 2007,38 (4) : 555-580.
  • 3Alvarenga, G. B. ,Mateus, G. R. ,& de Tomi, G. A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows [J]. Computers & Operations Research, 2007,34:1561-1584.
  • 4Beatrice Ornbuki, Brian J. Ross, Franklin Hanshar. Multi-objective genetic algorithms for vehicle muting problem with time windows [J]. Applied Intelligence, 2006,24:17-30.
  • 5Franklin T. Hanshar, Beatrice M. Ombuki-Berman, Dynamic vehicle routing using genetic algorithms [J]. Applied Intelligence, 2006,27 (1): 89- 99.
  • 6Hoong Chuin Lau, Melvyn Sim. Vehicle Routing Problem with Time Windows and a Limited Number of Vehicles [J]. European Journal of Operational Research, 2003,148 : 559-569.
  • 7Min H. The multiple vehicle routing problem with simultaneous delivery and pickup points. Transportation Research A, 1989, 23A (5) :377-386.
  • 8Prive J, Renaud J, Boctor F, et al. Solving a vehicle routing problem arising in soft drink distribution [J]. Journal of the Operational Research Society, 2006,57(9) : 1045-1052.
  • 9Bianchessi N, Righini G. Heuristic algorithms for the vehicle muting problem with simultaneous pick-up and delivery [J]. Computers & Operations Research, 2007,34(2) :578-594.
  • 10张翠军,张敬敏,王占锋.基于车辆路径问题的蚁群遗传融合优化算法[J].计算机工程与应用,2008,44(4):233-235. 被引量:17

二级参考文献8

共引文献62

同被引文献28

  • 1刘小兰,郝志峰,汪国强,符克强.有时间窗的车辆路径问题的近似算法研究[J].计算机集成制造系统,2004,10(7):825-831. 被引量:22
  • 2梁文,罗文坚,曹先彬,王煦法.基于生态捕食模型的多目标优化问题求解算法[J].中国科学技术大学学报,2005,35(3):360-366. 被引量:8
  • 3李军.有时间窗的车辆路线安排问题的启发式算法[J].系统工程,1996,14(5):45-50. 被引量:57
  • 4Rochat Y,Taillard E.Probabilistic diversification and intensification in local search for vehicle routing[J].Journal of Heuristics,1995,1(1):147-167.
  • 5Taillard E,Badeau P,Genderau M,et al.A tabu search heuristic for the vehicle routing problem with soft time windows[J].Transportation Science,1997,31(2):170-186.
  • 6Thangiah S R,Osman I H,Inayagamoorthy R,et al.Algorithms for the vehicle routing problems with time deadlines[J].Amer J Math Management Sci,1994,13(3/4):323-355.
  • 7Bent R,Van Hentenryck P.A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows[J].Transportation Science,2004,38(4):515-530.
  • 8Baker B M,Ayechew M A.Agenetic algorithm for the vehicle routing problem[J].Computers & Operations Research,2003,30(5):787-800.
  • 9Hanshar F T,Ombuki-Berman B M.Dynamic vehicle routing using genetic algorithms[J].Applied Intelligence,2007,27(1):89-99.
  • 10Alvarenga G B,Mateus G R,de Tomi G.A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows[J].Computers & Operations Research,2007,34(6):1561-1584.

引证文献4

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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