Journées de l'optimisation 2007 Optimizations days

The container loading problem arrives when we want to load a subset of rectangular boxes into a rectangular container such that the total volume of the loaded boxes is maximized. This problem is obviously NP-hard and actually, there is no optimal method that performs efficiently. In this presentation, we review the recent heuristics for this problem and analyse their performance on different instances.

Synthetic adaptive model with uncertainty band around the balance set is proposed to account for unpredictable variations of important parameters or utilities during conception and realization of large scale projects. A method of successive refinement in a synthetic multi-model system is developed, and application of the sequence of refined models is illustrated on a real-life example of construction of a dam with yearly refinements of the initial model, based on past history of project realizations.

In this talk, we present Set Partitioning applications derived from the Dantzig-Wolfe decomposition principle applied on network flow based formulations and on a generalized assignment problem. In particular, we show how to get ride of some non-linear aspects of the original models. We also discuss the Integrality Property of the selected subproblems.