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.
A New Method for the Minimum Concave Cost Transportation Problem in Smart Transportation
2019-01-01
7 pages
Aufsatz/Kapitel (Buch)
Elektronische Ressource
Englisch
A Transportation Problem with Minimum Quantity Commitment
Online Contents | 2006
|Concave underframe and container transportation equipment
Europäisches Patentamt | 2022
|Application of Minimum-Cost Flow Problem for Shuttle Tanker Transportation Planning
Transportation Research Record | 2015
|Minimum cost criteria for SPS transportation to GEO
NTRS | 1980
|A Transportation Problem with Minimum Quantity Commitment
British Library Online Contents | 2006
|