计算机应用研究2011，Vol.28Issue(7)：2446-2448,2451,4.DOI:10.3969/j.issn.1001-3695.2011.07.011
一种求解航空货代拼箱问题的启发式算法
Heuristic algorithm for consolidation problem of air cargo forwarders
摘要
Abstract
In order to solve realistically large-scale cargo consolidation problems,this paper transformed the air cargo forward-ers consolidation problem to well-known set covering problem based on mixed integer programming model and used Lagrangian Relaxation to develop a recursive heuristic algorithm, and discussed the problems of feasible solution determination and set ad-justment. Tested a numerical experiment. The results show that the algorithm is feasible with high computing efficiency, and the generated solutions is very close to optimal solution.关键词
交通管理/拼箱/航空货代/集合覆盖/启发式算法Key words
traffic management/ freight consolidation/ air cargo forwarders/ set covering/ heuristic algorithm分类
信息技术与安全科学引用本文复制引用
桂云苗,龚本刚,程幼明..一种求解航空货代拼箱问题的启发式算法[J].计算机应用研究,2011,28(7):2446-2448,2451,4.基金项目
国家自然科学基金资助项目(70901001) （70901001）
安徽省自然科学基金资助项目(11040606M24) （11040606M24）
国家教育部人文社会科学研究基金资助项目(10YJA630042) （10YJA630042）
安徽工程大学引进人才启动基金资助项目(200YQ002) （200YQ002）
安徽省高校省级自然科学重点项目(KJ2011A033) （KJ2011A033）
