Project Details:

Input: us backbone topology which consists of $24$ nodes anc edges is given as input. The input file contains adjacer bandwidth, delay, and reliability matrices. The relations between each node in these matrices is separated by $"$:$".$ matrix is separated by an empty row.

In the neighborhood matrix, link distances are unifol distributed between $1$ and $5.$

The bandwidth matrix uniform distribution is between $310.$

The delay matrix is uniformly distributed between $1$ and $5$

The reliability matrix is between $0\mathrm{.}95$ and $0\mathrm{.}99.$

Request: A request will have source node id$,$ destination id$,$ and bandwidth requirement information.

Solution: The function, called Solution, will take the ir txt file and the defined request. With the information taker parameters, it is desired to find the shortest path between points $($source and destination$)$ by satisfying the follor constraints.

You have to do the requirement. When you add delay and reliabi. constraints to the solution, you can get additional points.

Constraints: The solution must be within the range of specified constraints.

Bandwidth demand must be $5.($required$)$

Delay threshold must be less than $40.($extra $5$ point

Reliability threshold must be greater than $0\mathrm{.}70.($ez $5$ points$)$

Algorithm: Three of the following algorithms must be usec solve the problem.

Dijkstra Algorithm

Bellman$-$Ford Algorithm

A$*$ Algorithm

Flody$-$Warshall Algorithm

Additional points will be awarded for solving the problem with of the meta$-$heuristic algorithms specified. $($extra $10$ points$)$

Simulated Annealing Algorithm

Tabu Search Algorithm

Ant Colony Algorithm

Bee Colony Algorithm

Algorithm: Three of the following algorithms must be used solve the problem.

Dijkstra Algorithm

Bellman$-$Ford Algorithm

A$*$ Algorithm

Flody$-$Warshall Algorithm

Additional points will be awarded for solving the problem with a of the meta$-$heuristic algorithms specified. $($extra $10$ points$)$

Simulated Annealing Algorithm

Tabu Search Algorithm

Ant Colony Algorithm

Bee Colony Algorithm

Firefly Algorithm

Explanation:

First, you should read the input file and take the par suitable for the constraint you will use.

Then, you need to send the parameters to the method accordi to your request and find the path that provides the necessa constraints. If you want to find a solution for more than c constraint, you must make sure that the path found satisfi all constraints.

Each method should be written in separate methods. If you a making a solution with multiple parameters, you need individually specify methods for each one.

Output: After running the algorithm, it should give all nod in the calculated path.

The problem should find a solution according to the objecti function given below.

min$(bw{\displaystyle \underset{\text{i}\text{j}\text{i}\text{n}\text{E}}{\overset{?}{}}}{}_{ij}dis{t}_{ij})$

In the given equation:

Graph $($G$)$ consists of vertex and edges, $G=(V,E).$ i and $j$ a two vertices defined in the graph and ij denotes an edge the edge set.

bw represents bandwidth demand,

${}_{ij}=\{\begin{array}{ccc}1,& if\text{e}\text{d}\text{g}\text{e}(i,j)is\text{u}\text{s}\text{e}\text{d}& \\ 0,& \text{o}\text{t}\text{h}\text{e}\text{r}\text{w}\text{i}\text{s}\text{e}& \end{array}$

dist ${?}_{ij},$ edge distances between i and $j.$