Metaheuristics for solving the biobjective single-path multicommodity communication flow problem.
Hela MasriSaoussen KrichenAdel GuitouniPublished in: Int. Trans. Oper. Res. (2019)
Keyphrases
- bi objective
- network flow problem
- network design
- minimum cost flow
- minimum cost
- shortest path problem
- combinatorial optimization
- efficient solutions
- communication networks
- combinatorial optimization problems
- ant colony optimization
- optimization problems
- computer networks
- knapsack problem
- multi objective optimization
- metaheuristic
- shortest path
- particle swarm optimization
- np hard
- set covering problem
- neural network
- network design problem
- multi objective