Considers the rational organization of deliveries in the optimization of a transportation network. An efficient computational algorithm based on the branch-and-bound method is proposed. This algorithm makes it possible to solve practical routing problems of rather high dimension.


    Zugriff

    Zugriff über TIB

    Verfügbarkeit in meiner Bibliothek prüfen


    Exportieren, teilen und zitieren



    Titel :

    A suboptimal algorithm for solving a transportation routing problem


    Weitere Titelangaben:

    Ein suboptimaler Algorithmus fuer die Loesung des Problems der Transportwege


    Beteiligte:
    Vasyanin, V.A. (Autor:in) / Savenkov, A.I. (Autor:in)

    Erschienen in:

    Erscheinungsdatum :

    1982


    Format / Umfang :

    5 Seiten, 3 Quellen


    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Print


    Sprache :

    Englisch




    Solving School Bus Routing Problem with genetic algorithm

    Ben Sghaier, Sayda / Ben Guedria, Najeh / Mraihi, Rafaa | IEEE | 2013


    Hybrid Heuristic Algorithm for solving Capacitated Vehicle Routing problem

    AbdElAziz, Moh. M. / A. El-Ghareeb, Haitham / Ksasy, M. S. M. | BASE | 2014

    Freier Zugriff

    Absolute point algorithm for solving unbalanced fuzzy transportation problem

    Rathi, K. / Muruganantham, S. | BASE | 2018

    Freier Zugriff

    Solving Vehicle Routing Problem Using Quantum Approximate Optimization Algorithm

    Azad, Utkarsh / Behera, Bikash K. / Ahmed, Emad A. et al. | IEEE | 2023


    Solving Vehicle Routing Problem with Time Windows by Genetic Algorithm

    Jiang, Dali / Zhang, Mingshan / Wang, Feng | ASCE | 2002