Airbus Packing at Federal Express

Thomas, C; Campbell, Kevin; Hines, Gail S.; Racer, Michael

doi:10.1287/inte.28.4.21

Cited by 12 publications

(10 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…All of the above constraints, (3)-(8), (10), and the objective function (1), are linear. Moreover, in Section III, we also model linearly the volume capacity constraints.…”

Section: F Objective Of the Optimization Problemmentioning

confidence: 99%

“…More recently, another simple greedy heuristic was proposed [9] for the same special case as that considered in [1], with the difference that the algorithm in [9] has a better worst-case performance than that in [1]. Finally, in [10], Thomas, et al proposed an integer programming formulation of the problem. They addressed in fact a difficult variant of the aircraft loading problem: they are specifically concerned with the loading of lighter aircrafts.…”

Section: Introductionmentioning

confidence: 99%

“…Furthermore, some given containers can be constrained to be placed in some specified compartments (for instance near a door in order to be landed at a stopover, or for toxic material containers to be away from foodstuff containers, etc.) Other constraints that can easily be modeled include requiring some given containers, already loaded by the ground crew, not to be displaced, in order to expedite the plane's departure (as in the Federal Express application [10] where time is a critical factor).…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Optimization of aircraft container loading

Mongeau

Bès

2003

IEEE Trans. Aerosp. Electron. Syst.

View full text Add to dashboard Cite

We address the problem of loading as much freight as possible in an aircraft while balancing the load in order to minimize fuel consumption and to satisfy stability/safety requirements. Our formulation methodology permits to solve the problem on a PC, within ten min, by off-the-shelf integer linear programming software. This method decides which containers to load (and in which compartment) and which to leave on the ground.

show abstract

“…All of the above constraints, (3)-(8), (10), and the objective function (1), are linear. Moreover, in Section III, we also model linearly the volume capacity constraints.…”

Section: F Objective Of the Optimization Problemmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Optimization of aircraft container loading

Mongeau

Bès

2003

IEEE Trans. Aerosp. Electron. Syst.

View full text Add to dashboard Cite

show abstract

“…They demonstrated the efficacy of the algorithm on Airbus aircraft; however, their algorithm does not incorporate cargo time windows. Thomas et al [37] presented an algorithm used at Federal Express to pack cargo containers into Airbus aircraft. Their algorithm attempts to find a feasible (in terms of CB constraints) packing scheme for aircraft in which the cargo load has already been selected.…”

Section: Bin Packing Problemsmentioning

confidence: 99%

An advanced tabu search approach to the dynamic airlift loading problem

Roesener¹,

Barnes

2016

Logist. Res.

View full text Add to dashboard Cite

This research effort presents a tabu search algorithm to solve the dynamic airlift loading problem. Given a set of palletized cargo items which require transportation from an aerial port of embarkation to an aerial port of debarkation within a pre-specified time frame, the dynamic airlift loading problem seeks to partition the pallets into aircraft loads, select an efficient and effective subset of aircraft from available aircraft, and assign the pallets to allowable positions on those aircraft. The dynamic airlift loading problem differs from many partitioning and packing problems described in the literature because, in addition to spatial constraints, factors such as allowable cabin load, balance restrictions, and temporal restrictions on cargo and aircraft are included. The algorithm developed in this research, the dynamic airlift loading problem-tabu search, was tested on a variety of problem instances. Since real-world solutions are hand generated by subject matter experts and no previous research effort has solved this specific problem, the algorithmic results are compared to compute lower bounds on the number of aircraft trips required.

show abstract

“…To circumvent the potential computational intractability, Wodziak and Fadel (1994) extend the ideas of Amiouny et al to higher dimensions by suggesting a heuristic approach using genetic algorithms. Thomas et al (1998) propose a heuristic using an integer linear programming (ILP) formulation for a specialized variant of the load‐balancing problem, where the primary concern is shear constraints. Their formulation assumes that a predetermined set of homogeneous items with different mass are to be allocated to predetermined positions in the aircraft.…”

Section: Introductionmentioning

confidence: 99%

Optimal aircraft load balancing

Kaluzny¹,

Shaw²

2009

Int Trans Operational Res

View full text Add to dashboard Cite

The Canadian Forces employ cargo aircraft for countless missions to deliver equipment, supplies and passengers. Maximizing the payload while maintaining a safe load balance is of high importance. This paper details a mathematical formulation, a Mixed Integer Linear Program model, to solve the problem of determining the arrangement of a set of items in a cargo hold that optimizes the load balance. Items are modelled as rectangles with specified dimensions, mass and centre of gravity offsets. The main decision variables determine the orientation and placement of a given set of items. The objective function can be chosen to minimize deviation of the centre of gravity from the target position or to maximize a function of the items loaded (cardinality, priority, etc.). The formulation models item rotation, spacing requirements, load ordering, macro items, obstacles and constrained placement. Furthermore, specialized cut and transitivity constraints are developed that limit the solution search space.

show abstract

Airbus Packing at Federal Express

Cited by 12 publications

References 2 publications

Optimization of aircraft container loading

Optimization of aircraft container loading

An advanced tabu search approach to the dynamic airlift loading problem

Optimal aircraft load balancing

Contact Info

Product

Resources

About