On the neutrality of two symmetric TSP solvers toward instance specification
Currently, many computationally difficult problems can be solved using very efficient methods. Some of these state-of-the-art methods have online implementations. The research question addressed herein is how sensitive are such implementations if the input data are preprocessed in a specific manner? The symmetric traveling salesman problem (sTSP), which is an NP-hard problem with many real-life applications is studied. The proposed method includes systematic transformation using rotations and reflections of the vertex order of sTSP instances. This model was used for investigating the neutrality of Concorde [1] (currently the best exact sTSP solver) and Lin–Kernighan implementation [2], both from NEOS [3] (the state-ofthe-art collection of online tools in computational optimization).
A teljes cikk innen tölthető le.
Hivatkozás
MLA: Crişan, Gloria Cerasela, László Barna Iantovics, and László Kovács. "On the neutrality of two symmetric TSP solvers toward instance specification." Science China Information Sciences 62 (2019): 1-3.
APA: Crişan, G. C., Iantovics, L. B., & Kovács, L. (2019). On the neutrality of two symmetric TSP solvers toward instance specification. Science China Information Sciences, 62, 1-3.
ISO690: CRIŞAN, Gloria Cerasela; IANTOVICS, László Barna; KOVÁCS, László. On the neutrality of two symmetric TSP solvers toward instance specification. Science China Information Sciences, 2019, 62: 1-3.
BibTeX:
@article{cricsan2019neutrality,
title={On the neutrality of two symmetric TSP solvers toward instance specification},
author={Cri{c{s}}an, Gloria Cerasela and Iantovics, L{'a}szl{'o} Barna and Kov{'a}cs, L{'a}szl{'o}},
journal={Science China Information Sciences},
volume={62},
pages={1--3},
year={2019},
publisher={Science China Press}
}