Multicommodity Flow Requirements
In this chapter we consider the minimum network synthesis problem with non-simultaneous multicommodity flow requirements when both edge capacities and flows are required to be integer. Since exact methods cannot currently solve realistic sized instances of this problem, we have developed a tabu search heuristic to find good feasible solutions in reasonable time.
KeywordsTabu Search Lagrangean Relaxation Tabu List Greedy Heuristic Linear Relaxation
Unable to display preview. Download preview PDF.