Shortest Path, Traveling Salesman and Hamiltonian Cycle are the other network

design problem. These problems are very common to back bone network design

problem. In all these three problems, the main difference is the degree of the node

which is strictly two. Further, these three problems are very similar with each other.

In the case of Shortest Path and Traveling salesman problem, a Hamiltonian Cycle is

checked in the possible solution. Due to this similarity, these three problems are also

considered in this research work. Shortest Path is considered in the terms of decision

making.-Shortest　Path,　Traveling　Salesman　and　Hamiltonian　Cycle　are　the　other　network

design　problem.　These　problems　are　very　common　to　back　bone　network　design

problem.　In　all　these　three　problems,　the　main　difference　is　the　degree　of　the　node

which is strictly two. Further, these three problems are very similar with each other.

In the case of Shortest Path and Traveling salesman problem, a Hamiltonian Cycle is

checked in the possible solution. Due to this similarity, these three problems are also

considered in this research work. Shortest Path is considered in the terms of decision

making.