Journées de l'optimisation 2017

HEC Montréal, 8-10 mai 2017

1er Atelier Canadien sur l'optimisation des soins de santé (CHOW)

HEC Montréal, 10-11 mai 2017

JOPT2017

HEC Montréal, 8 — 11 mai 2017

Horaire Auteurs Mon horaire
Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402

MB4 Design de réseaux / Network design

8 mai 2017 10h30 – 12h10

Salle: Meloche Monnex

Présidée par Carlos Zetina

4 présentations

  • Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402
    10h30 - 10h55

    A two-stage robust approach for the reliable logistics network design problem

    • Chun Cheng, Présentateur, Polytechnique Montreal
    • Ying Zhang,
    • Mingyao Qi, Tsinghua university
    • Louis-Martin Rousseau, Polytechnique Montreal

    This paper examines a three-echelon logistics network in which all supply and transshipment nodes are subject
    to disruptions. Uncertainty sets are employed to describe the concerned possible scenarios without depending
    on probabilistic information. We adopt a two-stage robust optimization approach where location decisions are
    made before and recourse decisions are made after disruptions being revealed. Three related two-stage robust
    models are constructed, which are solved exactly by a column-and-constraint generation algorithm. Numerical
    tests demonstrate that the proposed algorithm outperforms the Benders decomposition method in both solution
    quality and computational time, and that the system’s reliability can be gradually improved with only a slight
    increase in normal cost.

  • Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402
    10h55 - 11h20

    Branch-and-cut methods for the Network Design Problem with Vulnerability Constraints

    • Martim Joyce-Moniz, Présentateur, Polytechnique Montréal
    • Luis Gouveia, University of Lisbon
    • Markus Leitner, University of Vienna

    The Network Design Problem with Vulnerability Constraints imposes resilience against failures and bounds on the lengths of each communication path. When solving the state-of-the-art formulations in CPLEX, we cannot solve most instances based on large-sized networks. Therefore, we propose branch-and-cut methods that greatly improve the efficiency of solving this problem.

  • Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402
    11h20 - 11h45

    Design of Green Food Systems under Nutritional Considerations

    • Sonja Rohmer, Présentateur,
    • J.C. Gerdessen,
    • G.D.H. (Frits) Claassen,

    This research aims to propose an integrated network design problem for the global food system, incorporating production and consumption decisions within one common framework. Including sourcing, processing and transportation aspects, the developed model optimises both cost and environmental objectives and investigates possible trade-offs and shifts in environmental burdens.

  • Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402
    11h45 - 12h10

    A Benders based algorithm for the uncapacitated multicommodity network design problem

    • Carlos Zetina, Présentateur, CIRRELT
    • Ivan Contreras, Université Concordia
    • Jean-François Cordeau, HEC Montréal

    In this study, we present a novel exact algorithm for the uncapacitated multicommodity network design problem. Our algorithm combines the use of a modified Benders reformulation of the model, bound strengthening and heuristics to obtain primal bounds. We analyze the performance of the algorithm on benchmark instances and compare them with current solution methods.

Retour