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

TB3 Tournées de véhicules IV / Vehicle Routing IV

3 mai 2011 13h30 – 15h10

Salle: Banque CIBC

Présidée par Julie Paquette

4 présentations

  • 13h30 - 13h55

    Multi-Objective VRP with Distance Based Decision Support

    • Arne Løkketangen, prés., Molde University College
    • Jorge Luis Oyola Mendoza, Molde University College, Norway
    • Johan Oppen, Molde University College
    • David L. Woodruff, UC Davis

    We look at the multiobjective vehicle routing problem
    with route balancing (VRPRB). In a decision support
    setting, we show the benefits of applying a structural
    measure on the distances between solutions on (and near)
    the pareto front. We also discuss ways to interpret and
    implement various policies.

  • 13h55 - 14h20

    Multi-Objective Multi-Attribute Vehicle Routing Problems

    • 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

    Multi-attribute routing problems are very interesting both because of their academic appeal and their real-life applications. Similarly, the multi-objective optimization problem is attracting more attention, because it provides new opportunities for defining more realistic problems. We address challenges related to multi-objective optimization in multi-attribute routing problems.

  • 14h20 - 14h45

    A Matheuristic Approach for the Multi-Commodity One-to-One Pickup-and-Delivery Traveling Salesman Problem

    • Juan Jose Salazar Gonzalez, prés., Universidad de La Laguna
    • Inmaculada Rodriguez Martin, Universidad de La Laguna

    This presentation addresses an extension of the TSP where a vehicle with a limited capacity must transport certain commodities from their origins to their destinations. Each commodity has a weight, and the objective is to find a minimum length Hamiltonian tour satisfying all the transportation requests without ever violating the capacity constraint. We propose for this problem a heuristic approach that combines mathematical programming and metaheuristic techniques. The method is able to improve the best known solutions for a set of instances from the literature in a reasonable amount of computation time.

  • 14h45 - 15h10

    A Multicriteria Tabu Search Heuristic for the Dial-a-Ride Problem: Results for Real-Life Instances

    • Julie Paquette, prés., HEC Montréal
    • Jean-François Cordeau, HEC Montréal, GERAD, CIRRELT
    • Gilbert Laporte, HEC Montréal
    • Marta Pascoal, University of Coimbra and INESC-Coimbra

    Service quality criteria were identified during a survey with users of a Canadian dial-a-ride operator. These criteria were embedded in the multi-objective function of a tabu search algorithm designed to tackle real-life dial-a-ride problems. Computational results on real data will be presented. These results improve the understanding of tradeoffs between quality and cost for the service provider.