Decision, Operations & Information Technologies Research Works
Permanent URI for this collection
Browse
Browsing Decision, Operations & Information Technologies Research Works by Subject "close enough traveling salesman problem"
Now showing 1 - 1 of 1
Results Per Page
Sort Options
Item Estimating the Tour Length for the Close Enough Traveling Salesman Problem(MDPI, 2021-04-12) Roy, Debdatta Sinha; Golden, Bruce; Wang, Xingyin; Wasil, EdwardWe 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 independent variables on a set of 780 benchmark instances of the CETSP and compare the estimated tour lengths to the results from a Steiner zone heuristic. We validate our results on a new set of 234 instances that are similar to the 780 benchmark instances. We also generate results for a new set of 72 larger instances. Overall, our models fit the data well and do a very good job of estimating the tour length. In addition, we show that our modeling approach can be used to accurately estimate the optimal tour lengths for the CETSP.