Statistical Analysis of the Performance of the State-of-the-Art Methods for Solving TSP Variants
Publication Name: Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics
Publication Date: 2019-01-01
Volume: 11909 LNAI
Issue: Unknown
Page Range: 255-262
Description:
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.
Open Access: Yes
