Abstract—Network computer connections are growing at a faster rate. There is a needs advanced algorithms that helps in optimizing the network performance. Classical optimization based approaches have been applied since long time. But there is a need for more flexible and advanced algorithmic approaches to model the increasingly complex networks. Optimization is to find the best solution, either maximum or minimum out of all feasible solutions. In this paper, we propose an extension Travelling salesman Problem (TSP) in a systemic way by means of the modified version of the Multiple Traveling Salesman Problem (MTSP). The aim of this paper is used to solve the routing problem by considering two objectives; one is the minimization of the total time travelled by the salesman considering the capacity of the edges. After providing the offline version of the problem we propose and prove the online version of the problem using the Dynamic capacity Routing (DCR) algorithm. This work gives all feasible tools that can help to solve the problem and provide experimental insights into feasible network instances based on real life and simulated data.

Index Terms—Capacity, dynamic, graphs, routing, optimization.

Ranjana Ponraj is with Hindustan University, Chennai, Tamil Nadu, India.
George Amalanathan is with Periyar Maniammai University, Thanjavur, Tamil Nadu, India.

Cite:Ranjana Ponraj, George Amalanathan, "Dynamic Capacity Routing in Networks with MTSP," International Journal of Computer and Communication Engineering vol. 5, no. 6, pp. 465-472, 2016.