An algorithm for solving the transport problem on network with concave cost functions of flow on edges
We study the transport problem on network with concave cost function of flow on edges. An heuristic algorithm for solving this problem is proposed, and an implementation for solving allocation problem is given.
Main Authors: | Dumitru Lozovanu, Tatiana Pasha |
---|---|
Format: | Article |
Language: | English |
Published: |
Institute of Mathematics and Computer Science of the Academy of Sciences of Moldova
2002-11-01
|
Series: | Computer Science Journal of Moldova |
Online Access: | http://www.math.md/nrofdownloads.php?file=/files/csjm/v10-n3/v10-n3-(pp341-347).pdf |
Similar Items
-
Solving transportation problems with concave cost functions using genetic algorithms
by: Tatiana Pasa
Published: (2020-09-01) -
The minimum cost multicommodity flow problem in dynamic networks and an algorithm for its solving
by: Maria A. Fonoberova, et al.
Published: (2005-05-01) -
Developing Genetic Algorithm for solving the stochastic hub-and-spoke network problems with concave costs
by: Wei-Hung Chien, et al.
Published: (2010) -
The global search algorithms in minimum cost flow problem with concave costs
by: Jung-Chien Chen, et al.
Published: (2002) -
Analogous Ant Colony System Algorithm for Concave Cost Minimum Cost Network Flow Problems
by: Cheng-Lan Wang, et al.
Published: (2005)