期刊文献+

铁路集装箱混合货物平衡装载布局优化模型与算法 被引量:3

Optimization Model and Algorithm of Balanced Loading Layout of Railway Container Mixed Goods
下载PDF
导出
摘要 铁路集装箱装载布局逐步发展成为在不同规格和不同类型货物混合平衡装载制约下追求装载空间容积和载重量综合利用率最大化问题,其研究对货物高效安全运输尤为重要。本文针对铁路集装箱混合货物平衡装载布局问题,给出铁路集装箱装后重心平衡和集重容许弯矩约束量化方法,以集装箱综合利用率最大化为优化目标,构建铁路集装箱混合货物平衡装载布局优化模型;区别于直接将货物构造为货物块的方法,给出了一种基于混合货物分类方法和待装货物结构判断指标的货物块单元构造方法,并设计一组货物块单元选择和放置方法及剩余空间更新规则,提出铁路集装箱混合货物平衡装载布局优化算法。算例结果表明:所提方法在保证集装箱装载空间容积和载重量的平均综合利用率不低于87%的同时,有92.8%和97.87%以上的概率满足装载重心平衡和集重容许弯矩约束,可有效提高货物块与剩余空间适配度,客观反映装载空间利用情况,并达到平衡装载要求,为铁路集装箱货物装载布局提供决策支持。 Railway container loading layout can be taken as the problem of maximizing the utilization of container space and load capacity under the restriction of balanced loading for mixed goods.Aiming at this type of problem,this paper proposes the constraint quantitative method for load balance of the container gravity center and the allowable bending moment of the concentrated-weight after loading.The loading layout optimization model is then developed to maximize the container utilization rate for mixed goods.In addition,the study proposes method to classify goods into block units based on mixed goods classifications and goods structure index,which is different from directly group goods into goods blocks.The method that can select and place a set of goods block units,and the rule that can update available space are also designed.The optimization algorithm is proposed to solve the model.The results from numerical example show that the proposed method can keep the average container space utilization and load capacity not less than 87%.There are 92.8%probability that the container gravity center is balanced after loading,and there are 97.87%probability that the allowable moment of concentrated-weight meet the requirement.The method can effectively match the size of the goods blocks with available spaces and objectively reflect the utilization of container space and meet the requirements of balanced loading,which provides support for railway container goods loading and layout optimization.
作者 张英贵 姚璎华 高全 雷定猷 ZHANG Ying-gui;YAO Ying-hua;GAO Quan;LEI Ding-you(School of Traffic&Transportation Engineering,Central South University,Changsha 410075,China)
机构地区 中南大学
出处 《交通运输系统工程与信息》 EI CSCD 北大核心 2022年第2期214-222,共9页 Journal of Transportation Systems Engineering and Information Technology
基金 国家自然科学基金(71971220,71771218)。
关键词 物流工程 平衡装载布局 货物块单元 铁路混合货物 集装箱综合利用率 logistics engineering balanced loading layout goods block unit railway mixed goods container comprehensive utilization rate
  • 相关文献

参考文献5

二级参考文献47

  • 1李源青.敞车避免集重装载的探讨[J].上海铁道科技,2004(3):42-43. 被引量:2
  • 2DAVIES A, BISCHOFF E. Weight Distribution Consider- ations in Container Loading [J]. European Journal of Op- erations Research, 1999, 114(3): 509-527.
  • 3ELEY M. Solving Container Loading Problems by Block Arrangement [J]. European Journal of Operational Re- search, 2002, 141(2): 393-409.
  • 4ARAUJO L J P,PINHEIRO P R. Heuristics Backtracking and a Typical Genetic Algorithm for the Container Loading Problem with Weight Distribution [J]. Communications in Computer and Information Science, 2010, 106:252-259.
  • 5JUNQUEIRA L, MORABITO R. Three-dimensional Con- tainer Loading Models with Cargo Stability and Load Bear- ing Constraints [J]. Computers 8c Operations Research, 2012, 39(1): 74-85.
  • 6CHRISTOS D T, EMMANUIL E Z. A Hybrid Meta-heu- ristic Algorithm for the Integrated Vehicle Routing and Three-dimensional Container-loading Problem [J]. IEEE Transportations on Intelligent Transportation Systems, 2009, 10(2): 255-270.
  • 7FUELLERER G, DOEMER K F. Meta-heuristics for Ve- hicle Routing Problems with Three-dimensional Loading Constraints [J]. European Journal of Operational Re- search, 2010, 201(3):751-759.
  • 8GEHRING H, BORTFELDT A. A Genetic Algorithm for Solving the Container Loading Problem [J]. Interna- tional Transactions in Operational Research, 1997, 4 (5- 6) : 401-418.
  • 9BALDI M, PERBOLI G. The Three-dimensional Knap- sack Problem with Balancing Constraints [J]. Applied Mathematics and Computation, 2012, 218 (19): 9802- 9818.
  • 10PERBOLI G, CRAINIC T. An Efficient Meta-heuristic for Multi-dimensional Multi-container Packing[C]. Pro- ceedings of Seventh Annual IEEE Conference on Automa- tion Science and Engineering. New York: T-ASE, 2011 : 563-568.

共引文献40

同被引文献12

引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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