Abstract:
Some aspects related to the structure of a non- linear network transportation problem are investigated. An improvement of an algorithm proposed earlier is provided by the means of sequential and parallel programming and by using several initial admissible solutions. An analysis of different ways of the algorithm implementation in the Wolfram Language is done. Obtained testing results on problems with different dimensions and complexities are presented.