This article proposes a mathematical model and a branch-and-price algorithm for the multivehicle covering tour problem. This problem consists in finding a set of routes on a weighted graph such that a set of nodes that cannot be visited is covered. A node is covered if it lies within a predefined distance of a visited node. The subproblem encountered during the column generation is a variant of the profitable tour problem. It is reduced to a ring star problem and a branch-and-cut algorithm is developed. Computational results are reported on randomly generated instances.


    Zugriff

    Zugriff über TIB

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    A branch-and-price algorithm for the multivehicle covering tour problem


    Beteiligte:

    Erschienen in:

    Networks ; 64 , 3 ; 160-168


    Erscheinungsdatum :

    2014


    Format / Umfang :

    9 Seiten




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Print


    Sprache :

    Englisch





    The Profitable Arc Tour Problem: Solution with a Branch-and-Price Algorithm

    Feillet, D. / Dejax, P. / Gendreau, M. | British Library Online Contents | 2005


    Semiautonomous multivehicle safety

    Verma, R. / Vecchio, D.D. | Tema Archiv | 2011


    Multivehicle Spacing Along Smooth Curvilinear Paths

    Weitz, Lesley / Hurtado, John | AIAA | 2010


    Vehicle Miles Traveled in Multivehicle Households

    Pathomsiri, Somchai / Haghani, Ali / Schonfeld, Paul M. | Transportation Research Record | 2005