Journées de l'optimisation 2016

HEC Montréal, Québec, Canada, 2 — 4 mai 2016

Horaire Auteurs Mon horaire
Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402

MA7 Transport / Transportation I

2 mai 2016 10h30 – 12h10

Salle: TAL Gestion globale d'actifs inc.

Présidée par Frédéric Quesnel

4 présentations

  • Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402
    10h30 - 10h55

    The liner shipping network speed optimization problem

    • David Franz Koza, prés., Technical University of Denmark

    We consider a given liner shipping network consisting of a set of cyclic periodic shipping services. The goal is to minimize fuel consumption by optimizing sailing speeds between ports, while respecting port-to-port container transit time limits through the network, including transshipment times between services. We present results for exact and heuristic solution methods.

  • Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402
    10h55 - 11h20

    Improving branching for the crew pairing problem with base constraints

    • Frédéric Quesnel, prés., GERAD
    • François Soumis, Polytechnique Montréal
    • Guy Desaulniers, GERAD - Polytechnique Montréal

    Real-world crew pairing solvers consider restrictions on the total working time at each crew base. We propose a Danzig-Wolfe decomposition formulation for crew pairing problem that includes base constraints, restricting the total working. We propose different branching schemes to improve the computational time and the objective value of our instances.

  • Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402
    11h20 - 11h45

    Monthly crew pairing with 40 000 flights

    • François Soumis, prés., Polytechnique Montréal
    • Mohammed Saddoune, Faculté des sciences et techniques Mohammedia
    • François Lessard, GERAD

    The crew-pairing problem is modeled as a set-partitioning problem solved by columns generation. The Dynamic Constraints Aggregation speed-up the master problem and permits to solve a weekly window of 10 000 flights in few hours. The Rolling Horizon with weekly windows produces solution improved by up to 5%.

  • Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402
    11h45 - 12h10

    Cross-dock door assignment problem under congestion

    • Sachin Jayaswal, prés., Indian Institute of Management Ahmedabad
    • Swapnil Rayal, Indian Institute of Management Ahmedabad

    At an operational level, trucks arriving at a cross-dock terminal carrying a family of goods from several origins are assigned to strip doors. At strip doors, goods are unloaded, inspected and sorted according to their destinations. Unloaded goods are then transferred, using material handling equipments such as forklifts or conveyors, to their respective stack doors for loading on outgoing trucks to their destinations. Cross-dock Door Assignment problem (CDAP) seeks to optimally decide on the assignment of both incoming and outgoing trucks to strip and stack doors, respectively so as to minimize the material handling cost inside the cross-dock. We capture the effect of congestion due to excessive traffic assigned at strip/stack doors through a non-linear congestion function. This results in a non-linear integer programming problem. We develop three alternative solution approaches to solve the resulting model; one based on generalized Benders decomposition, and two based on alternative forms of Lagrangian relaxation.