STORRE
STORRE: Stirling Online Research Repository
Please use this identifier to cite or link to this item:
http://hdl.handle.net/1893/27952| Appears in Collections: | Computing Science and Mathematics Conference Papers and Proceedings |
| Peer Review Status: | Refereed |
| Author(s): | Verel, Sébastien Daolio, Fabio Ochoa, Gabriela Tomassini, M. |
| Title: | Sampling local optima networks of large combinatorial search spaces: The qap case |
| Editor(s): | Fonseca, CM Lourenco, N Machado, P Paquete, L Auger, A Whitley, D |
| Citation: | Verel S, Daolio F, Ochoa G & Tomassini M (2018) Sampling local optima networks of large combinatorial search spaces: The qap case. In: Lourenco N, Fonseca C, Machado P, Paquete L, Auger A & Whitley D (eds.) Parallel Problem Solving from Nature – PPSN XV. PPSN 2018. Lecture Notes in Computer Science, 11102. PPSN 2018: International Conference on Parallel Problem Solving from Nature, Coimbra, Portugal, 08.09.2018-12.09.2018. Cham, Switzerland: Springer Verlag, pp. 257-268. https://doi.org/10.1007/978-3-319-99259-4_21 |
| Issue Date: | 31-Dec-2018 |
| Date Deposited: | 11-Oct-2018 |
| Series/Report no.: | Lecture Notes in Computer Science, 11102 |
| Conference Name: | PPSN 2018: International Conference on Parallel Problem Solving from Nature |
| Conference Dates: | 2018-09-08 - 2018-09-12 |
| Conference Location: | Coimbra, Portugal |
| Abstract: | Local Optima Networks (LON) model combinatorial landscapes as graphs, where nodes are local optima and edges transitions among them according to given move operators. Modelling landscapes as networks brings a new rich set of metrics to characterize them. Most of the previous works on LONs fully enumerate the underlying landscapes to extract all local optima, which limits their use to small instances. This article proposes a sound sampling procedure to extract LONs of larger instances and estimate their metrics. The results obtained on two classes of Quadratic Assignment Problem (QAP) benchmark instances show that the method produces reliable results. |
| Status: | AM - Accepted Manuscript |
| Rights: | This is a post-peer-review, pre-copyedit version of a paper published in Fonseca C, Lourenco N, Machado P, Paquete L, Auger A & Whitley D (eds.) Parallel Problem Solving from Nature – PPSN XV. PPSN 2018. Lecture Notes in Computer Science, 11102. The final authenticated version is available online at: https://doi.org/10.1007/978-3-319-99259-4_21 |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| sampling-lons-2018.pdf | Fulltext - Accepted Version | 359.96 kB | Adobe PDF | View/Open |
This item is protected by original copyright |
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.