TRAVELLING SALESMAN PROBLEM AND CALL ROUTING

Abstract

In this paper we have briefed the minimum cost or to maximum profit of the routing network calls using travelling salesman problem. Our problem is somehow related to least cost routing, we will use heuristics method for travelling salesman problem to solve our formulated problem. All the network calls are transported via different routes between base stations. Service providers lay down their networks or sign an agreement with other provider services to customer while establish a connection, selecting the route associated with minimum cost is the ultimate solution. Telecommunication carriers regularly enter into whole scale contractual agreements with other carriers to access all or part of the other carrier’s telecommunication networks and/or telecommunication services. The provider aims at maximizing its profit and minimizing its cost while providing services. It also aims at maintaining a good quality of service and customer count and to protect itself from competitors. Here we are going to minimize the cost or maximize the profit of call routing by different methods for example nearest neighbors, sub tour heuristic and branch and bound which may help the company to achieve its goals. As by having a good network connection with minimum cost incurred will help company to provide good quality, maintain customer base, and thus reducing its competition. The costs that we obtain in all three methods are almost same but at the same time we find alternative paths too. So the company can decide which path they can choose. We take the total cost of call routing including establishment call, renting, marketing, purchasing etc and the link connection cost also. A coding is also done in order to obtain the optimal result. This paper relate the telecommunication costing with mathematical methods and in the end apply the mathematical code in python is given for finding optimal.