首页 | 本学科首页   官方微博 | 高级检索  
     检索      


A Lagrangian relaxation based heuristic for the consolidation problem of airfreight forwarders
Institution:1. Department of Transportation Technology and Management, National Chiao Tung University, No. 1001, Ta Hsueh Road, Hsinchu City 300, Taiwan;2. Asia Pacific Distribution Center, Logitech Far East Ltd., No. 2 Creation Road IV, Science-Based Industrial Park, Hsinchu City 300, Taiwan
Abstract:International air cargo is an operation-intensive industry, involving complex procedures and many players. As an important player, airfreight forwarders need to consolidate the collected goods skillfully in order to satisfy the requirements of the shippers and, at the same time minimize the expense charged by the airlines. However, the air cargo rate structure is very complicated, making the consolidation a difficult mixed-integer programming problem for the airfreight forwarder. In this paper, the consolidation problem is first transformed into a well-known set covering problem by treating a feasible consolidated shipment as a set. Lagrangian Relaxation is used as the backbone to develop a recursive heuristic algorithm. Based on the numerical experiment, the heuristic algorithm generates solutions very close to optimality. In particular, a sensitivity analysis is performed with respect to the degree of concavity. The results suggest that the solution algorithm can be used as a core module of the decision support system for air cargo consolidation.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号