In this paper we analyze the efficiency of the state-of-the-art methods for solving two TSP variants, the Traveling Salesman Problem with Time Windows and one-commodity Pickup-and-Delivery Traveling Salesman Problem. Three models (polynomial, exponential, square-root exponential) were fitted to the mean run times of each method. The parameters of the curves, the R2-values and the RMSE values were compared.
CITATION STYLE
Tüű-Szabó, B., Földesi, P., & Kóczy, L. T. (2019). Statistical Analysis of the Performance of the State-of-the-Art Methods for Solving TSP Variants. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11909 LNAI, pp. 255–262). Springer. https://doi.org/10.1007/978-3-030-33709-4_23
Mendeley helps you to discover research relevant for your work.