Conţinutul numărului revistei |
Articolul precedent |
Articolul urmator |
297 12 |
Ultima descărcare din IBN: 2023-10-09 15:10 |
Căutarea după subiecte similare conform CZU |
519.853 (4) |
Cercetări operaționale (OR) teorii şi metode matematice (169) |
SM ISO690:2012 PAŞA, Tatiana. Solving the non-linear multi-index transportation problems with genetic algorithms. In: Computer Science Journal of Moldova, 2022, nr. 1(88), pp. 77-92. ISSN 1561-4042. |
EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
Computer Science Journal of Moldova | ||||||
Numărul 1(88) / 2022 / ISSN 1561-4042 /ISSNe 2587-4330 | ||||||
|
||||||
CZU: 519.853 | ||||||
MSC 2010: 68W25, 68W50, 90B06, 90C06, 90C08, 90C26, 90C30, 90C35, 90C59. | ||||||
Pag. 77-92 | ||||||
|
||||||
Descarcă PDF | ||||||
Rezumat | ||||||
In this paper we study the non-linear multi-index transportation problem with concave cost functions. We solved the non-linear transportation problem on a network with 5 indices (NTPN5I) described by sources, destinations, intermediate nodes, types of products, and types of transport, that is formulated as a non-linear transportation problem on a network with 3 indices (NTPN3I) described by arcs, types of products, and types of transport. We propose a genetic algorithm for solving the large-scale problems in reasonable amount of time, which was proven by the various tests shown in this paper. The convergence theorem of the algorithm is formulated and proved. The algorithm was implemented in Wolfram Language and tested in Wolfram Mathematica. |
||||||
Cuvinte-cheie non-linear programming, concave function, transport problem, Index |
||||||
|