Optimizing model and algorithm for railway freight loading problem

Author:

Chen Hao1,Wang Yugang2,Lucas Raquel Martínez3

Affiliation:

1. School of Transportation & Automotive Engineering, Xihua University , Chengdu , China

2. School of Energy Science and Engineering, Henan Polytechnic University , Jiaozuo , China

3. Department of Mathematics, University of Castilla-La Mancha, Campus of Cuenca , 16071-Cuenca , Castilla-La Mancha , Spain

Abstract

Abstract This paper constructed an optimizing model on multiple vehicles and multiple goods, which is used in a study on the loading problem for railway freight. We take the maximum utilization coefficient of car loading capacity, volume capacity and layout optimal degree as objective functions. Several major factors in railway transportation have been cited as constraints: center of gravity, non-overlapping freight, transportation circumscription, car marked loading capacity and volume capacity. In order to increase the car utilization coefficient and obtain flat layers in the loading scheme, an improved genetic annealing algorithm is proposed to solve this optimizing model. The proposed algorithm can efficiently obtain a satisfactory loading scheme in railway transportation. At the end, a numerical example shows that the proposed model and algorithm are better than First Fit Algorithm and Neural Network Algorithm in goods loading capacity and volume capacity, the new loading schemes are more flat on each layer.

Publisher

Walter de Gruyter GmbH

Subject

General Physics and Astronomy

Reference18 articles.

1. Guo Y., Chen Z., Tang B., Optimization model and algorithms for loading and packing multi-category freights into multi-vehicle, J. China Railway Sci., 2011, 32(03), 111-116.

2. Xu Q., Research on multiple vehicle and multiple freight loading problem based on hopfield network, Logist. Technol., 2010, 33(12), 101-104.

3. George J.A., Robinson D.F., A heuristic for packing boxes into a Container, Comput. Oper. Res., 1980, 7, 147-156.

4. Ngoi B.K.A., Tay M.L., Chua E.S., Applying spatial representation techniques to the container packing problem, Int. J. Prod. Res., 1994, 32, 111-123.

5. Berghammer R., Reuter F., A linear approximation algorithm for bin packing with absolute approximation factor 3/2, Sci. Comput. Prog., 2003, 48, 67-80.

Cited by 5 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3