Journées de l'optimisation 2016

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

Horaire Auteurs Mon horaire
Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402

MA10 Vehicle Routing I

2 mai 2016 10h30 – 12h10

Salle: TD Assurance Meloche Monnex

Présidée par Luis Gouveia

4 présentations

  • Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402
    10h30 - 10h55

    A giant tour based compact formulation of the Sparse Travelling Salesman Problem

    • Amar Oukil, prés., Sultan Qaboos University

    The Sparse Traveling Salesman Problem (S-TSP) is the basic illustration of of a vehicle routing problem (VRP) on a real-life road network. The main feature of the S-TSP is a constraint stating that only certain pairs of customers may be adjacent on a route. We exploit this fact to develop a compact Mixed Integer Linear Programming (MILP) model to find the optimal solution to this problem. The solution of the proposed formulation requires initially finding the length of a giant tour. We show that small and medium-sized instances can be solved to proven optimality in reasonable CPU times using CPLEX without any additional cutting plane. Possible extensions of the model to other VRPs are also discussed.

  • Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402
    10h55 - 11h20

    Exact approaches for a multi-attribute technician routing and scheduling problem

    • Ines Mathlouthi, prés., Université de Montréal
    • Jean-Yves Potvin, Université de Montréal
    • Michel Gendreau, Polytechnique Montréal

    We consider a multi-attribute technician routing and scheduling problem motivated from an application for the repair of electronic transaction equipments. We introduce a branch and price algorithm and compare its results with those obtained by solving directly a mixed integer programming formulation.

  • Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402
    11h20 - 11h45

    Network flow precedence based formulations for the asymmetric traveling salesman problem (with precedence constraints)

    • Luis Gouveia, prés., University of Lisbon
    • Pierre Pesneau, Université de Bordeaux
    • Mario Ruthmair, Vienna University of Technology
    • Daniel Santos, University of Lisboa, DEIO, CMAFCIO

    There are several ways of modelling the Asymmetric Traveling Salesman Problem (ATSP) and the related Precedence Constrained Asymmetric Traveling Salesman Problem (PCATSP). In this talk we present new
    formulations for the two problems that can be viewed as resulting from combining precedence variable based
    formulations, with network flow based formulations.
    The motivating formulation for this work is a complicated and "weird" network flow based formulation that results from the separation of generalized subtour elimination constraints.
    This "weird" formulation exhibits, however, one interesting feature, namely the "disjoint sub-
    paths" property that is further explored to create more complicated formulations, but easier to understand, that combine two (or three) "disjoint path" network flow based formulations and have a stronger linear programming bound.
    Some of these stronger formulations are related to the ones presented previously for the ATSP and for the PCATSP.
    Several sets of projected inequalities in the space of the arc and precedence variables and in the spirit
    of many presented before are obtained by projection from these network
    flow based formulations.
    Computational results will be given for the ATSP and PCATSP to evaluate the quality of the new
    models and inequalities.

  • Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402
    11h45 - 12h10

    Solving the multi-vehicle covering tour problem with a dynamic programming-based operator

    • Nicolas Jozefowiez, prés., LAAS-CNRS
    • Leticia Vargas, LAAS-CNRS
    • Sandra Ulrich Ngueveu, LAAS-CNRS / Université de Toulouse - INPT

    We will present an adaptive large neighborhood search using an evaluator operator based on dynamic programming for the covering tour problem and the multiple vehicle variant. Several mechanisms to speed up the method is also proposed. The method is compared to other algorithms.

Retour