Genetic algorithm for solving transportation problems on networks with one source and multiple sinks

In this paper we propose a genetic algorithm for solving the non-linear transportation problem on a network with multiple sinks and concave piecewise cost functions. We prove that the complexity of one iteration of the algorithm is O(n(2)) and the algorithm converges to a local optimum solution. We show that the algorithm can be used to solve large-scale problems and present the implementation and several testing examples of the algorithm using Wolfram Language.