ORBEL, the Belgian Operations Research society
  One-day Symposium on Optimization and Engineering

ORBEL, the Belgian O.R. Society (Sogesci-B.V.W.B.) and CORE, the Center for Operations Research and Econometrics at UCL organised a

one-day symposium on
Optimization and Engineering
on Wednesday May 24th 2006 at the
Center for Operations Research and Econometrics in Louvain-la-Neuve, Belgium

The symposium is now over !
Many thanks to the organisers, the speakers and the more than 40 participants who attended.

The slides for the presentations and a list of participants are now available for download !

The symposium's goal was to provide a meeting place to facilitate interaction between
optimization specialists and users of optimization techniques in various domains of engineering.
It featured ten invited research talks as well as a plenary talk by Serge Gratton from CERFACS (Toulouse, France) on data assimilation for ocean models.

You can download a PDF file containing the programme or have a look just below.

This symposium was part of the series of events celebrating the 40th anniversary of CORE.

Welcome (slides)
Bram Demeulenaere (KUL/MECH)
(Bio)-Mechanical Engineering Applications of Convex Optimization, abstract, slides.
Jean-Fran�ois Collard and
Paul Fisette (UCL/MECA)
Optimization of multibody systems, abstract, slides.
Franck Pastor (FUSL)
Solving lower/upper bound approaches of limit analysis by an interior-point method for convex programming, abstract, slides.
Coffee break
Plenary talk
Serge Gratton (CERFACS)
Optimization methods for variational data assimilation into ocean models, abstract, slides.
Rajan Filomeno Coelho (CENAERO)
Optimization based on Evolutionary Algorithms for Aeronautics, abstract, slides.
Lunch (at the Fleur de Sel restaurant)
Fr�d�ric Bair (ULG/ANAST)
Simulation and Optimization of a Shipbuilding Workshop, abstract, slides.
Maud Bay (ULG/ROGP)
Mixed integer models for naval structure optimization, with Yves Crama and Philippe Rigo, abstract, slides.
El-Houssaine Aghezzaf (Ghent)
Designing a new Distribution Strategy for a Low-Value Goods Producer: A Practical Solution for the Inventory Routing Problem, with Birger Raa (Ghent) and Wout Dullaert (UA), abstract, slides.
Coffee break
Jonathan Duplicy (UCL/ELEC)
Optimizing future wireless communication systems, abstract, slides.
Emilie Wanufelle (FUNDP)
Development of an algorithm for solving mixed integer and nonconvex problems arising in electrical supply networks, with Sven Leyffer, Annick Sartenaer and Philippe Toint, abstract, slides.
Carine Gerkens (ULG/LASSC)
Use of genetic algorithm for designing redundant sensor network, abstract, slides.
Closing words
  Practical details

Location: The symposium will be held at the Center for Operations Research and Econometrics (CORE/UCL), 34 Voie du Roman Pays, B-1348 Louvain-la-Neuve, located close to the railway station ; see the following instructions for more information on how to get there. In particular, you can download a general map of Louvain-la-Neuve (CORE is building 20 on square E6, the main entrance being located at the intersection of "Traverse d'Esope" and "Voie du Roman Pays") or a situation map with the principal roads and parking lots useful if you plan to come by car.

The symposium will take place in room b-135 (on floor -1, which you access by taking the main entrance, going through the internal doors and following the hall to the right).

