consider network design problems in which the link capacities are also to be dimensioned and the flows of traffic are to be routed
Variants of The Problem
|
Variants
|
Description
|
|---|
|
capacity assignment problem
|
given:
- assigned flow value of each link
- traffic demand between each pair of nodes
objective:
- determine the optimal capacities of each link
|
|
flow assignment problem
|
given:
- capacities of each link
- traffic demand between each pair of nodes
objective:
- determine the optimal assignment of flow on each link
|
|
combined capacity and flow assignment problem
|
given:
- traffic demand between each pair of nodes
objective:
- determine the optimal capacities of each link
- determine the optimal assignment of flow on each link
|
Heuristic Algorithms For Capacity and/or Flow Assignment
- branch exchange algorithm
- cut saturation algorithm
- routing with economies of scale