A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
An ant colony optimization metaheuristic for single-path multicommodity network flow problems
2010
Journal of the Operational Research Society
This paper studies the single-path multicommodity network flow problem (SMNF), in which the flow of each commodity can only use one path linking its origin and destination in the network. We study two versions of this problem based on two different objectives. The first version is to minimize network congestion, an issue of concern in traffic grooming over wavelength division multiplexing (WDM), and in which there generally exists a commodity flow between every pair of nodes. The second problem
doi:10.1057/jors.2009.86
fatcat:m4qkzefakzbkvl5r2q74r3bzuq