Download now Free registration required
This paper presents an attempt to solve Capacity and Flow Assignment (CFA) problem, which is NP-complete. Meta-heuristic and heuristic algorithms are invented in order to find not only feasible but also effective solution. A set of test network instances, with provided dual bounds as a reference, is used to: tune algorithms' parameters, conduct experiments and assess results. Final results provide statistical measures derived from experiments and imply which of proposed algorithms provides better solutions. The problems connected with design of Wide Area Networks (WAN) are important due to its practical application. Slight difference in solution quality has a big impact on networks maintenance cost.
- Format: PDF
- Size: 276 KB