This paper describes a market-based solution to the problem of assigning mobile agents to tasks. The problem is formulated as the multiple depots, multiple traveling salesmen problem (MTSP), where agents and tasks operate in a market to achieve near-optimal solutions. We consider both the classical MTSP, in which the sum of all tour lengths is minimized, and the Min-Max MTSP, in which the longe...

The multiple traveling salesman problem (MTSP) is a generalization of the famous traveling salesman problem (TSP), where more than one salesman is used in the solution. Although the MTSP is a typical kind of computationally complex combinatorial optimization problem, it can be extended to a wide variety of routing problems. This paper presents an efficient and evolutionary optimization algorith...

9h15-10h15 : BERNARD FORTZ Département d’informatique, Université libre de Bruxelles, Belgique MODELS FOR TRAFFIC ENGINEERING IN ETHERNET NETWORKS IMPLEMENTING THE MULTIPLE SPANNING TREE PROTOCOL The Multiple Spanning Tree Protocol (MTSP) maintains a set of spanning trees that are used for routing the demands in the network. Each spanning tree is allocated to a pre-defined set of demands. We pr...

Classic multiple traveling salesman problem (MTSP) requires to find the k closed circular paths which minimize the sum of the path lengths, and each vertex is visited only once by a salesman. This paper presents an optimized model for the balanced Multiple-salesman Problem with time and capacity constraints, it requires that a salesman visits each vertex at least once and returns to the startin...

multiple traveling salesman problem (mtsp) is one of the most popular operation research problem and is known as combinatorial optimization problems. mtsp is an extension version of the famous and widely used problem named traveling salesman problem (tsp). because of its benefices in various domains, many researchers have tried to solve that, and many methods have proposed so far. mtsp is a np-...

The Multiple Travelling Salesman Problem (MTSP) is among the most interesting combinatorial optimization problems because it widely adopted in real-life applications, including robotics, transportation, networking, etc. Although importance of this problem, there no survey dedicated to reviewing recent MTSP contributions. In paper, we aim fill gap by providing a comprehensive review existing stu...

the multiple traveling salesman problem (mtsp) is a generalization of the famous traveling salesman problem (tsp), where more than one salesman is used in the solution. although the mtsp is a typical kind of computationally complex combinatorial optimization problem, it can be extended to a wide variety of routing problems. this paper presents an efficient and evolutionary optimization algorith...

According to the Motor Theory of Speech Perception (MTSP), listeners perceive speech by way of the articulatory gestures they would perform themselves in producing a similar signal. The theory postulates a module that allows extracting gestural information from the signal. The gestures constitute the event perceived. According to the Modulation Theory (MDT), speech is modulated voice. Listeners...

The convolutional neural network (CNN) based approaches have shown great success for speaker verification (SV) tasks, where modeling long temporal context and reducing information loss of characteristics are two important challenges significantly affecting the performance. Previous works introduced dilated convolution multi-scale aggregation methods to address above challenges. However, such al...

The multiple Traveling Salesmen Problem (mTSP) is a general extension of the famous NP-hard (TSP), that there are m (m>1) salesmen to visit cities. In this paper, we address mTSP with both minsum objective and minmax objective, which aims at minimizing total length tours longest tour among all tours, respectively. We propose an iterated two-stage heuristic algorithm called ITSHA for mTSP. Each ...