Research ArticleOpen accessIn the author namesOPTIMIZING MULTIPLE TRAVELLING SALESMAN PROBLEM CONSIDERING THE ROAD CAPACITYRanjana Ponraj, George AmalanathanThe Multiple Travelling Salesman Problems (MTSP) can be used in a wide range of discrete optimization problems. As the solution to this problem has wide applicability in many practical fields, this NP Hard problem highly raises the need for an efficient solution. The problem is determining a set of routes for the salesmen that jointly visit a set of given … …Journal of Computer Science, Vol. 10, Issue 4 · 23 Dec 2013 · 6,795 accessesView PDFCite
Research ArticleOpen accessIn the author namesCONSTRUCTION OF STRATEGIC CONNECTED DOMINATING SET FOR MOBILE AD HOC NETWORKSVictor Ceronmani Sharmila, Amalanathan GeorgeConnected Dominating Sets (CDSs) can serve as virtual backbones for wireless networks. A smaller virtual backbone (minimum size CDS) incurs less communication overhead. Unfortunately, computing a minimum size CDS is NP-hard and thus many algorithms were developed which concentrates on how to construct smaller CDSs. Aiming for minimum number of nodes in CDS, results in CDSs that are highly unstable. … …Journal of Computer Science, Vol. 10, Issue 2 · 16 Nov 2013 · 6,913 accessesView PDFCite