Development of a profit-based air cargo loading information system

被引:9
作者
Lau, Henry C. W. [1 ]
Tsui, W. T. [1 ]
Lee, C. K. M. [1 ]
Ho, G. T. S. [1 ]
Ning, A. [1 ]
机构
[1] Hong Kong Polytech Univ, Dept Ind & Syst Engn, Kowloon, Hong Kong, Peoples R China
关键词
airfreight forwarding business; heuristics; objective function; profit optimization; rule-based reasoning;
D O I
10.1109/TII.2006.885193
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In today's competitive logistics business environment, airfreight forwarders need to optimize every aspect of their logistics operations. However, forwarders still heavily rely on human brain and working experiences for calculating complex cargo packing and scheduling problems. Although recent research studies related to cargo packing and scheduling problems have resulted in the development of a number of advanced techniques of cargo planning, it can be seen that most of the research work is focused on the optimization of space in order to achieve the maximum possible amount of cargo to be packed in the minimum of space. After numerous site evaluation and end-user feedbacks, it is found that space optimization does not necessarily cause profit optimization, which is the ultimate aim of logistics providers. A study of contemporary research publications indicates that there are inadequate research studies related to profit-based optimization in cargo packing areas. This paper presents a profit-based air cargo loading information system (ACLIS) that embeds an innovative technology known as heuristics iterative reasoning technology (HIRT) that supports loading plan generation, focusing on maximization of the profit margin. In general, the proposed system is meant to maximize the profit in the airfreight forwarding business. It adopts an objective function governed by a list of constraints together with rule-based reasoning to provide expert advice to support the generation of appropriate loading plans.
引用
收藏
页码:303 / 312
页数:10
相关论文
共 17 条
  • [1] A hybrid genetic algorithm for the container loading problem
    Bortfeldt, A
    Gehring, H
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2001, 131 (01) : 143 - 161
  • [2] A parallel tabu search algorithm for solving the container loading problem
    Bortfeldt, A
    Gehring, H
    Mack, D
    [J]. PARALLEL COMPUTING, 2003, 29 (05) : 641 - 662
  • [3] DARLINGTON K, 2002, ESSENCE SYSTEMS
  • [4] Dyckhoff H., 1992, CUTTING PACKING PROD
  • [5] FEKETE P, 2000, MORE DIMENSIONAL PAC
  • [6] Gehring H., 1997, INT T OPER RES, V4, P401, DOI DOI 10.1111/J.1475-3995.1997.TB00095.X
  • [7] Applying AI to railway freight loading
    Geng, GY
    Zhang, B
    Zhu, J
    Zhong, CH
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 1999, 16 (01) : 63 - 72
  • [8] Scheduling railway freight cars
    Geng, GY
    Li, LX
    [J]. KNOWLEDGE-BASED SYSTEMS, 2001, 14 (5-6) : 289 - 297
  • [9] A HEURISTIC FOR PACKING BOXES INTO A CONTAINER
    GEORGE, JA
    ROBINSON, DF
    [J]. COMPUTERS & OPERATIONS RESEARCH, 1980, 7 (03) : 147 - 156
  • [10] GIARRATONO J, 1998, EXPERT SYSTEM PRINCI