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.


    Access

    Access via TIB

    Check availability in my library


    Export, share and cite



    Title :

    A suboptimal algorithm for solving a transportation routing problem


    Additional title:

    Ein suboptimaler Algorithmus fuer die Loesung des Problems der Transportwege


    Contributors:

    Published in:

    Publication date :

    1982


    Size :

    5 Seiten, 3 Quellen


    Type of media :

    Article (Journal)


    Type of material :

    Print


    Language :

    English




    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

    Free access

    Absolute point algorithm for solving unbalanced fuzzy transportation problem

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

    Free access

    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