Abstract The minimum concave cost transportation problem is the benchmark problem in numerical computing and it has been used widely in the schedule of smart transportation. In this paper, a deterministic annealing neural network algorithm is proposed to solve the minimum concave cost transportation problem. The algorithm is derived from two neural network models and Lagrange-barrier functions. The Lagrange function is used to handle linear equality constraints and the barrier function is used to force the solution to move to the global or near-global optimal solution. The computer simulations on test problem are made and the results indicate that the proposed algorithm always generates global or near global optimal solutions.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    A New Method for the Minimum Concave Cost Transportation Problem in Smart Transportation


    Beteiligte:
    Li, Chuan (Autor:in) / Wu, Zhengtian (Autor:in) / Fu, Baochuan (Autor:in) / Dang, Chuangyin (Autor:in) / Zheng, Jinjin (Autor:in)


    Erscheinungsdatum :

    2019-01-01


    Format / Umfang :

    7 pages





    Medientyp :

    Aufsatz/Kapitel (Buch)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch





    Concave underframe and container transportation equipment

    SHEN PENG / TAO DEQIANG / CHEN WEI et al. | Europäisches Patentamt | 2022

    Freier Zugriff

    Application of Minimum-Cost Flow Problem for Shuttle Tanker Transportation Planning

    Shi, Yifan / Hu, Hao / Jiang, Fangrong | Transportation Research Record | 2015



    A Transportation Problem with Minimum Quantity Commitment

    Lim, A. / Wang, F. / Xu, Z. | British Library Online Contents | 2006