# Which Local Search Operator Works Best for the Open-Loop TSP?
## 3 Performance of a Single Operator
### Search Strategy
We conclude that the local search is sufficient for our application where the optimum result is needed in real-time, and the occasional sub-optimal result can be tolerated. The limitation of the new operator, link swap, is that it is suitable only for the open-loop case and does not apply to TSPLIB instances. Therefore, only 2-opt and relocate can be used for these instances. Without link swap, relocate also becomes weaker in the mixing algorithm, which might weaken the result. Conceptualization, P.F., R.M.-I., and L.S. ; methodology, L.S., R.M.-I. ; writing--original draft preparation, L.S. ; writing--review and editing, P.F and R.M.-I. ; supervision, P.F. This research received no external funding

The authors declare no conflict of interest. ## References

* [PERSON] (1979) [PERSON]; [PERSON] _Computers and Intractability: A Guide to the Theory of Np-Completeness_; W.H. Freeman & Co.: New York, NY, USA, 1979; ISBN 0716710455. * [PERSON] (1977) [PERSON] The Euclidean travelling salesman problem is NP-complete. _Theor. Comput. Sci._**1977**, 4, 237-244. [CrossRef]
* [PERSON] et al. (2017) [PERSON]; [PERSON]; [PERSON] O-Mopsi: Mobile Orienteering Game for Sightseeing, Exercising, and Education. _ACM Trans. Multimed. Comput. Commun. Appl._**2017**, 13, 56. [CrossRef]
* [PERSON] et al. (2011) [PERSON]; [PERSON]; [PERSON] The orienteering problem: A survey. _Eur. J. Oper. Res._**2011**, _209_, 1-10. [CrossRef]
* [PERSON] and [PERSON] (2014) [PERSON]; [PERSON] A Performance Comparison of Genetic Algorithm's Mutation Operators in n-Cities Open Loop Travelling Salesman Problem. In _Recent Advances on Soft Computing and Data Mining. Advances in Intelligent Systems and Computing_; [PERSON], [PERSON], [PERSON], Eds. ; Springer: Berlin/Heidelberg, Germany, 2014; Volume 287. \begin{table}
\begin{tabular}{c c c c c c c} \hline \hline
**Results** & \multicolumn{2}{c}{**Random mix**} & \multicolumn{2}{c}{**Tabu**} & \multicolumn{2}{c}{**SA**} \\ \hline  & Gap & Time & Gap & Time & Gap & Time \\ O–Mopsi & 0\% & \textless{}1 s & 0\% & 1.3 s & 0 \% & \textless{}1 s \\ Dots & 0.001\% & \textless{}1 s & 0.0003\% & 1.3 s & 0.007\% & \textless{}1 s \\ \hline \hline \end{tabular}
\end{table} 
Table 5: Summary of overall results (mean). * _[PERSON] et al. (2014)_ [PERSON]; [PERSON]; [PERSON]; [PERSON] A survey on algorithmic approaches for solving tourist trip design problems. _J. Heuristics_**2014**, _20_, 291-328. [CrossRef]
* _[PERSON] et al. (1987)_ [PERSON]; [PERSON]; [PERSON] The Orienteering Problem. _Nux. Res. Logist._**1987**, _34_, 307-318. [CrossRef]
* _[PERSON] et al. (2014)_ [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] Automated Map Generation for the Physical Traveling Salesman Problem. _IEEE Trans. Evol. Comput._**2014**, _18_, 708-720. [CrossRef]
* _[PERSON] et al. (2018)_ [PERSON]; [PERSON]; [PERSON] Planning your route: Where to start? _Comput. Brain Behav._**2018**, \(1\), 252-265. [CrossRef]
* _[PERSON] and [PERSON] (2019)_ [PERSON]; [PERSON] Predicting difficulty of TSP instances using MST. In Proceedings of the IEEE International Conference on Industrial Informatics (INDIN), Helsinki, Finland, June 2019; pp. 848-852. * _[PERSON] et al. (1954)_ [PERSON]; [PERSON]; [PERSON] _Solution of a Large Scale Traveling Salesman Problem_; Technical Report P-510; RAND Corporation: Santa Monica, CA, USA, 1954. * [PERSON] (1971) [PERSON]; [PERSON] The traveling salesman problem and minimum spanning trees: Part II. _Math. Program._**1971**, \(1\), 6-25. [CrossRef]
* [PERSON] (1991) [PERSON]; [PERSON] A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. _SIAM Rev._**1991**, _33_, 60-100. [CrossRef]
* _[PERSON] (1991)_ [PERSON]; [PERSON] Solution of large-scale symmetric travelling salesman problems. _Math. Program._**1991**, _51_, 141-202. [CrossRef]
* _[PERSON] et al. (1988)_ [PERSON]; [PERSON]; [PERSON] On the solution of traveling salesman problems. Documenta Mathematica Journal der Deutschen Mathematiker-Vereinigung. _Int. Congr. Math._**1988**, _Extra Volume III_, 645-656.