We consider a variation of the well-known traveling salesman problem in which there are multiple agents who all have to tour whole set nodes same graph, while obeying node- and edge-capacity constraints require that must not crash. simplest model input is an undirected graph with capacities equal one. A solution synchronized called agency. Our puts similar relation as so-called evacuation probl...

The Multiple Traveling Salesman Problem (MTSP) is considered as an NP-complete problem due to the difficulty of finding shortest tour between different cities with a set constraints such visiting each city once by one salesman. solution represents sum all tours' costs performed n salesmen. In this research, we propose novel approach find solutions for various instances MTSP based on memetic alg...

In this paper, an improved self-organizing map approach to solving the traveling salesman problem is proposed by fixing the number of nodes in the output layer of neural network, modifying the neighhorhood function, and modifying the weight update rules. An overview of previous work on solving the traveling salesman problem is given. An extension of the prcposed algorithm can also be used to so...

This paper deals with the routing problem of health care sta in a home health care problem. Given a list of patients needing several cares, the problem is to assign cares to care workers. Some cares have to be performed by several persons and some cares cannot be performed with others. If a patient needs several cares, he may want to be treated by the same person. Moreover, some skills constrai...

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....

The double traveling salesman problem with multiple stacks is a variant of the pickup and delivery traveling salesman problem in which all pickups must be completed before any of the deliveries. In addition, items can be loaded on multiple stacks in the vehicle and each stack must obey the last-in-first-out policy. The problem consists in finding the shortest Hamiltonian cycles covering all pic...

Drone delivery is drawing increasing attention in last-mile delivery. Effective solution methods to solve decision-making problems arising drone allow run and assess systems. In this paper, we focus on systems with a single traditional vehicle multiple drones working tandem fulfill customer requests. We address the Traveling Salesman Problem Multiple Drones (TSP-MD) investigate modeling challen...