/system/images/000/000/241/logoJO2013-opde_default.jpg

HEC Montréal, Canada, 6 - 8 mai 2013

Journées de l'optimisation 2013

HEC Montréal, Canada, 6 — 8 mai 2013

Horaire Auteurs Mon horaire

MA3 Tournées de véhicules I / Vehicle Routing Problem I

6 mai 2013 10h30 – 12h10

Salle: St-Hubert

Présidée par Gilbert Laporte

4 présentations

  • 10h30 - 10h55

    GRASP with Advanced Starting Point for the VRP with Route Balancing

    • Arne Løkketangen, prés., Molde University College
    • Jorge Oyola, Molde University College

    We propose a variant of GRASP (Greedy Randomized Adaptive Search procedure) to solve a bi-objective extension of VRP known as VRPRB – Vehicle Routing Problem with Route Balancing. Computational results will be presented.

  • 10h55 - 11h20

    The Quadratic Capacitated Vehicle Routing Problem

    • Rafael Martinelli, prés., GERAD - Polytechnique Montréal
    • Claudio Contardo, GERAD - ESG UQÀM

    We introduce the Quadratic Capacitated Vehicle Routing Problem, a problem which arises in practical applications in logistics and transportation. It generalizes the Capacitated Vehicle Routing Problem and the Quadratic Traveling Salesman Problem. We present a formulation and strengthen it with several valid inequalities. We show results for a branch-and-cut algorithm.

  • 11h20 - 11h45

    Maritime Fleet Deployment with Voyage Separation Requirements

    • Kjetil Fagerholt, prés., Norwegian University of Science and Technology
    • Inge Norstad, Norwegian University of Science and Technology
    • Jørgen G. Rakke, Norwegian University of Science and Technology
    • Richard Eglese, Lancaster University Management School

    We present a maritime fleet deployment problem in which voyages for the same trade route must be somewhat evenly spread in time. To solve the problem we propose a branch-and-price algorithm, which has been tested on real life instances from a Norwegian bulk shipping company.

  • 11h45 - 12h10

    Unified Metaheuristics and Large Neighborhoods for Multi-Attribute VRPs

    • Thibaut Vidal, prés., CIRRELT, Université de Montréal & ICD-LOSI, Université de Technologie de Troyes
    • Teodor Gabriel Crainic, Université du Québec à Montréal
    • Michel Gendreau, Polytechnique Montréal
    • Christian Prins, Université de Technologie de Troyes

    A recently-proposed unified metaheuristic framework for VRPs, based on attribute-dependent assignment, sequencing and route-evaluation components, is described. We further introduce new route evaluations inspired from bi-directional dynamic programming to explore large neighborhoods with combined assignment and sequencing changes, for VRPs with multiple depots, fleet mix, and prize collection.

Retour