The capacitated arc routing problem (CARP), is a capacitated variation of the arc routing problems in which there is a capacity constraint associated with each vehicle. Due to the computational complexity of the problem, research has focussed on developing and testing heuristic algorithms which solve the CARP approximately. The author reviews some of the existing solution procedures, analyzes their complexity, and presents two modifications of the existing methods (construct-strike algorithm and path scanning algorithm) to obtain near-optimal solutions for the CARP. Extensive computational results are presented and analyzed.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Approximate solutions for the capacitated arc routing problem


    Additional title:

    Approximative Loesungen des Problems der Transportkapazitaet und der Reichweite


    Contributors:

    Published in:

    Publication date :

    1989


    Size :

    12 Seiten, 9 Quellen



    Type of media :

    Article (Journal)


    Type of material :

    Print


    Language :

    English




    Capacitated arc routing problem with extensions

    Qiao, H. / Haghani, A. | British Library Conference Proceedings | 2005



    Heuristics for the periodic capacitated arc routing problem

    Chu, Feng / Labadi, Nacima / Prins, Christian | Tema Archive | 2005


    Improved Genetic Algorithm for Capacitated Vehicle Routing Problem

    Ren, C.Y. | British Library Conference Proceedings | 2013


    Reoptimization Heuristic for the Capacitated Vehicle Routing Problem

    Rodrigo Linfati / John Willmer Escobar | DOAJ | 2018

    Free access