Estimating the Tour Length for the Close Enough Traveling Salesman Problem
We construct empirically based regression models for estimating the tour length in the Close Enough Traveling Salesman Problem (CETSP). In the CETSP, a customer is considered visited when the salesman visits any point in the customer’s service region. We build our models using as many as 14 independ...
Main Authors: | Debdatta Sinha Roy, Bruce Golden, Xingyin Wang, Edward Wasil |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2021-04-01
|
Series: | Algorithms |
Subjects: | |
Online Access: | https://www.mdpi.com/1999-4893/14/4/123 |
Similar Items
-
A Tour Construction Framework for the Travelling Salesman Problem
by: Ahrens, Barry
Published: (2012) -
Traveling salesman problem in the function of freight transport optimization
by: Georgii Prokudin, et al.
Published: (2018-04-01) -
On the solution of traveling salesman problems under conditions of sparseness
by: Bau, Norman Jon
Published: (2008) -
Variants of the Traveling Salesman Problem
by: Patterson Mike, et al.
Published: (2019-04-01) -
Variants of the Traveling Salesman Problem
by: Friesen, D., et al.
Published: (2019)