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 nonlinear 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(n2) and the algorithm converges to a local optimum solution. We sho...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
EDP Sciences
2020-01-01
|
| Series: | ITM Web of Conferences |
| Online Access: | https://www.itm-conferences.org/articles/itmconf/pdf/2020/04/itmconf_icamnm2020_02006.pdf |