期刊文献+

Optimization for vehicle scheduling in iron and steel works based on semi-trailer swap transport 被引量:7

Optimization for vehicle scheduling in iron and steel works based on semi-trailer swap transport
下载PDF
导出
摘要 In order to solve internal logistics problems of iron and steel works,such as low transportation efficiency of vehicles and high transportation cost,the production process and traditional transportation style of iron and steel works were introduced.The internal transport tasks of iron and steel works were grouped based on cluster analysis according to demand time of the transportation.An improved vehicle scheduling model of semi-trailer swap transport among loading nodes and unloading nodes in one task group was set up.The algorithm was designed to solve the vehicle routing problem with simultaneous pick-up and delivery(VRPSPD) problem based on semi-trailer swap transport.A solving program was written by MATLAB software and the method to figure out the optimal path of each grouping was obtained.The dropping and pulling transportation plan of the tractor was designed.And an example of semi-trailer swap transport in iron and steel works was given.The results indicate that semi-trailer swap transport can decrease the numbers of vehicles and drivers by 54.5% and 88.6% respectively compared with decentralized scheduling in iron and steel works,and the total distance traveled reduces by 43.5%.The semi-trailer swap transport can help the iron and steel works develop the production in intension. In order to solve internal logistics problems of iron and steel works, such as low transportation efficiency of vehicles and high transportation cost, the production process and traditional transportation style of iron and steel works were introduced. The internal transport tasks of iron and steel works were grouped based on cluster analysis according to demand time of the transportation An improved vehicle scheduling model of semi-trailer swap transport among loading nodes and unloading nodes in one task group was set up. The algorithm was designed to solve the vehicle routing problem with simultaneous pick-up and delivery (VRPSPD) problem based on semi-trailer swap transport. A solving program was written by MATLAB software and the method to figure out the optimal path of each grouping was obtained. The dropping and pulling transportation plan of the tractor was designed. And an example of semi-trailer swap transport in iron and steel works was given. The results indicate that semi-trailer swap transport can decrease the numbers of vehicles and drivers by 54.5% and 88.6% respectively compared with decentralized scheduling in iron and steel works, and the total distance traveled reduces by 43.5%. The semi-trailer swap transport can help the iron and steel works develop the production in intension.
出处 《Journal of Central South University》 SCIE EI CAS 2010年第4期873-879,共7页 中南大学学报(英文版)
基金 Project(70671108) supported by the National Natural Science Foundation of China
关键词 TRANSPORTATION semi-trailer swap transportation cluster analysis vehicle scheduling iron and steel works 车辆运输 运输调度 钢铁厂 半挂车 基础 优化 MATLAB 生产过程
  • 相关文献

参考文献16

  • 1QU Xi-ding, SHI Mei-lun. Theoretical study on the logistics technology in modern iron and steel works [J]. Iron and Steel, 2002, 37(12): 72-75.
  • 2PR1NS C. A simple and effective evolutionary algorithm for the vehicle routing problem [J]. Computers and Operations Research, 2004, 31(12): 1985 -2002.
  • 3MIN H. The multiple vehicle route problem with simultaneous delivery and pickup nodes [J], Transportation Research Part A, 1989, 23(5): 377-386.
  • 4HU Si-ji. Integrated transport engineering [M]. Beijing: Tsinghua University Press, 2005: 10-30.
  • 5李亚茹.提高道路运输效率的有效途径——甩挂运输[J].公路交通科技,2004,21(4):119-122. 被引量:53
  • 6SEMET F. A two-phase algorithm for the partial accessibility constrained vehicle routing problem [J]. Annals of Operations Research, 1995, 61: 45-65.
  • 7GERDESSEN J C. Vehicle routing problem with trailers [J].European Journal of Operational Research, 1996, 93(1): 135-147.
  • 8CHAO I M. A tabu search method for the truck and trailer routing problem [J]. Computers and Operations Research, 2002, 29(1): 33- 51.
  • 9SCHEUERER S. A tabu search heuristic for the truck and trailer routing problem [J]. Computers and Operations Research, 2006, 33(4): 894-909.
  • 10LIN S W, VINCENT F Y, CHOU S Y. Solving the truck and trailer routing problem based on a simulated annealing heuristic [J]. Computers and Operations Research, 2009, 36(5): 1683-1692.

二级参考文献17

  • 1松田浩一 大方敏仁 星野刚一 等.原料船运行计划作成システム[J].CAMP-ISIJ,1998,11:256-256.
  • 2[1] DOD Directive 4100.35. Development of integrated logistics support for system/equipment[M]. Washington: Department of Defense, 1970.
  • 3[2] Magee J F. Industrial logistics[M]. New York: McGraw-Hill Book Co, 1968.
  • 4[3] Bowersox D J. Logistics management[M]. New York: Macmillan Publishing Co, 1974.
  • 5国分村生,安田素郎,入月克已.ヤ-ド操业计划システムの开发[J].川崎制铁技报,1997,29(1):16-18.
  • 6田村昌弘.溶铣物流システムの改善[J].钢铁のIE,1996,34(1):36-44.
  • 7青谷和俊.加古川制铁所における制钢-热延一贯制选体制の确立[J].铁钢のIE,1994,32(4):51-55.
  • 8古口志信.クライアント·サ-バ-·コンピユ-テイングによる新综合物流管理システム[J].铁钢のIE,1994,32(1):39-45.
  • 9干全,猪又孝司,石井英俊.条钢一贯制铁所における物流效率化システム[J].铁钢のIE,1986,24(5):29-35.
  • 10IE委员会一贯最适システム研究会.铁钢业における一贯物流最适システムの研究[J].铁钢のIE,1992,31(4):16-26.

共引文献63

同被引文献58

  • 1胡志华.集装箱码头间互拖的集卡甩挂运输调度问题[J].重庆交通大学学报(自然科学版),2013,32(2):313-317. 被引量:12
  • 2刘云忠,宣慧玉.车辆路径问题的模型及算法研究综述[J].管理工程学报,2005,19(1):124-130. 被引量:83
  • 3钟石泉,贺国光.有时间窗约束车辆调度优化的一种禁忌算法[J].系统工程理论方法应用,2005,14(6):522-526. 被引量:35
  • 4CHAO Yi-ming. A tabu search method for the truck and trailer rou- ting problem[ J]. Computer and Operations Research,2002,29 (1) :33-51.
  • 5DORIGO M, GAMBARDELLA L M. Ant colony system: a cooperative learning approach to the traveling salesman problem[ J]. IEEE Trans on Evolutionary Computations, 1997,1 ( 1 ) :67-68.
  • 6Chao Yiming. A tabu search method for the truck and trailer routing problem[J]. Computer and Operations Research, 2002.29(1):33-51.
  • 7T.Stutzle, H.H.Hoos, The MAX-MIN ant system and local search for the traveling salesman problem, in:Proceedings of the IEEE International Conference on Evolutionary Computation, 1997:309-314.
  • 8Dorigo M,Cambardella L M.Ant colony system: a cooperative learning approach to the traveling salesman problem[J]. IEEE Transactions on Evolutionary Computation,1997.1(1):317-365.
  • 9B.Bullnheimer, R.F.Hartl, C. Strauss, An improved ant system algorithm for the vehicle routing problem, Ann. Oper. Res. 89,1999: 319-328.
  • 10Hasegawa M, IkeguchiT, Aihara K .Combination of chaotic neurodynamics with the 2-opt algorithm to solve traveling salesman problems[J]. Physical Review Letters,1997.79(12): 2344-2347.

引证文献7

二级引证文献104

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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