A multi-objective risk-based approach for airlift task scheduling using stochastic bin packing

An important aspect of airlift problems is to find the smallest fleet of aircraft to move cargo from one or more locations to a destination. In critical airlift operations, such as emergency evacuations, disaster relief and defence operations, a compromise needs to be struck between minimizing the time needed for completing all tasks and minimizing the size of the fleet. Usually, the time to complete a task is stochastic. A deterministic model, therefore, will under-estimate fleet size which results in increased levels of risk to achieve the overall airlift mission. In this paper, we introduce a stochastic version of the two-dimensional bin packing problem. We test a number of objective functions to measure different levels of risk. We then use an evolutionary multi-objective algorithm to solve a number of test problems. Analysis demonstrates that the different risk functions and level of variability/uncertainty in performing each task affect solutions non-linearly. Moreover, the multi-objective approach provides the analyst with an estimate of the range of risk; thus solutions can be selected based on criticality of meeting airlift demands.

[1]  Jeffrey D. Ullman,et al.  Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms , 1974, SIAM J. Comput..

[2]  Jatinder N. D. Gupta,et al.  A new heuristic algorithm for the one-dimensional bin-packing problem , 1999 .

[3]  Gary B. Lamont,et al.  Multiobjective evolutionary algorithms: classifications, analyses, and new innovations , 1999 .

[4]  Ulrich Hoffmann,et al.  A class of simple stochastic online bin packing algorithms , 1982, Computing.

[5]  Robert S. Tripp,et al.  Integrated logistics planning for the air and space expeditionary force , 2004, J. Oper. Res. Soc..

[6]  Armin Scholl,et al.  Bison: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem , 1997, Comput. Oper. Res..

[7]  Adriana C. F. Alvim,et al.  A Hybrid Improvement Heuristic for the Bin Packing Problem , 2001 .

[8]  Henry C. W. Lau,et al.  Development of a Profit-Based Air Cargo Loading Information System , 2006, IEEE Transactions on Industrial Informatics.

[9]  Edward G. Coffman,et al.  An Application of Bin-Packing to Multiprocessor Scheduling , 1978, SIAM J. Comput..

[10]  Narendra Jussien,et al.  Loading aircraft for military operations , 2003, J. Oper. Res. Soc..

[11]  Kalyanmoy Deb,et al.  Muiltiobjective Optimization Using Nondominated Sorting in Genetic Algorithms , 1994, Evolutionary Computation.

[12]  Cheng-Yan Kao,et al.  A stochastic approach for the one-dimensional bin-packing problems , 1992, [Proceedings] 1992 IEEE International Conference on Systems, Man, and Cybernetics.

[13]  Nicos Christofides,et al.  The Loading Problem , 1971 .

[14]  R. K. Ursem Multi-objective Optimization using Evolutionary Algorithms , 2009 .

[15]  Krzysztof Fleszar,et al.  New heuristics for one-dimensional bin-packing , 2002, Comput. Oper. Res..

[16]  Andrew Chi-Chih Yao,et al.  New Algorithms for Bin Packing , 1978, JACM.

[17]  Adam Stawowy,et al.  Evolutionary based heuristic for bin packing problem , 2008, Comput. Ind. Eng..

[18]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..