Input: US backbone topology wich consists of $24$ nodes and $43$

ediges is given as input. The input file contains adjacency,

bahdwidth, delay, and reliablilty natrices. The relationship

between each node in these natrices is separated by $"$: $*.$ Each

matrix is separated by an empty rou.

In the nelghborhood natrix, link distances are uniformly

distributed between $1$ and $5.$

The bandwidth natrix uniforn distribution is betwoen $3$ and

The delay natrix is unitormly distributed between $2$ and $5.$

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

Request: A request will have source bode $1$d$,$ destination node

$1$d$,$ and bandwidth requirement information.

Solution: The function, called solution, will take the input

txi. $211$ and the defined request. With the information taken as

parameters, it is desired to find the shortest path between two

constraints.

You have to do the requirement. When you add delay and reliablilty

constraints to the solution, you can get additional pointa.

Constraints: The solution must be within the range of the

specified constraints.

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

Delay threshold nust be less than $40.($extra $5$ points$)$

Reliability threshold nust be greater than $0\mathrm{.}70.($extra

$5$ points?

Algorithm: Three of the following algorithms must be used to

solve the problem.

Dijkstra Algoritham

Belinan$-$Ford Algorithn

A$*$ Algoritha

Flody$-$Warshall Algorithr.

Additional polnts will be awarded for solving the problem with any

of the meta$-$heurlstic algorithms specified. $($extra $10$ pointe$)$

Simulated Annealing Algorichm

Tabo Search Algorithm

Ant Colony A$.$lgorithn

Bee Colony A$.$igorithn

Firetiy Aigorithi

Explanation:

First, you should read the input file and take the parts

sultable for the constraint you wili use.

Then, you noed to send the paranoters to the mothod according

to your request and find the path that provides the necessary

constraints. If you want to find a solution for nore than one

constraint, you must nake sure that the path found satisfies

Each mothol constraints.

Each inothod should be written in separate methods. If you are

individuajly solution with nultiple paraneters, you need to

Output: After running the aigorithm, it should give ali nodes

in the calculated path.

The problen should find a solution according to the objective

function given belou.

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

In the given equation:

Graph $($G$)$ consists of vertex and edges, $G=(V,E)\mathrm{.}1$ and $y$ are

two vertices defined in the graph and $1j$ denotes an edge in

the edge set.

bw represents bandwidth demand,

${}_{ij}=\{\begin{array}{ccc}1,& if\text{e}\text{d}\text{g}\text{e}(i,f)is\text{u}\text{s}\text{e}\text{d}& \\ 0,\end{array}$