/system/images/000/000/219/Logo_Journ_es_Optimisation__2012_Outl_default.png

Incluant une Journée industrielle de l'optimisation

HEC Montréal, 7 - 9 mai 2012

JOPT2012

HEC Montréal, 7 — 9 mai 2012

Horaire Auteurs Mon horaire
Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402

MB2 Tournées de véhicules 1 / Vehicle Routing 1

7 mai 2012 10h30 – 12h10

Salle: KPMG

Présidée par Jean-François Cordeau

4 présentations

  • Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402
    10h30 - 10h55

    A Modular Heuristic Algorithm for Bi-Criteria Multi-Depot and Periodic Vehicle Routing Problems

    • Alireza Rahimi Vahed, Présentateur, Université de Montréal
    • Teodor Gabriel Crainic, Université du Québec à Montréal
    • Michel Gendreau, Polytechnique Montréal
    • Walter Rei, Université du Québec à Montréal

    We propose a heuristic epsilon-constraint method to efficiently tackle three vehicle routing problems, i.e., multi-depot VRP, periodic VRP and multi-depot periodic VRP with capacitated vehicles and constrained route duration. In each of these problems, two contradicting objectives, i.e., total number of used vehicles and total traveled distance, are to be simultaneously minimized.

  • Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402
    10h55 - 11h20

    An Integrative Cooperative Search for a Bi-Criteria Multi-Depot Periodic Vehicle Routing Problem

    • Alireza Rahimi Vahed, Présentateur, Université de Montréal
    • Teodor Gabriel Crainic, Université du Québec à Montréal
    • Michel Gendreau, Polytechnique Montréal
    • Walter Rei, Université du Québec à Montréal

    We design an integrative cooperative search framework to solve a vehicle routing problem characterized by the presence of a homogeneous fleet of vehicles, multiple depots, multiple periods and two kinds of practical constraints, i.e., vehicle capacity and route duration constraints. The goal is to simultaneously optimize two conflicting objectives, i.e., total number of used vehicles and total traveled distance.

  • Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402
    11h20 - 11h45

    An Exact Algorithm for the Two-Dimensional Orthogonal Packing Problem with Unloading Constraints

    • Jean-François Côté, Présentateur, Université de Montréal
    • Michel Gendreau, Polytechnique Montréal
    • Jean-Yves Potvin, Université de Montréal

    We consider a packing problem found in the delivery industry, where it must be determined if a set of rectangular items can be loaded in a truck so that the items of each customer are directly reachable at the time of delivery (i.e., without moving any other item).

  • Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402
    11h45 - 12h10

    A Column Generation Algorithm for Multi-Depot Vehicle Routing Problem with Inter-Depot Routes

    • Ibrahim Muter, Présentateur, CIRRELT - HEC Montréal
    • Jean-François Cordeau, HEC Montréal
    • Gilbert Laporte, HEC Montréal

    We propose a column generation algorithm to solve the multi-depot vehicle routing problem with inter-depot routes. We model it as a set-covering problem with an additional constraint and design two pricing subproblems to generate the variables. We embed the column generation algorithm in a branch-and-bound algorithm and conduct computational experiments.

Retour