航空货代装箱优化模型及算法

桂云苗; 龚本刚; 朱金福

doi:10.19818/j.cnki.1671-1637.2009.04.020

航空货代装箱优化模型及算法

doi: 10.19818/j.cnki.1671-1637.2009.04.020

1.
安徽工程科技学院管理工程系, 安徽芜湖 241000
2.
南京航空航天大学民航学院, 江苏南京 210016

基金项目:

国家自然科学基金项目 70771046

安徽省高校省级自然科学研究计划项目 KJ2009B006

安徽省教育厅人文社会科学研究项目 2009sk367

安徽工程科技学院引进人才科研启动基金项目 2008YQ002

详细信息

作者简介:
桂云苗(1978-), 男, 安徽潜山人, 安徽工程科技学院讲师, 管理学博士, 从事航空货运管理研究

中图分类号: F560.84
计量
- 文章访问数: 793
- HTML全文浏览量: 215
- PDF下载量: 523
- 被引次数: 0
出版历程
- 收稿日期: 2009-03-28
- 刊出日期: 2009-08-25

Optimal model and algorithm for container loading of airfreight forwarder

1.
Department of Management Engineering, Anhui University of Technology and Science, Wuhu 241000, Anhui, China
2.
School of Civil Aviation, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, Jiangsu, China

More Information

Author Bio:
GUI Yun-miao(1978-), male, lectuer, PhD, +86-553-2871256, ymgui@auts.edu.cn

Article Text (Baidu Translation)

摘要

摘要: 为了提高航空货代的盈利水平和装箱能力, 通过分析航空货物运价体系的特点, 将航空货代装箱问题划分为装箱货物优选和优选货物配装2个阶段, 建立一种基于航空货代利润最大化的装箱货物优选模型。在考虑同票货物邻近装载的约束条件下, 采用空间分割、合并和整体充填策略, 设计了一种基于评级规则的优选货物装载优化算法。计算结果表明: 货物优选模型能够合理选择装箱的货物, 货物装载优化算法能使集装箱容积平均利用率高达83%, 能够有效地满足航空货代增加利润和装箱的实际要求。
- 交通运输经济 /
- 航空货代 /
- 装箱 /
- 优化算法
Abstract: In order to improve the profit and container loading ability of airfreight forwarder, air cargo loading problem was divided into cargo choosing problem and choice cargo loading problem through analyzing air cargo pricing system.A profit-maximized air cargo choosing model was developed, and an evaluated rank-based choice cargo loading algorithm was presented by means of whole-fill, space division and mergence under the constraint that the same waybill cargos were at adjacent loading position.Computation result shows that the optimal model can choose loading cargos rationally, and the average utilization ratio of container volume achieves 83% by using the proposed optimal algorithm, so the profit of airfreight forwarder and the practical requirement of container loading can be satisfied effectively.
- transportation economy /
- airfreight forwarder /
- container loading /
- optimal algorithm

HTML全文

图 1 空间分割

Figure 1. Space division

下载: 全尺寸图片幻灯片

图 2 第一步装载效果

Figure 2. First step loading result

下载: 全尺寸图片幻灯片

图 3 全部装载效果

Figure 3. Wholeloading result

下载: 全尺寸图片幻灯片

表 1 集装箱货物运价

Table 1. Prices of container cargo

下载: 导出CSV

表 2 装载货物评级

Table 2. Ranks of loading cargos

下载: 导出CSV

表 3 装载货物参数

Table 3. Parameters of loading cargos

下载: 导出CSV

表 4 货物优选模型的求解结果

Table 4. Resolving results of cargo choosing model

下载: 导出CSV

参考文献(14)

[1]	苏宁. 波音预测全球航空货运发展[J]. 中国民用航空, 2006, 65 (5): 28-29. https://www.cnki.com.cn/Article/CJFDTOTAL-MHJJ200605010.htm SU Ning. Boeing s forecast onthe world air freight trend[J]. China Civil Aviation, 2006, 65 (5): 28-29. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-MHJJ200605010.htm
[2]	LODI A, MARTELLO S, VIGO D. Approxi mation algorithmsfor the oriented two-di mensional bin packing problem[J]. European Journal of Operational Research, 1999, 112 (1): 158-166. doi: 10.1016/S0377-2217(97)00388-3
[3]	LI U F HF, HSI AO C J. Athree-di mensional pallet loadingmethod for single-size boxes[J]. Journal of the OperationalResearch Society, 1997, 48 (7): 726-735. doi: 10.1057/palgrave.jors.2600426
[4]	BORTFELDT A, MACK D. A heuristic for the three-di mensional strip packing problem[J]. European Journal ofOperational Research, 2007, 183 (3): 1267-1279. doi: 10.1016/j.ejor.2005.07.031
[5]	HUANG W, CHEN D. An efficient heuristic algorithm for rectangle-packing problem[J]. Si mulation Modelling Practiceand Theory, 2007, 15 (10): 1356-1365. doi: 10.1016/j.simpat.2007.09.004
[6]	ZHANG D F, KANG Y, DENG AS. A new heuristic recursive algorithm for the striprectangular packing problem[J]. Computersand Operations Research, 2006, 33 (8): 2209-2217. doi: 10.1016/j.cor.2005.01.009
[7]	卜雷, 尹传忠, 蒲云. 优化普零货物拼箱配装的遗传算法[J]. 交通运输工程学报, 2004, 4 (4): 84-87. doi: 10.3321/j.issn:1671-1637.2004.04.021 BU Lei, YI N Chuan-zhong, PU Yun. Genetic algorithmforopti mal arrangement of general piece goods[J]. Journal ofTraffic and Transportation Engineering, 2004, 4 (4): 84-87. (in Chinese) doi: 10.3321/j.issn:1671-1637.2004.04.021
[8]	BI NKLEY KJ, HAGI WARA M. Applying self-adaptiveevolutionary algorithms to two-di mensional packing problemsusing a four corners heuristic[J]. European Journal ofOperational Research, 2007, 183 (3): 1230-1248. doi: 10.1016/j.ejor.2004.12.029
[9]	许光泞, 肖志勇, 俞金寿. 应用自适应遗传算法解决集装箱装载问题[J]. 控制与决策, 2007, 22 (11): 1280-1283, 1288. https://www.cnki.com.cn/Article/CJFDTOTAL-KZYC200711016.htm XU Guang-ning, XIAO Zhi-yong, YUJin-shou. Adaptive geneticalgorithmfor three-di mension container loading problem[J]. Control and Decision, 2007, 22 (11): 1280-1283, 1288. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-KZYC200711016.htm
[10]	GONCALVES J F. Ahybrid genetic algorithm-heuristic for atwo-di mensional orthogonal packing problem[J]. EuropeanJournal of Operational Research, 2007, 183 (3): 1212-1229. doi: 10.1016/j.ejor.2005.11.062
[11]	PISINGER D. Heuristics for the container loading problem[J]. European Journal of Operational Research, 2002, 141 (2): 382-392. doi: 10.1016/S0377-2217(02)00132-7
[12]	GILMORE P C, GOMORY R E. Multistage cutting stockproblems of two and more di mensions[J]. OperationsResearch, 1965, 13 (1): 94-120.
[13]	CHRISTOFIDES N, WHITLOCK C. An algorithmfor two-di mensional cutting problems[J]. Operations Research, 1977, 25 (1): 30-44.
[14]	GEORGE J A, ROBI NSON B F. A heuristic for packingboxes into a container[J]. Computer and OperationalResearch, 1980, 7 (3): 147-156.