An ant colony optimization algorithm to solve the minimum cost network flow problem with concave cost functions
In this work we address the Singe-Source Uncapacitated Minimum Cost Network Flow Problem with concave cost functions. Given that this problem is of a combinatorial nature and also that the total costs are nonlinear, we propose a hybrid heuristic to solve it. In this type of algorithms one usually tr...
| Autor principal: | |
|---|---|
| Outros Autores: | , |
| Formato: | book |
| Idioma: | eng |
| Publicado em: |
2011
|
| Texto completo: | https://repositorio-aberto.up.pt/handle/10216/70499 |
| País: | Portugal |
| Oai: | oai:repositorio-aberto.up.pt:10216/70499 |