The 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 cities which are facing difficulty beca...

Dynamic routing occurs when customers are not known in advance, e.g. for real-time routing. Two heuristics proposed that solve the balanced dynamic multiple travelling salesmen problem (BD-mTSP). These represent operational (tactical) tools (online, real-time) Several types and scopes of dynamics proposed. Particular attention is given to sequential dynamics. The closest vehicle heuristic (BD-C...

Abstract The multiple travelling salesman problem (mTSP) is a classical optimisation that widely applied in various fields. Although the mTSP was solved using both algorithms and artificial neural networks, reiteration inevitable for these methods when presented with new samples. To meet online high‐speed logistics requirements deploying information technology, iterative algorithm may not be re...

Transportation is one thing that very important and the highest cost in supply chain. One way to reduce these costs optimize vehicle routes. The Multiple Traveling Salesman Problem (MTSP) Capacitated Vehicle Routing (CVRP) are models have been extensively researched In its development based on actual events real world, some priorities must be visited first optimizing Several studies MTSP CVRP c...

In this paper we construct a new interactive identification scheme based on the conjugacy problem. We prove that this scheme is secure against passive attacks if the matching triple search problem (MTSP) is intractable. Our proof is based on the fact that the conjugacy search problem (CSP) is hard in braid group, on the other hand, the conjugacy decision problem (CDP) is easy in braid group by ...

In view of the difficulties fruit cluster identification, specific harvesting sequence constraints aggregated fruits, and balanced task assignment for multiple arms with a series-increasing symmetric shared (SISS) region, this paper proposes multi-objective optimization algorithm, which combines genetic algorithm (GA) ant colony (ACO) stepwise, to optimize multiarm cooperative trajectory straw-...

We consider a set of transmitter-receiver pairs, or links, that share a wireless medium, and address the problem of emptying backlogged queues with given initial size at the transmitters in minimum time. The minimum-time scheduling problem (MTSP) amounts to determining activation subsets of links, and their time durations, to form a minimum-time schedule. This scheduling problem has been studie...

In this paper, we study mobile element (ME)-based data-gathering schemes in wireless sensor networks. Due to the physical speed limits of mobile elements, the existing data-gathering schemes that use mobile elements can suffer from high data-gathering latency. In order to address this problem, this paper proposes a new hierarchical and cooperative data-gathering (HiCoDG) scheme that enables mul...

The Vehicle Routing Problem (VRP) is a complex combinatorial optimization problem that can be described as follows: given a fleet of vehicles with uniform capacity, a common depot, and several costumer demands; find the set of routes with overall minimum route cost which service all the demands. The multiple traveling salesman problem (mTSP) is a generalization of the well-known traveling sales...

Multiple traveling salesperson problems (mTSP) are a collection of that generalize the classical problem (TSP). In nutshell, an mTSP variant seeks minimum cost m paths visit all vertices given weighted complete graph. This paper introduces novel compact integer programs for depot-free (DFmTSP). fundamental models real scenarios where depots unknown or unnecessary. The proposed adapted to main v...