资 源 简 介
The Frequency Assignment Problem is one of the most studied problems in graph theory, in particular, due to its applications to mobile telecommunication network design.
This project implements a FAP Solver, consisting of
* various algorithms to solve the problem
* definition of well-known Problem instances (Philadelphia)
* test framework allowing to use the algorithms to solve defined problems
The framework is highly extensible, new algorithm or map can be easily integrated within the current code.
Currently implemented algorithms (each of them has various parameters):
* sequential algorithms
* genetic algorithms
* simulated annealing
* tabu search
