Concave minimum cost network flow problems solved with a colony of ants
In this work we address the Single-Source Uncapacitated Minimum Cost Network Flow Problem with concave cost functions. This problem is NP-Hard, therefore we propose a hybrid heuristic to solve it. Our goal is not only to apply an ant colony optimization (ACO) algorithm to such a problem, but also to...
| Autor principal: | |
|---|---|
| Outros Autores: | , |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2013
|
| Assuntos: | |
| Texto completo: | https://repositorio-aberto.up.pt/handle/10216/94439 |
| País: | Portugal |
| Oai: | oai:repositorio-aberto.up.pt:10216/94439 |