Loading aircraft for military operations |
| |
Authors: | C Guéret N Jussien O Lhomme C Pavageau C Prins |
| |
Institution: | 1.école des Mines de Nantes,Nantes,France;2.IRCCyN—Institut de Recherche en Communications et Cybernétique de Nantes,Nantes,France;3.IPogSA,Valbonne,France;4.Université de Technologie de Troyes,Troyes,France |
| |
Abstract: | In this paper, we describe an aircraft loading problem submitted by the French military agency (DGA) as part of a more general military airlift planning problem. It can be viewed as a kind of bi-dimensional bin-packing problem, with heterogeneous bins and several additional constraints. We introduce two-phase methods for solving this NP-hard problem. The first phase consists in building good initial solutions, thanks to two fast algorithms: a list-based heuristic and a loading pattern generation method. Both algorithms call a constraint-based subroutine, able to determine quickly if the items already loaded can be reshuffled to accommodate a new object. The second phase improves these preliminary solutions using local search techniques. Results obtained on real data sets are presented. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|