American University
Browse

Estimating the tour length for the close enough traveling salesman problem

Download (295 kB)
journal contribution
posted on 2023-08-05, 13:14 authored by Debdatta Sinha Roy, Bruce Golden, Xingyin Wang, Edward WasilEdward Wasil

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 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.

History

Publisher

Algorithms

Notes

Algorithms, Volume 14, Issue 4, 2021 Article number 123.

Handle

http://hdl.handle.net/1961/auislandora:95303

Usage metrics

    Information Technology & Analytics

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC