STORRE
STORRE: Stirling Online Research Repository
Please use this identifier to cite or link to this item:
http://hdl.handle.net/1893/34655| Appears in Collections: | Computing Science and Mathematics Conference Papers and Proceedings |
| Author(s): | Sleegers, Joeri Thomson, Sarah L Van Den Berg, Daan |
| Contact Email: | s.l.thomson@stir.ac.uk |
| Title: | Universally Hard Hamiltonian Cycle Problem Instances |
| Editor(s): | Bäck, Thomas van Stein, Bas Wagner, Christian Garibaldi, Jonathan Lam, H.K. Cottrell, Marie Doctor, Faiyaz Filipe, Joaquim Warwick, Kevin Kacprzyk, Janusz |
| Citation: | Sleegers J, Thomson SL & Van Den Berg D (2022) Universally Hard Hamiltonian Cycle Problem Instances. In: Bäck T, van Stein B, Wagner C, Garibaldi J, Lam H, Cottrell M, Doctor F, Filipe J, Warwick K & Kacprzyk J (eds.) <i>Proceedings of the 14th International Joint Conference on Computational Intelligence - ECTA</i>. ECTA 2022 : 14th International Conference on Evolutionary Computation Theory and Applications, Valletta, Malta, 24.10.2022-26.11.2022. SCITEPRESS – Science and Technology Publications, pp. 105-111. https://doi.org/10.5220/0011531900003332 |
| Issue Date: | 2022 |
| Date Deposited: | 3-Nov-2022 |
| Conference Name: | ECTA 2022 : 14th International Conference on Evolutionary Computation Theory and Applications |
| Conference Dates: | 2022-10-24 - 2022-11-26 |
| Conference Location: | Valletta, Malta |
| Abstract: | In 2021, evolutionary algorithms found the hardest-known yes and no instances for the Hamiltonian cycle problem. These instances, which show regularity patterns, require a very high number of recursions for the best exact backtracking algorithm (Vandegriend-Culberson), but don't show up in large randomized instance ensembles. In this paper, we will demonstrate that these evolutionarily found instances of the Hamiltonian cycle problem are hard for all major backtracking algorithms, not just the Vandegriend-Culberson. We compare performance of these six algorithms on an ensemble of 91,000 randomized instances plus the evolutionar-ily found instances. These results present a first glance at universal hardness for this NP-complete problem. Algorithms, source code, and input data are all publicly supplied to the community. |
| Status: | VoR - Version of Record |
| Rights: | This paper is licenced under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 Licence (CC BY-NC-ND - https://creativecommons.org/licenses/by-nc-nd/4.0/) |
| Licence URL(s): | http://creativecommons.org/licenses/by-nc-nd/4.0/ |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| 2022Sleegersetal-UniversallyHardHamiltonianCycleProblemInstances.pdf | Fulltext - Published Version | 949.89 kB | Adobe PDF | View/Open |
This item is protected by original copyright |
A file in this item is licensed under a Creative Commons License
Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
The metadata of the records in the Repository are available under the CC0 public domain dedication: No Rights Reserved https://creativecommons.org/publicdomain/zero/1.0/
If you believe that any material held in STORRE infringes copyright, please contact library@stir.ac.uk providing details and we will remove the Work from public display in STORRE and investigate your claim.