Registration: Registration before May 17 is required. Please send an email with your name, affiliation and address to Sylvie Mauroy at [email protected].

  List of abstracts
  • Serge Gratton (CERFACS, Parallel Algorithms Project, Toulouse)
    Optimization methods for variational data assimilation into ocean models
    (download the slides of the presentation)

    For large systems, variational data assimilation techniques are among the most powerful techniques to combine measured observations with model predictions in order to estimate a system state. This system state is used as an initial condition to perform the forecast by integration of a dynamical system.

    The mathematical problem to be solved, in data assimilation for numerical weather forecasting, is a very large nonlinear least-squares problem with 10^7 unknowns. The solution time has to be tightly controlled to comply with operational requirements. These two constraints (problem size, controlled solution time) have stimulated the development of complex solvers combining various techniques such as truncation based on sophisticated stopping criteria, preconditioning [1], use of multigrid approximation techniques [2], use of inexact Krylov methods.

    In this talk, we provide an historical survey of the optimization algorithms used in this area. We then focus more on a particular algorithm, called Incremental-4D VAR, that is currently implemented in many operational systems. We will illustrate the properties of this system both on academic examples [3,4] and on experiments with the CERFACS system for ocean data assimilation.

    1. L. Giraud, S. Gratton. On the sensitivity of some spectral preconditioners. SIAM J. Matrix Analysis and Applications, accepted for publication
    2. S. Gratton, A. Sartenaer, Ph.L. Toint. A numerical exploration of recursive multiscale unconstrained optimization. In Oberwolfach Reports 2005: Optimization and Applications F. Jarre, C. Lemarchal, J. Zowei, editors (University of Hamburg, Optimization and Applications, Oberwolfach).
    3. A.S. Lawless, S. Gratton, and N.K. Nichols. An investigation of incremental 4d-var using non-tangent linear models. Quart. J. Royal Met. Soc. , 131,459--476, 2005.
    4. A.S. Lawless, S. Gratton, and N.K. Nichols. Approximate iterative methods for variational data assimilation. Int. J. Numer. Methods in Fluids, 47,1129--1135, 2005.

  • El-Houssaine Aghezzaf (Ghent university, Department of Industrial Management)
    Designing a new Distribution Strategy for a Low-Value Goods Producer: A Practical Solution for the Inventory Routing Problem, with Birger Raa (Ghent university, Department of Industrial Management) and Wout Dullaert (UA, Institute of Transport and Maritime Management Antwerp)
    (download the slides of the presentation)

    This presentation discusses a practical solution approach to a challenging inventory routing problem. In particular, we discuss the case of a company distributing essential, but low-value goods to customers having a relatively stable demand rate. We propose a long-term, cyclic planning approach using new solution constructs. The concepts of �multi-tours� and �multi-frequency multi-tours� are used in a multi-start savings heuristic framework. Results show that using �multi-frequency multi-tour� patterns leads to considerable cost savings, mostly as a result of a significant reduction in the required vehicle fleet.

  • Fr�d�ric Bair (ULG, ANAST, Dept. of Naval Architecture and Transport System)
    Simulation and Optimization of a Shipbuilding Workshop
    (download the slides of the presentation)

    Nowadays, simulation in shipbuilding becomes more and more important. The use of simulation-based design and virtual reality technologies facilitates higher efficiency in terms of work strategy planning, and offers, as a result, significant productivity gains. Such gains can not be easily obtained only by using the simulation tools. It is required to link the simulation model with an optimization package.

    Simulation is used in many different sectors � as automotive industry � but not yet so much in shipbuilding industry. This is due to the complexity and specifications of the work: almost each ship to build is unique and in consequence automation � and thus simulation � is quite difficult. In consequence, optimization linked to such simulation model is rare in industry. The project was to try to use simulation to model a shipbuilding workshop and linked it to an optimization tool.

    The optimization is a sequence optimization: assemblies have to be built in a certain order that can be optimized in respect to various constraints. We have used genetic algorithm to find the best sequence. Obviously, a crucial problem was to reduce calculation time to reasonable levels.

  • Maud Bay (ULG, ROGP & HEC Management school)
    Mixed integer models for naval structure optimization, with Yves Crama and Philippe Rigo
    (download the slides of the presentation)

    A local search method has been developed for nonlinear mixed integer problems with implicit constraints. This formulation appears in structural optimization problems where the complexity of the models leads to implicit relationships between the variables. The evaluation of the implicit constraints for any given solution is possible only at an expensive computing cost using finite element or analytical methods. Approximation methods may be used to find local optima of structural problems with all real variables.

    We present a mixed integer model where some variables have to take their values in discrete sets and the others have real values. We develop a method that combines a local search algorithm with an existing solver based on approximation methods. This solver is used as a black-box. The local search algorithm allows an effective exploration of the solution space by setting the values of some discrete variables at each run of the black-box solver. The local search algorithm can be considered as a multi-start procedure for the black-box solver. Tests have shown that the combination of a local search procedure and an approximation method performs very well for mixed integer nonlinear problems with implicit constraints.

  • Rajan Filomeno Coelho (CENAERO, Numerical Methods and Optimisation group)
    Optimization based on Evolutionary Algorithms for Aeronautics
    (download the slides of the presentation)

    The recent advances in simulation technologies like CFD, FEM, thermal analysis and unsteady flow, combined with the emergence of improved optimization algorithms make now possible the development and use of automatic optimization software and methodologies for complex multi-disciplinary aeronautical applications. In this context, the MAX optimization software developed at CENAERO has been successfully applied to various industrial problems. This code performs derivative-free optimization with very few calls to the computer intensive simulation software. Practically, the method is based on the use of a genetic algorithm using real coded variables and combined with an approximate model built through radial basis function (RBF) networks. Several applications have already been performed using this optimization technology, especially for the design of turbomachinery blades. Other studies include parameter identification for structural material law, design optimization of heat pipes in satellites, noise reduction of civil aircraft liners, etc.

  • Jean-Francois Collard and Paul Fisette (UCL, MECA, Unit� de Production M�canique et Machines)
    Optimization of multibody systems
    (download the slides of the presentation)

    Mechanics of multibody systems deals with the dynamic, kinematical or geometrical behaviour of systems composed of articulated rigid bodies like robots, vehicles, human body, machine tools, etc... Such analyses require the simulation of these systems and lead to the characterization of their performances. Some of these performances obviously constitute interesting objectives to optimize. One of the main issues in the optimization of multibody systems concerns transient motion problems, costly to evaluate and closed-loop topologies. Contrary to open topologies, they involve algebraic constraint equations between the coordinates of the bodies. Depending on the used formalism, their resolution and their impact on the optimization problem are strongly different. The applications of multibody optimization are various, from robotics to biomechanics, through automotive. Many examples will be described with different objectives: isotropy of parallel manipulators, design of planar mechanisms, identification of biomechanical models and ride or handling of road vehicles.

  • Bram Demeulenaere (KUL, Mechanical Engineering Department - PMA Division)
    (Bio)-Mechanical Engineering Applications of Convex Optimization
    (download the slides of the presentation)

    Convex optimization problems constitute a (nonlinear) generalization of linear optimization problems for which every local optimum is a global optimum, which can therefore be found very efficiently using dedicated algorithms. Optimization problems belonging to this class are, for instance, linear programs (LPs), second-order cone programs (SOCPs) and semidefinite programs (SDPs). In this talk we introduce two mechanical engineering applications of convex optimization techniques.

    The first application is counterweight balancing, that is, the problem of determining counterweights for a linkage, such that it exerts smaller forces and moments on its supporting frame. It is shown that determining the optimal counterweight parameters can be formulated as an SOCP for planar mechanisms and an SDP for spatial mechanisms.

    As a second, bio-mechanical application, we consider dynamic musculoskeletal analysis, that is, the problem of determining the muscle forces that underly some experimentally observed human motion. It is shown that this challenging, large-scale, nonconvex optimization problem can be solved in an efficient manner by using convex optimization techniques. That is, an approximate, convex program is formulated and solved, in order to provide a hot-start for the exact, nonconvex program. The key element in this approximation is a (global) linearization of muscle physiology, based on techniques from experimental system identification. This approach is applied to the study of muscle forces during gait.

    The results presented comprise joint work with Goele Pipeleers, Myriam Verschuure, Dimitri Coemelck, Jan De Caigny, Friedl De Groote, Erwin Aertbeli�en, Jan Swevers, Joris De Schutter (all affiliated with the Mech. Eng. Dept., PMA Division) Pieter Spaepen (Mech. Eng. Dept., BMGO Division), Ilse Jonkers (Dept. of Kinesiology) and Lieven Vandenberghe (University of California Los Angeles -- Electrical Engineering Dept.).

    B. Demeulenaere is a Postdoctoral Fellow of the Research Foundation--Flanders. Part of the presented research has been carried out during a visiting scholarship (2004--2005) at UCLA's EE Dept., with the financial aid of the Research Foundation--Flanders and under the supervision of L. Vandenberghe. This work is supported by K.U.Leuven-BOF EF/05/006 Center-of-Excellence Optimization in Engineering, F.W.O. project G.0462.05 `Development of a powerful dynamic optimization framework for mechanical and biomechanical systems based on convex optimization techniques' and I.W.T. project 040444 'Dynamic balancing of weaving machines'.

  • Jonhatan Duplicy (UCL, ELEC, Communications and Remote Sensing Laboratory)
    Optimizing future wireless communication systems
    (download the slides of the presentation)

    Although offering significant improvements with respect to the second generation (namely, GSM), the third generation (3G) of mobiles (known in Europe under the acronym UMTS) guarantees only a limited transmission rate and hence fails to provide high-rate demanding services for instance high definition videoconferencing. Two easy ways to increase the rates is either to increase either the transmission power or the bandwidth. However, on the one hand, both environmental concerns and battery autonomy issues prevent a raise of the transmission power. On the other hand, bandwidth (spectrum) is a scarce resource, legally regulated. Recently, MIMO (Multiple Input Multiple Output) systems arising from the use of several antennas both at the transmit side and the receive side have been proposed as a possible candidate for the next generation (4G). By sending several information streams in parallel, the MIMO systems allow to increase the rates, improve the robustness and/or to increase the number of users that can be simultaneously accommodated.

    The purpose of the talk is twofold. Firstly, we introduce the MIMO wireless paradigm and emphasize the key challenges designers are confronted with. Secondly, we present some solutions we have adopted to solve specific optimization problems arising when several users are simultaneously communicating.

  • Carine Gerkens (ULG, D�partment de chimie appliqu�e, Syst�mes chimiques et conception de proc�d�s)
    Use of genetic algorithm for designing redundant sensor network
    (download the slides of the presentation)

    A systematic approach is proposed, allowing the design of a sensor network able to identify all key variables of a process with a prescribed accuracy, at the lowest cost, and to preserve the redundancy of the measurement system, even in case of failure of a single sensor. The proposed method is based on a linearised process model, derived automatically from a general, non-linear validation model. A genetic algorithm is used to select the sensor types and locations.

    To reduce the solution time, two ways of parallelizing the algorithm have been compared: the global parallelization and the distributed genetic algorithms. Both techniques allow reducing the elapsed time but the second one is more efficient.

    Typical results are presented for an ammonia synthesis loop.

  • Franck Pastor (FUSL, Facult�s des Sciences Economiques, Sociales et Politiques, SMASH)
    Solving lower/upper bound approaches of limit analysis by an interior-point method for convex programming
    (download the slides of the presentation)

    A general convex interior point method is presented for solving under Matlab the lower bound (or static) approach of limit analysis (LA) in order to determine limit loadings of mechanical structures. The method is tested in the case of a von Mises material by comparison with those obtained using first a pre-linearization, second a direct SOCP formulation solved with the MOSEK code. The same problems are solved afterwards for a Gurson material, the non-classical objective of the work, where SOCP does not apply.

    In a second step, thanks to a variational formulation based on the virtual power principle and convexity properties, a stress-based upper bound method is proposed, using continuous or discontinuous, linear or quadratic velocity fields as virtual variables, and stress fields as real parameters. This numerical method presents an analogy with the static approach, only the linear conditions are changed; it is tested on the same previous mechanical problems for both cases of von Mises and Gurson materials. Finally, we present different methods to circumvent the shortcomings of the direct methods used for solving the systems of linear equations required in the aforementioned approaches.

  • Emilie Wanufelle (FUNDP, D�partement de math�matiques, Unit� d'analyse num�rique)
    Development of an algorithm for solving mixed integer and nonconvex problems arising in electrical supply networks, with Sven Leyffer, Annick Sartenaer and Philippe Toint
    (download the slides of the presentation)

    Nowadays, the demand for robust and efficient optimization algorithms to solve mixed integer and nonconvex problems is continuously increasing. In this talk, we present a problem of that kind arising in electrical supply networks and called "Tertiary Voltage Control" problem (TVC). This problem is very hard because of its strong nonconvexity due to equality constraints involving trigonometric functions (among others).

    The method we propose consists in solving a succession of appropriate linear relaxation problems articulated in a branch-and-bound tree. As the speed of convergence of the method depends on the quality of the relaxations, we design relaxations as tight as possible. To this aim, we use piecewise approximations based on special ordered sets for each nonlinear component of the initial problem, and modify these approximations to obtain valid lower and upper approximations. If the relaxation problem is not close enough to the initial problem, we further refine it by dividing the feasible domain of relaxation, hence creating two new subproblems. In that way, we ensure the convergence of the method to the global optimum of the initial problem as far as the feasible domain of the latter is bounded. We terminate this talk by presenting some preliminary numerical experiments on a toy problem having the main characteristics of the TVC problem.