Including an Industrial Optimization Day

HEC Montréal, May 7 - 9, 2012


HEC Montréal, May 7 — 9, 2012

Schedule Authors My Schedule
Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402

MD4 Problèmes de localisation / Complex Location Problems

May 7, 2012 03:30 PM – 05:10 PM

Location: Quebecor

Chaired by Bernard Gendron

4 Presentations

  • Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402
    03:30 PM - 03:55 PM

    A GRASP + ILP Based Heuristic for the Capacitated Location-Routing Problem

    • Claudio Contardo, presenter, GERAD - ESG UQÀM
    • Jean-François Cordeau, GERAD - HEC Montréal
    • Bernard Gendron, Université de Montréal, CIRRELT

    We present a three-stage heuristic method for the capacitated location-routing problem (CLRP). In a first stage, the CLRP is solved by a GRASP method. In the second stage, the different solutions
    provided by the GRASP are embedded into a ILP solver. In the third and last stage, we perform a destroy-and-repair method based on the iterative solution of the same integer program. We present
    computational results that show the effectiveness of our approach.

  • Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402
    03:55 PM - 04:20 PM

    A Piecewise Linearization Approach for a Two-Echelon Inventory Location Problem

    • Virgilio Ferreira, presenter, Universidad Federal do Rio de Janeiro
    • Bernard Gendron, Université de Montréal, CIRRELT

    This paper considers a model that determines plant and depot locations, shipment levels from plants to depots, safety‐stock levels at depots, and the assignment of clients to depots by minimizing the sum of fixed facility location, transportation, and safety‐stock costs. The model is formulated as a MINLP and linearized using piecewise‐linear functions.

  • Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402
    04:20 PM - 04:45 PM

    Supermodular Properties in Hub Location

    • Ivan Contreras, presenter, Concordia University
    • Elena Fernandez, Universitat Politècnica de Catalunya

    In this work we show how a generalized hub location problem, that includes as particular cases well-known hub node and hub arc location problems, can be stated as the maximization of a supermodular function. As a consequence, we obtain worst-case bounds on the performance of a greedy heuristic. Moreover, we present two integer programming formulations for the generalized hub location problem. One of these formulations is derived from the properties of supermodular functions, and involves variables with at most two indices. Computational experiments confirm the efficiency of such formulation.

  • Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402
    04:45 PM - 05:10 PM

    Algorithmic Advances on the Point Location Problem: an Application to Explicit Model Predictive Control (MPC)

    • Alessandro Zanarini, presenter, The ABB Group Baden-Dättwil
    • Helfried Peyrl, The ABB Group CHCRC
    • Luis Dominguez, The ABB Group CHCRC
    • Stefan Richter, The ABB Group CHPAU

    Explicit MPC shifts the burden of solving quadratic optimization problems for optimal control strategies from online to offline, reducing them to point location problems. We study few simple yet effective algorithmic techniques to speed-up the offline pre-computation thus expanding the applicability of explicit MPC to higher dimension/longer horizon problems.