Heuristic algorithm for consolidation problem of air cargo forwarders
一种求解航空货代拼箱问题的启发式算法*

In order to solve realistically large-scale cargo consolidation problems,this paper transformed the air cargo forwarders 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 adjustment.Tested a numerical experiment.The results show that the algorithm is feasible with high computing efficiency,and the generated solutions i...