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.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Approximate solutions for the capacitated arc routing problem


    Weitere Titelangaben:

    Approximative Loesungen des Problems der Transportkapazitaet und der Reichweite


    Beteiligte:
    Wen Lea Pearn (Autor:in)

    Erschienen in:

    Erscheinungsdatum :

    1989


    Format / Umfang :

    12 Seiten, 9 Quellen



    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Print


    Sprache :

    Englisch




    Capacitated arc routing problem with extensions

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


    Capacitated vehicle routing problem model for carriers

    Irma-Delia Rojas-Cuevas / Santiago-Omar Caballero-Morales / Jose-Luis Martinez-Flores et al. | DOAJ | 2018

    Freier Zugriff

    Capacitated-Vehicle Routing Problem with Backhauls on Trees

    Kumar, Roshan / Unnikrishnan, Avinash / Waller, S. Travis | Transportation Research Record | 2011


    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

    Freier Zugriff