Please use this identifier to cite or link to this item:
http://hdl.handle.net/11667/75
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor | Veerapen, Nadarajen | - |
dc.contributor.other | EPSRC - Engineering and Physical Sciences Research Council | en_GB |
dc.contributor.other | Leverhulme Trust | en_GB |
dc.creator | Veerapen, Nadarajen | - |
dc.creator | Ochoa, Gabriela | - |
dc.creator | Tinos, Renato | - |
dc.creator | Whitley, L Darrell | - |
dc.date.accessioned | 2016-06-13T12:11:39Z | - |
dc.date.available | 2016-06-13T12:11:39Z | - |
dc.date.created | 2016 | - |
dc.identifier.uri | http://hdl.handle.net/11667/75 | - |
dc.description.abstract | The dataset contains landscape data for "Tunnelling Crossover Networks for the Asymmetric TSP", N. Veerapen, G. Ochoa, R. Tinós, D. Whitley, The 14th International Conference on Parallel Problem Solving from Nature, PPSN2016, 17-21 September 2016, Edinburgh, Scotland. The dataset describes the network structure of the local optima networks for the 25 Asymmetric Traveling Salesman Problem instances that are sampled in the paper according to two different methodologies: using an evolutionary algorithm based on the Generalized Partition Crossover, and using Chained Lin-Kernighan. | en_GB |
dc.description.tableofcontents | The dataset contains landscape data for "Tunnelling Crossover Networks for the Asymmetric TSP", N. Veerapen, G. Ochoa, R. Tinós, D. Whitley, The 14th International Conference on Parallel Problem Solving from Nature, PPSN2016, 17-21 September 2016, Edinburgh, Scotland. The dataset describes the network structure of the local optima networks for the 25 Asymmetric Traveling Salesman Problem instances that are sampled in the paper according to two different methodologies: using an evolutionary algorithm based on the Generalized Partition Crossover, and using Chained Lin-Kernighan. The data are organised into three zip files, one for each method and one for generated instances. These instances (C50.0, C100.0, C200.0, E50.0, E100.0, and E200.0) were generated using the DIMACS TSP instance generator (http://dimacs.rutgers.edu/Challenges/TSP/download.html) and the distance matrices were perturbed to obtained asymmetric instances. The rest of the instances are from TSPLIB (http://comopt.ifi.uni-heidelberg.de/software/TSPLIB95/). Additional details are provided in the readme.txt file. | en_GB |
dc.publisher | University of Stirling. Faculty of Natural Sciences. | en_GB |
dc.relation | Veerapen, N; Ochoa, G; Tinos, R; Whitley, LD (2016): Data from ''Tunnelling Crossover Networks for the Asymmetric TSP". University of Stirling. Faculty of Natural Sciences. Dataset. http://hdl.handle.net/11667/75 | en_GB |
dc.relation.isreferencedby | Veerapen N., Ochoa G., Tinós R. and Whitley, D. (2016) Tunnelling Crossover Networks for the Asymmetric TSP In: Handl J, Hart E, Lewis PR, Lopez-Ibanez M, Ochoa G, Paechter B (ed.) Parallel Problem Solving from Nature – PPSN XIV: 14th International Conference, Edinburgh, UK, September 17-21, 2016, Proceedings, Cham, Switzerland: Springer. PPSN2016 - 14th International Conference on Parallel Problem Solving from Nature, 17.9.2016 - 21.9.2016, Edinburgh, pp. 994-1003. DOI: https://doi.org/10.1007/978-3-319-45823-6_93 Available at: http://hdl.handle.net/1893/24061 | en_GB |
dc.rights | Rights covered by the standard CC-BY 4.0 licence: https://creativecommons.org/licenses/by/4.0/ | en_GB |
dc.subject | Local Optima Network | en_GB |
dc.subject | Asymmetric Traveling Salesman Problem | en_GB |
dc.subject | Fitness Landscape | en_GB |
dc.subject | Local Search | en_GB |
dc.subject | Genetic Algorithm | en_GB |
dc.subject.classification | ::Information and communication technologies::Artificial Intelligence Technologies::Computational Search | en_GB |
dc.subject.classification | ::Information and communication technologies::Artificial Intelligence Technologies::Meta Heuristics | en_GB |
dc.subject.classification | ::Information and communication technologies::Artificial Intelligence Technologies::Optimisation (AI) | en_GB |
dc.title | Data from ''Tunnelling Crossover Networks for the Asymmetric TSP" | en_GB |
dc.type | dataset | en_GB |
dc.contributor.email | nve@cs.stir.ac.uk | en_GB |
dc.identifier.projectid | RPG-2015-395 | en_GB |
dc.identifier.projectid | EP/J017515/1 | en_GB |
dc.title.project | The Cartography of Computational search spaces | en_GB |
dc.title.project | DAASE: Dynamic Adaptive Automated Software Engineering | en_GB |
dc.contributor.affiliation | University of Stirling (Computing Science - CSM Dept) | en_GB |
dc.contributor.affiliation | University of Sao Paulo | en_GB |
dc.contributor.affiliation | Colorado State University | en_GB |
dc.date.publicationyear | 2016 | en_GB |
dc.identifier.wtid | 415580 | - |
dc.identifier.wtid | 418227 | - |
Appears in Collections: | University of Stirling Research Data |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
gapx.zip | Networks generated with the GAPX-based GA | 1.44 GB | Unknown | View/Open |
gen_instances.zip | Generated Instances | 681.85 kB | Unknown | View/Open |
clk.zip | Networks generated with Chained Lin-Kernighan | 366.57 MB | Unknown | View/Open |
readme.txt | Description of file organisation, names and structure | 5.93 kB | Text | View/Open |
This item is protected by original copyright |
Items in DataSTORRE are protected by copyright, with all rights reserved, unless otherwise indicated.