A Heuristic Procedure for Rack Configuration in the Space Vehicle Accommodation Problem

  • Luca Colaneri
  • Federico Della Croce
  • Guido Perboli
  • Roberto Tadei
Part of the Applied Optimization book series (APOP, volume 79)


In space engineering a difficult task is often represented by the cargo analytical integration. A major problem is the items accommodation into a space system.

The present chapter focuses on the rack accommodation of items, considered as parallelepipeds, into a convex nonlinear domain partitioned into pre-configured sectors. The items are split in two classes, the small and the large items. Small items are accommodated into rect angular bags that can be positioned internally or externally on the rack front, while loadable items can be directly positioned either internally or externally, without the usage of bags.

In this problem we search for mass and volume usage optimization, satisfying equipment loading and geometrical constraints. Unlike similar works, non-linear constraints related to the positioning of the rack center of mass (CoM) are taken into account, together with specific positioning and orientation conditions for some items. A heuristic procedure based on sub-problems decomposition is presented and tested on real-life instances provided by Alenia Spazio S.p.a., Torino, involving up to 300 items.


three-dimensional packing cargo loading heuristics 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Amiouny S., Bartholdi J., Vate J.V., Zhang J. Balanced loading. Operations Research, 40:(2) 238–246, 1992.zbMATHCrossRefGoogle Scholar
  2. [2]
    Bussolino L., Fasano G., Novelli A. A Cargo Accommodation Problem for a Space Vehicle: the CAST Project, in this book, 13–26.Google Scholar
  3. [3]
    Cochard D., Yost K. Improving utilization of air force cargo loading. Interfaces, 15 53–68, 1985CrossRefGoogle Scholar
  4. [4]
    Martello S., Pisinger D., Vigo D. The three-dimensional bin packing problem. Operations Research, 48 256–267, 2000.MathSciNetzbMATHCrossRefGoogle Scholar
  5. [5]
    Martello S., Toth P. Knapsack Problems. New York: Wiley, 1990.zbMATHGoogle Scholar
  6. [6]
    Martin-Vega L. A. Aircraft load planning and the computer: description and review. Computers and Industrial Engineering, 4 357–369, 1985.CrossRefGoogle Scholar
  7. [7]
    Mathur K. An integer-programming-based heuristic for the balanced loading problem. Operations Research Letters, 22 19–25, 1998.MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2003

Authors and Affiliations

  • Luca Colaneri
    • 1
  • Federico Della Croce
    • 2
  • Guido Perboli
    • 2
  • Roberto Tadei
    • 2
  1. 1.Dipartimento di Automatica e InformaticaPolitecnico di TorinoTorinoItaly
  2. 2.Dipartimento di Automatica e InformaticaPolitecnico di TorinoItaly

Personalised recommendations