No label defined (Q3770307)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4029299
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4029299 |
Statements
1987
0 references
0.8459765911102295
0 references
0.8078062534332275
0 references
0.7939249873161316
0 references
[For the entire collection see Zbl 0608.00016.] Posed in simple terms, the multiple travelling salesman problem (m-TSP) consists of determining m routes from a central depot to a set of geographically scattered cities in such a way that (i) all m routes start and end at the depot (city 1); (ii) every other city is visited exactly once; (iii) the total distance travelled is minimized. The algorithm presented in this paper tackles the m-TSP directly. It applies to several types of asymmetrical problems: m can be either fixed, free or bounded.
0 references