| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 458 12 |
| Ultima descărcare din IBN: 2024-01-25 14:29 |
| Căutarea după subiecte similare conform CZU |
| 004.021+519.8 (1) |
| Știința și tehnologia calculatoarelor. Calculatoare. Procesarea datelor (4178) |
| Cercetări operaționale (OR) teorii şi metode matematice (169) |
 SM ISO690:2012PAŞA, Tatiana. Solving transportation problems with concave cost functions using genetic algorithms. In: Computer Science Journal of Moldova, 2020, nr. 2(83), pp. 140-151. ISSN 1561-4042. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
  Computer Science Journal of Moldova |
||||||
| Numărul 2(83) / 2020 / ISSN 1561-4042 /ISSNe 2587-4330 | ||||||
|
||||||
| CZU: 004.021+519.8 | ||||||
| MSC 2010: 05C21, 90C06, 90C26, 90B15, 90B06, 90C59. | ||||||
| Pag. 140-151 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
In this paper we propose a genetic algorithm for solving the non-linear transportation problem on a network with concave cost functions and the restriction that the flow must pass through all arcs of the network. We show that the algorithm can be used in solving large-scale problems. We prove that the complexity of a single iteration of the algorithm is O(nm) and converges to an ǫ-optimum solution. We also present some implementation and testing examples of the algorithm using Wolfram Mathematica |
||||||
| Cuvinte-cheie genetic algorithm, population, minimum cost flow, non-linear transport problem, large-scale problem, concave function |
||||||
|
|
|
|
