This paper deals with generating of an optimized route for multiple Traveling Salesman Problems. We used a methodology of clustering the given cities depending upon the number of salesmen and each cluster is allotted to a salesman. “k-Means clustering” algorithm has been used for easy clustering of the cities. In this way the mTSP has been converted into TSP which is simple in computation compa...

Clock synchronization is very important for power management protocol in a multi-hop MANET. However, since MANET is a network temporarily formed by a collection of mobile nodes without the aid of any centralized coordinator, clock synchronization is very difficult to achieve. Therefore, most of previous works on power efficiency assumed asynchronous clock. As a consequence, a mobile node will w...

In this paper, we extend the classical multiple traveling salesman problem (mTSP) by imposing a minimal number of nodes that a traveler must visit as a side condition. We consider single and multidepot cases and propose integer linear programming formulations for both, with new bounding and subtour elimination constraints. We show that several variations of the multiple salesman problem can be ...

The multiple traveling salesman problem (MTSP) involves scheduling m > 1 salesmen to visit a set of n > m nodes so that each node is visited exactly once. The objective is to minimize the total distance traveled by all the salesmen. The MTSP is an example of combinatorial optimization problems, and has a multiplicity of applications, mostly in the areas of routing and scheduling. In this paper,...

Entity analysis in natural language processing involves solving multiple structured prediction problems such as mention detection, coreference resolution, and entity linking. We explore the space of search-based learning approaches to solve the problem of multi-task structured prediction (MTSP) in the context of entity analysis. In this paper, we study three different search architectures to so...

In this paper, Self-Organizing Map (SOM) for the Multiple Traveling Salesman Problem (MTSP) with minmax objective is applied to the robotic problem of multigoal path planning in the polygonal domain. The main difficulty of such SOM deployment is determination of collision-free paths among obstacles that is required to evaluate the neuron-city distances in the winner selection phase of unsupervi...

A fundamental variant of the classical traveling salesman problem (TSP) is so-called multiple TSP (mTSP), where a set m salesmen jointly visit all cities from n cities. The mTSP models many important real-life applications, in particular for vehicle routing problems. An extensive survey by Bektas (Omega 34(3), 2006) lists variety heuristic and exact solution procedures that solve instances. In ...

Multiple Traveling Salesman Problem (MTSP) is an important combinatorial optimization problem. However, it is applicable to only the cases in which multiple executing individuals (traveling salesman) share the common workspace (city set). It cannot be used to handle many multi-machine engineering systems where multiple machines’ workspaces are not the same and partially overlap with each other....

Run-time reconfiguration (RTR) of FPGAs is mainly done using the configuration interface. However, for a certain group of designs, RTR using the shift register functionality of the LUTs is a much faster alternative than conventional RTR using the ICAP. This method requires the creation of reconfiguration chains connecting the run-time reconfigurable LUTs (SRL). In this paper, we develop and eva...

This paper investigates the task assignment and path planning problem for multiple AUVs in three dimensional (3D) underwater wireless sensor networks where nonholonomic motion constraints of underwater AUVs in 3D space are considered. The multi-target task assignment and path planning problem is modeled by the Multiple Traveling Sales Person (MTSP) problem and the Genetic Algorithm (GA) is used...