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

  • Chuan Li
  • Zhengtian WuEmail author
  • Baochuan Fu
  • Chuangyin Dang
  • Jinjin Zheng
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 890)


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.


Minimum concave cost transportation problem Neural network algorithm Neural network models Lagrange-barrier functions 



This work was partially supported by NSFC under Grant No. 61672371, GRF: CityU 11302715 of Hong Kong SAR Government, Jiangsu Provincial Department of Housing and Urban–Rural Development under grants No. 2017ZD253, Ministry of housing and urban and rural construction under grants No. 2018-K1-007, the grant from Suzhou University of Science and Technology under grants No. XKZ2017011, and China scholarship council.


  1. 1.
    Erickson, R.E., Monma, C.L., Veinott Jr., A.L.: Send-and-split method for minimum-concave-cost network flows. Math. Oper. Res. 12, 634–664 (1987)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Fang, S.C., Tsao, H.-S.J.: Linearly-constrained entropy maximization problem with quadratic cost and its applications to transportation planning problems. Transp. Sci. 29, 353–365 (1995)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Gallo, G., Sodini, C.: Concave cost minimization on networks. Eur. J. Oper. Res. 3, 239–249 (1979)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Pardalos, P.M., Rosen, J.B.: Constrained global optimization: algorithms and applications. In: Lecture Notes in Computer Science, vol. 268. Springer (1987)Google Scholar
  5. 5.
    Zangwill, W.I.: Minimum concave cost flows in certain networks. Manag. Sci. 14, 429–450 (1968)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Guisewite, G.M.: Network problems. In: Horst, R., Pardalos, P.M. (eds.) Handbook of Global Optimization. Kluwer Academic Publishers (1995)Google Scholar
  7. 7.
    Hopfield, J.J., Tank, D.W.: Neural computation of decisions in optimization problems. Biol. Cybern. 52, 141–152 (1985)zbMATHGoogle Scholar
  8. 8.
    Liu, Q., Dang, C., Cao, J.: A novel recurrent neural network with one neuron and finite-time convergence for k-winners-take-all operation. IEEE Trans. Neural Netw. 21(7), 1140–1148 (2010)CrossRefGoogle Scholar
  9. 9.
    Hu, X., Zhang, B.: A new recurrent neural network for solving convex quadratic programming problems with an application to the k-winners-take-all problem. IEEE Trans. Neural Netw. 20(4), 654–664 (2009)Google Scholar
  10. 10.
    Hu, X., Wang, J.: An improved dual neural network for solving a class of quadratic programming problems and its k-winners-take-all application. IEEE Trans. Neural Netw. 19(12), 2022–2031 (2008)CrossRefGoogle Scholar
  11. 11.
    Lau, K.M., Chan, S.M., Xu, L.: Comparison of the Hopfield scheme to the hybrid of Lagrange and transformation approaches for solving the traveling salesman problem. In: Proceedings of International IEEE Symposium on Intelligence in Neural and Biological Systems, Hendon, pp. 209–217 (1995)Google Scholar
  12. 12.
    Xu, L.: Combinatorial optimization neural nets based on a hybrid of Lagrange and transformation approaches. In: Proceedings of World Congress on Neural Networks, San Diego, pp. 399–404 (1994)Google Scholar
  13. 13.
    Xu, L.: On the hybrid LT combinatorial optimization: new U-shape barrier, sigmoid activation, least leaking energy and maximum entropy. In: Proceedings of International Conference on Neural Information Processing (ICONIP’95), pp. 309–312. Publishing House of Electronics Industry, Beijing (1995)Google Scholar
  14. 14.
    Floudas, C.A., Pardalos, P.M.: A collection of test problems for constrained global optimization algorithms. In: Lecture Notes in Computer Science, vol. 455. Springer (1990)Google Scholar
  15. 15.
    Wu, Z., Li, B., Dang, C., Hu, F., Zhu, Q., Fu, B.: Solving long haul airline disruption problem caused by groundings using a distributed fixed-point computational approach to integer programming. Neurocomputing 269, 232–255 (2017)Google Scholar
  16. 16.
    Wu, Z., Li, B., Dang, C.: Solving multiple fleet airline disruption problems using a distributed-computation approach to integer programming. IEEE Access 5, 19116–19131 (2017)CrossRefGoogle Scholar
  17. 17.
    Wu, Z., Gao, Q., Li, B., Dang, C., Hu, F.: A rapid solving method to large airline disruption problems caused by airports closure. IEEE Access 5, 26545–26555 (2017)Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2019

Authors and Affiliations

  • Chuan Li
    • 1
    • 2
  • Zhengtian Wu
    • 3
    Email author
  • Baochuan Fu
    • 3
  • Chuangyin Dang
    • 2
  • Jinjin Zheng
    • 1
  1. 1.Department of Precision Machinery and Precision InstrumentationUniversity of Science and Technology of ChinaHefeiChina
  2. 2.Department of Systems Engineering and Engineering ManagementCity University of Hong KongKowloon TongChina
  3. 3.School of Electronic and Information EngineeringSuzhou University of Science and TechnologySuzhouChina

Personalised recommendations