An ant colony optimization metaheuristic for single-path multicommodity network flow problems
From MaRDI portal
Publication:4929858
DOI10.1057/jors.2009.86zbMath1230.90047OpenAlexW2136863244MaRDI QIDQ4929858
Fazle Baki, Xiangyong Li, Yash P. Aneja
Publication date: 24 September 2010
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.2009.86
heuristicsant colony optimizationnetworks and graphsmulticommodity network flowrouting strategysingle path
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
Related Items (4)
Exact and approximate approaches for the Pareto front generation of the single path multicommodity flow problem ⋮ 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 ⋮ A multi-start variable neighborhood search for solving the single path multicommodity flow problem
Uses Software
This page was built for publication: An ant colony optimization metaheuristic for single-path multicommodity network flow problems
