Solving the non-linear multi-index transportation problems with genetic algorithms
Computer Science Journal of Moldova · 2022
DOI: 10.56415/csjm.v30.05 ↗Kurz gefasst
Fachartikel in der Zeitschrift Computer Science Journal of Moldova, 2022. Verfasst von Tatiana Pașa.
Abstract (Originalsprache)
In this paper we study the non-linear multi-index transporta\-tion 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.
Zitieren
APA
Pașa, T. (2022). Solving the non-linear multi-index transportation problems with genetic algorithms. Computer Science Journal of Moldova. https://doi.org/10.56415/csjm.v30.05
Vancouver
Pașa T. Solving the non-linear multi-index transportation problems with genetic algorithms. Computer Science Journal of Moldova. 2022. doi:10.56415/csjm.v30.05
BibTeX
@article{Paa2022,
author = {Pașa, Tatiana},
title = {Solving the non-linear multi-index transportation problems with genetic algorithms},
journal = {Computer Science Journal of Moldova},
year = {2022},
doi = {10.56415/csjm.v30.05}
}
EUVIMED