Dataset Open Access

# Results of Bet-and-Run Strategies with Different Decision Makers on the Traveling Salesman Problem and the Minimum Vertex Cover Problem

Weise, Thomas; Wagner, Markus

### JSON-LD (schema.org) Export

{
"description": "<p><em><strong>Results of Bet-and-Run Strategies with Different Decision Makers on the Traveling Salesman Problem and the Minimum Vertex Cover Problem</strong></em></p>\n\n<p><strong>1. Introduction</strong></p>\n\n<p>In this repository, we provide the implementation and results of an improved generic Bet-and-Run strategy for black-box optimization.<br>\nThe goal our new Bet-and-Run method&nbsp;is to obtain the best possible results within a given time budget <em>T</em>&nbsp;using a given black-box optimization algorithm.<br>\nIf no prior knowledge about problem features and algorithm behavior is available, the question about how to use the time budget most efficiently arises. We propose to first start <em>n&gt;=1</em>&nbsp;independent runs of the algorithm during an initialization budget <em>T1&lt;T</em>,&nbsp;pausing these runs, then apply a decision maker <em>D</em>&nbsp;to choose <em>1&lt;=m&lt;n</em>&nbsp;runs from them (consuming <em>T2&gt;=0</em>&nbsp;time units in doing so), and then continuing these runs for the remaining <em>T3=T-T1-T2</em>&nbsp;time units.</p>\n\n<p>In previous bet-and-run strategies, the decision maker <em>currentBest</em>&nbsp;would simply select the run with the best-so-far results at negligible time.<br>\nWe propose using more advanced methods and test several different approaches, including neural networks trained or polynomials fitted on the current trace of the algorithm to predict which run may yield the best results if granted the remaining budget.<br>\nApplying this implementation to run &quot;virtual experiments,&quot; one can find that this approach can yield better results than the previous methods, but also find that the currentBest method is a very reliable and robust baseline approach.</p>\n\n<p>Here you can find the results of such experiments on the Traveling Salesman Problem and the Minimum Vertex Cover Problem. Both&nbsp;betAndRun_tsp.tar.xz&nbsp;&nbsp;and&nbsp;betAndRun_vertex_cover.tar.xz are extracted in the scale of 30 GiB of size.</p>\n\n<p><strong>2. Copyright</strong></p>\n\n<p>The source code in this&nbsp;repository is under MIT License and is published in the most recent version at http://github.com/thomasWeise/betAndRun, while the results are under the Creative Commons Attribution 4.0 License.</p>\n\n<p>The code on bet-and-run (mainly under cn.edu.hfuu.iao.betAndRun) is jointly developed by Dr. Thomas Weise (http://iao.hfuu.edu.cn), tweise@hfuu.edu.cn, tweise@gmx.de) and Dr. Markus Wagner (http://cs.adelaide.edu.au/~markus/, markus.wagner@adelaide.edu.au).</p>\n\n<p>The <em>jpack</em> (http://github.com/marmakoide/jpack) code for Artificial Neural Networks, Linear Algebra, and Evolution Strategies (e.g., CMA-ES) has originally been developed by Dr. Alexandre Devert (http://www.marmakoide.org, marmakoide@hotmail.fr, and http://github.com/marmakoide), who kindly granted us the permission to include it in our repository. The code published here is a slightly modified version of his code, but the copyright and authorship remains entirely with Dr. Devert, who provides it under the MIT license at GitHub under http://github.com/marmakoide/jpack. Please contact Dr. Devert for any questions, in particular regarding licensing and (re-)distribution.</p>",
"creator": [
{
"affiliation": "Institute of Applied Optimization, Hefei University",
"@type": "Person",
"name": "Weise, Thomas"
},
{
"affiliation": "School of Computer Science, University of Adelaide",
"@type": "Person",
"name": "Wagner, Markus"
}
],
"hasPart": [
{
"@id": "http://github.com/thomasWeise/betAndRun",
"@type": "CreativeWork"
}
],
"datePublished": "2018-05-27",
"url": "https://zenodo.org/record/1253770",
"keywords": [
"Optimization",
"Bet-and-Run",
"Local Search",
"Neural Networks",
"Traveling Salesman Problem",
"TSP",
"Minimum Vertex Cover Problem",
"Regression"
],
"@context": "https://schema.org/",
"distribution": [
{
"contentUrl": "https://zenodo.org/api/files/66eef8c8-3faa-41ce-afd3-20467758c1b5/betAndRun-0.8.0-source.tar.xz",
"encodingFormat": "xz",
},
{
"contentUrl": "https://zenodo.org/api/files/66eef8c8-3faa-41ce-afd3-20467758c1b5/betAndRun_tsp.tar.xz",
"encodingFormat": "xz",
},
{
"contentUrl": "https://zenodo.org/api/files/66eef8c8-3faa-41ce-afd3-20467758c1b5/betAndRun_vertex_cover.tar.xz",
"encodingFormat": "xz",
}
],
"identifier": "https://doi.org/10.5281/zenodo.1253770",
"@id": "https://doi.org/10.5281/zenodo.1253770",
"@type": "Dataset",
"name": "Results of Bet-and-Run Strategies with Different Decision Makers on the Traveling Salesman Problem and the Minimum Vertex Cover Problem"
}
160
30
views
All versions This version
Views 160158
Data volume 49.8 GB49.8 GB
Unique views 154152