Sentence examples for multiple salesmen from inspiring English sources

The main aim of the method is that multiple salesmen have to travel the specified cities.

Two of the most well-studied routing problems are the traveling salesman problem (TSP) and the multiple traveling salesmen problem (MTSP).

The fixed destination multi-depot multiple traveling salesmen problem (MmTSP) is a problem, in which more than one salesmen depart from several starting cities and having returned to the starting city, form tours so that each city is visited with exactly one salesman, and the tour lengths stay within certain limits.

We introduce the Multiple Traveling Salesmen and Districting Problem with Multi-periods and Multi-depots.

We show that this problem can be considered as a multiple traveling salesmen problem (mTSP), where the distances between the products are based on the time or costs of the grade transitions.

In [5, 6], combination of improved GA and multiple travelling salesmen problem (MTSP) is proposed for the same context.

The approach adopted in this study was based on the classic multiple travelling salesmen problem algorithm [ 15 ].

A variant of the multiple travelling salesmen problem The trade-offs between continuity of care and travelling time require a reasonably efficient staff allocation and routing algorithm.

The multiple travelling salesmen problem considers the allocation of patients to staff selected from a team with the objective of minimising total travel time while considering the relative workloads.

patients with preferences satisfied× PS ) A variant of the multiple travelling salesmen problem The trade-offs between continuity of care and travelling time require a reasonably efficient staff allocation and routing algorithm.

This study examines the allocation and routing of midwives in the community using a variant of a multiple travelling salesmen problem algorithm incorporating staff preferences to explore trade-offs between travel time and continuity of care.