Journées de l'optimisation 2018

HEC Montréal, Québec, Canada, 7 — 9 mai 2018

Horaire Auteurs Mon horaire
Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402

WA11 Networks and logistics

9 mai 2018 10h30 – 12h10

Salle: Xerox Canada (48)

Présidée par Amira Dems

4 présentations

  • Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402
    10h30 - 10h55

    Modeling the hyperconnected urban freight transportation system (HCL)

    • Lilia Jemai, prés., École Polytechnique de Montréal
    • Michel Gendreau, Polytechnique Montréal
    • Teodor Gabriel Crainic, Université du Québec à Montréal

    We introduce a new problem for selecting services in a tactical plan of an n-tier hyperconnected city logistics system. Compared to existing models, we consider a coalition of carriers and logisticians sharing their resources and residual transportation capacity. These actors share their equipment and their information in order to optimize economic costs and environmental impact.

  • Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402
    10h55 - 11h20

    Multi-period prize collecting Steiner tree problem with budget constraints

    • Larissa Faria, prés., PUC-RIO
    • David Sotelo, Petrobras
    • Sanjay Dominik Jena, ESG UQAM
    • Jean-François Cordeau, GERAD - HEC Montréal
    • Helio Lopes, PUC-Rio

    In this work we consider the problem of finding an optimal expansion plan for gas pipeline networks. The model maximizes the potential increase to a company’s profit on a specified horizon. It is defined as a Multi-period Prize Collecting Steiner Tree problem with budget constraints, since there are vertex profits, edge costs and budget limits per period.

  • Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402
    11h20 - 11h45

    Relay network design under demand uncertainty

    • Maria Bardossy, prés., University of Baltimore

    The placement problem of relays arises in telecommunications and distribution systems where the load must be regenerated or transferred at intermediate stations (relays) on the route from its origin to its destination. The optimal location of relay nodes depends on the traffic pattern on the network; however, this pattern might be uncertain or variable over time. We review various formulations and variations of the problem (mainly deterministic) from the literature. Then we explicitly incorporate demand uncertainty in the strategic design of the relay network and explore alternative formulations. Preliminary results are presented.

  • Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402
    11h45 - 12h10

    Distribution network design and inventory planning under uncertainty

    • Amira Dems, prés., HEC Montréal
    • Jean-François Cordeau, GERAD - HEC Montréal
    • Yossiri Adulyasak, HEC Montréal

    An integrated distribution network design-inventory control problem with service requirements in retailing is addressed. This problem is complex due to the general form of demand uncertainty and nonlinear customer service level constraints. To solve the problem, an algorithm based on branch-and-cut framework and a new family of valid cuts are presented. A heuristic approach is developed to tackle large scale problems.