1. DataSTORRE
  2. University of Stirling
  3. University of Stirling Research Data
Please use this identifier to cite or link to this item: http://hdl.handle.net/11667/91
Full metadata record
DC FieldValueLanguage
dc.contributorVeerapen, Nadarajen-
dc.contributor.otherLeverhulme Trusten_GB
dc.creatorVeerapen, Nadarajen-
dc.creatorOchoa, Gabriela-
dc.date.accessioned2017-05-25T12:58:11Z-
dc.date.available2017-05-25T12:58:11Z-
dc.date.created2016-06-
dc.identifier.urihttp://hdl.handle.net/11667/91-
dc.description.abstractThe dataset contains landscape data for "Mapping the global structure of TSP fitness landscapes", G. Ochoa, N. Veerapen, Journal of Heuristics, 2017. The dataset describes the network structure of the local optima networks for Traveling Salesman Problem instances that are sampled using Chained Lin-Kernighan. Dedicated UnZip software is recommended for accessing the dataset, for example, IZArc.en_GB
dc.description.tableofcontentsThe dataset contains landscape data for "Mapping the global structure of TSP fitness landscapes", G. Ochoa, N. Veerapen, Journal of Heuristics, 2017. The dataset describes the network structure of the local optima networks for Traveling Salesman Problem instances that are sampled using Chained Lin-Kernighan. TSPLIB.zip contains networks from the TSPLIB instances (http://comopt.ifi.uni-heidelberg.de/software/TSPLIB95/) that are used in the paper. DIMACSclustered.zip and DIMACSuniform.zip contain networks for instances generated using the DIMACS TSP instance generator (http://dimacs.rutgers.edu/Challenges/TSP/download.html). See README.txt for details on how the networks are represented.en_GB
dc.publisherUniversity of Stirling. Faculty of Natural Sciences.en_GB
dc.relationVeerapen, N; Ochoa, G (2017): Data from "Mapping the global structure of TSP fitness landscapes". University of Stirling. Faculty of Natural Sciences. Dataset. http://hdl.handle.net/11667/91en_GB
dc.relation.isreferencedbyOchoa, G. and Veerapen, N. (2018) Mapping the global structure of TSP fitness landscapes, Journal of Heuristics, 24 (3), pp. 265-294. DOI: https://doi.org/10.1007/s10732-017-9334-0 Available from: http://hdl.handle.net/1893/25413en_GB
dc.rightsRights covered by the standard CC-BY 4.0 licence: https://creativecommons.org/licenses/by/4.0/en_GB
dc.subjectLocal Optima Networken_GB
dc.subjectTraveling Salesman Problemen_GB
dc.subjectFitness Landscapeen_GB
dc.subjectLocal Searchen_GB
dc.subject.classification::Information and communication technologies::Artificial Intelligence Technologies::Meta Heuristicsen_GB
dc.subject.classification::Information and communication technologies::Artificial Intelligence Technologies::Optimisation (AI)en_GB
dc.titleData from "Mapping the global structure of TSP fitness landscapes"en_GB
dc.typedataseten_GB
dc.contributor.emailnve@cs.stir.ac.uken_GB
dc.identifier.projectidRPG-2015-395en_GB
dc.title.projectThe Cartography of Computational Search Spacesen_GB
dc.contributor.affiliationUniversity of Stirling (Computing Science - CSM Dept)en_GB
dc.date.publicationyear2017en_GB
dc.identifier.wtid418227-
Appears in Collections:University of Stirling Research Data

Files in This Item:
File Description SizeFormat 
TSPLIB.zipcontains networks from the TSPLIB instances (http://comopt.ifi.uni-heidelberg.de/software/TSPLIB95/) that are used in the paper636.29 MBUnknownView/Open
DIMACSclustered.zipcontains networks for instances generated using the DIMACS TSP instance generator (http://dimacs.rutgers.edu/Challenges/TSP/download.html)162.77 MBUnknownView/Open
DIMACSuniform.zipcontains networks for instances generated using the DIMACS TSP instance generator (http://dimacs.rutgers.edu/Challenges/TSP/download.html)178.69 MBUnknownView/Open
README.txt3.82 kBTextView/Open


This item is protected by original copyright

View Licence
Show simple item record Recommend this item


Items in DataSTORRE are protected by copyright, with all rights reserved, unless otherwise indicated.