/system/images/000/000/183/logoJO2011_default.jpg

HEC Montréal, Canada, 2 - 4 mai 2011

Journées de l'optimisation 2011

HEC Montréal, Canada, 2 — 4 mai 2011

Horaire Auteurs Mon horaire

TA3 Tournées de véhicules III / Vehicle Routing III

3 mai 2011 10h30 – 12h10

Salle: Banque CIBC

Présidée par Phuong Nguyen Khanh

4 présentations

  • 10h30 - 10h55

    A Column Generation Approach for a Rich Vehicle Routing Problem

    • Iman Dayarian, prés., Université de Montréal
    • Michel Gendreau, Polytechnique Montréal
    • Teodor Gabriel Crainic, Université du Québec à Montréal
    • Walter Rei, Université du Québec à Montréal

    We consider a deterministic multi-attribute vehicle routing problem derived from a real-life milk collection system. This problem is characterized by the presence of a non-homogeneous fixed fleet of vehicles, multiple depots, multiple periods and several resource constraints. To tackle the problem, a column generation-based methodology is proposed.

  • 10h55 - 11h20

    Solving a Rich Vehicle Routing Problem Using a Path Relinking Integrator

    • Alireza Rahimi Vahed, prés., 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 consider a vehicle routing problem characterized by the presence of a homogeneous fleet of vehicles, multiple depots, multiple periods and two kinds of constraints, i.e., vehicle capacity and route duration. We propose a path reliking meta-heuristic and evaluate its performance as stand-alone and as part of an integrative cooperative search algorithm.

  • 11h20 - 11h45

    A Hybrid Genetic Algorithm for the Periodic Vehicle Routing Problem with Time Windows

    • Phuong Nguyen Khanh, prés., Université de Montréal
    • Teodor Gabriel Crainic, Université du Québec à Montréal
    • Michel Toulouse, Oklahoma State University

    To solve PVRPTW, we propose a hybrid genetic algorithm in which a set of neighborhood-based meta-heuristics cooperate with the genetic algorithm population evaluation mechanisms to enhance solution quality. Results of computational experiments demonstrating the efficiency of the proposed algorithm are reported.

  • 11h45 - 12h10

    A Hybrid Heuristic for the 3L-CVRP

    • Christophe Duhamel, prés., LIMOS, Université Clermont-Ferrand II
    • Philippe Lacomme, LIMOS, Université Clermont-Ferrand II
    • Hélène Toussaint, LIMOS, Université Clermont-Ferrand II

    The 3L-CVRP extends the VRP by imposing the items to deliver to fit the vehicles container. Thus it combines both VRP and 3D-packing features. We propose a GRASPxELS hybrid algorithm which uses a dedicated 3D-packing heuristic. Numerical results are presented to show the efficiency of our approach.

Retour