An ant colony optimization metaheuristic for single-path multicommodity network flow problems
From MaRDI portal
Recommendations
- Ant Colony Optimization Metaheuristic for the Traffic Grooming in WDM Networks
- Finding edge-disjoint paths in networks: an ant colony optimization algorithm
- Exact and approximate approaches for the Pareto front generation of the single path multicommodity flow problem
- An improved ant colony optimization for the communication network routing problem
- Ant colony optimization for the cell assignment problem in PCS networks
Cited in
(6)- Exact and approximate approaches for the Pareto front generation of the single path multicommodity flow problem
- Artificial Intelligence and Soft Computing - ICAISC 2004
- Metaheuristics for solving the biobjective single‐path multicommodity communication flow problem
- Dynamic unsplittable flows with path-change penalties: new formulations and solution schemes for large instances
- Distributionally robust chance-constrained multicommodity network flow problem in dynamic networks: a column-generation approach
- A multi-start variable neighborhood search for solving the single path multicommodity flow problem
This page was built for publication: An ant colony optimization metaheuristic for single-path multicommodity network flow problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4929858)
