A compromised large-scale neighborhood search heuristic for capacitated air cargo loading planning

European Journal of Operational Research

Volumn 199, Issue 2, 2009, Pages 553-560

  Li, Yanzhi ^a   Tao, Yi ^b   Wang, Fan ^b  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^b SUN YAT SEN UNIVERSITY   (China)

Author keywords

Cargo loading problem; Decision support systems; Heuristics; Large scale neighborhood search

Indexed keywords

AIR CARGOS; CARGO LOADING PROBLEM; FIXED CHARGES; FREIGHT COSTS; FREIGHT FORWARDERS; HEURISTICS; LARGE-SCALE NEIGHBORHOOD SEARCH; MIXED INTEGER PROGRAMMING MODELS; PRACTICAL IMPLEMENTATIONS; SEARCH HEURISTIC;

DECISION MAKING; DECISION SUPPORT SYSTEMS; DECISION THEORY; HEURISTIC ALGORITHMS; HEURISTIC METHODS; INTEGER PROGRAMMING; LOADING;

PROBLEM SOLVING;

EID: 67349126521     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2008.11.033     Document Type: Article

References (17)

1. Ahuja R.K., Magnanti T.L., and Orlin J.B. Network Flows: Theory, Algorithms, and Applications (1993), Prentice-Hall, Englewood Cliffs, NJ
2. Ahuja R., Ergun O., Orlin J.B., and Punnen A. A survey of very large scale neighborhood search techniques. Discrete Applied Mathematics 123 1-3 (2002) 75-102
3. Ahuja R.K., Orlin J.B., and Sharma D. A composite neighborhood search algorithm for the capacitated minimum spanning tree problem. Operations Research Letters 31 (2003) 185-194
4. Bischoff E.E., Janetz F., and Ratcliff M. Loading pallets with non-identical items. European Journal of Operational Research 84 (1995) 681-692
5. Chan T.S., Bhagwat R., Kumar N., Tiwari M.K., and Lam P. Development of a decision support system for air-cargo pallets loading problem: A case study. Expert Systems with Applications 31 (2006) 472-485
6. Davies A.P., and Bischo E.E. Weight distribution consideration in container loading. European Journal of Operational Research 114 3 (1999) 509-527
7. Downsland K.A., and Downsland W.B. Packing problems. European Journal of Operational Research 58 1 (1992) 2-14
8. Garey M.R., and Johnson D.S. Computers and intractability: A guide to the theory of NP-completeness (1979), W.H. Freeman, New York
9. Huang K., and Chi W. A lagrangian relaxation based heuristic for the consolidation problem of airfreight forwarders. Transportation Research - Part C 15 (2007) 235-245
10. Lin S., and Kernighan B.W. An effective heuristic algorithm for the traveling-salesman problem. Operations Research (1973) 21
11. Liu D., Tan K., Huang S., Goh C., and Ho W. On solving multiobjective bin packing problems using evolutionary particle swarm optimization. European Journal of Operational Research 190 2 (2008) 357-382
12. Martello S., Pisinger D., and Vigo D. The three-dimensional bin packing problem. Operations Research 48 (2000) 256-267
13. Martinsa G.H., and Dellb R.F. Solving the pallet loading problem. European Journal of Operational Research 184 2 (2008) 429-440
14. Morton, R., 2006. Air freight outlook: Nothing but up, Logistics Today.
15. Thompson P.M., and Psaraftis H.N. Cyclic transfer algorithms for multi-vehicle routing and scheduling problems. Operations Research 41 (1993) 935-946
16. Wang Z., Li K.W., and Levy J.K. A heuristic for the container loading problem: A tertiary-tree-based dynamic space decomposition approach. European Journal of Operational Research 191 1 (2008) 86-99
17. Xue J., and Lai K. A study on cargo forwarding decisions. Computers and Industrial Engineering 33 1-2 (1997) 63-66