A matheuristic approach for the family traveling salesman problem
A matheuristic approach for the family traveling salesman problem
About this item
Full title
Author / Creator
Publisher
New York, NY: Springer US
Journal title
Language
English
Formats
Publication information
Publisher
New York, NY: Springer US
Subjects
More information
Scope and Contents
Contents
In the family traveling salesman problem (FTSP), there is a set of cities which are divided into a number of clusters called families. The salesman has to find a shortest possible tour visiting a specific number of cities from each of the families without any restriction of visiting one family before starting the visit of another one. In this work,...
Alternative Titles
Full title
A matheuristic approach for the family traveling salesman problem
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_journals_2882791800
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_2882791800
Other Identifiers
ISSN
1572-9397,1381-1231
E-ISSN
1572-9397
DOI
10.1007/s10732-023-09516-9
