Sharif Digital Repository

Multicommodity network flow problem arises in the areas of transportation, logistics, and, telecommunication. The cost of each arc might be a linear or nonlinear function of the sum of commodity flows on that arc. Most of researches have worked on linear multicommodity flow problem. In addition, they consider the shared capacity constraints as the side constraints. In this thesis, we present a penalty-based algorithm for solving the multicommodity network flow problem with a linear or nonlinear objective function and considering the shared capacity constraints as the side. To solve multicommodity network flow problem, we relax the shared capacity constraints, and add a penalty term for the...