Algorithms, pseudo-codes, implementations – some reflections on interdependencies and potential implications

Q2 Mathematics

Electronic Notes in Discrete Mathematics Pub Date : 2018-08-01 DOI:10.1016/j.endm.2018.07.006

Martin Josef Geiger

{"title":"Algorithms, pseudo-codes, implementations – some reflections on interdependencies and potential implications","authors":"Martin Josef Geiger","doi":"10.1016/j.endm.2018.07.006","DOIUrl":null,"url":null,"abstract":"<div><p>The article investigates different implementations of a Variable Neighborhood Search approach for the Capacitated Vehicle Routing Problem. An important goal of the work presented here is to obtain an understanding of the potential effects of implementation details on the observed performance of the algorithm.</p><p>Our work is motivated by our experiences in implementation competitions, in which best-possible algorithms to hard optimization problems must be devised and delivered. In those contexts, we may ask: what determines the success of an algorithm, (i) some key algorithmic ingredient, (ii) coding details, or (iii) other aspects? Here, we try analysing (ii) and (iii). Overall, we are able to identify some important details that are often neglected in scientific articles. Moreover, and in order to allow anyone to re-produce our findings, we make the source-code of our implementation available online with this article [Martin Josef Geiger. Different implementations of a metaheuristic for the capacitated vehicle routing problem. Mendeley Data, 2018. <span>https://dx.doi.org/10.17632/s4h89j4tgp.2</span><svg><path></path></svg>].</p></div>","PeriodicalId":35408,"journal":{"name":"Electronic Notes in Discrete Mathematics","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.endm.2018.07.006","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronic Notes in Discrete Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1571065318301501","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"Mathematics","Score":null,"Total":0}

引用次数: 0

Abstract

The article investigates different implementations of a Variable Neighborhood Search approach for the Capacitated Vehicle Routing Problem. An important goal of the work presented here is to obtain an understanding of the potential effects of implementation details on the observed performance of the algorithm.

Our work is motivated by our experiences in implementation competitions, in which best-possible algorithms to hard optimization problems must be devised and delivered. In those contexts, we may ask: what determines the success of an algorithm, (i) some key algorithmic ingredient, (ii) coding details, or (iii) other aspects? Here, we try analysing (ii) and (iii). Overall, we are able to identify some important details that are often neglected in scientific articles. Moreover, and in order to allow anyone to re-produce our findings, we make the source-code of our implementation available online with this article [Martin Josef Geiger. Different implementations of a metaheuristic for the capacitated vehicle routing problem. Mendeley Data, 2018. https://dx.doi.org/10.17632/s4h89j4tgp.2].

查看原文本刊更多论文

算法、伪代码、实现——对相互依赖和潜在影响的一些反思

本文研究了有能力车辆路径问题的可变邻域搜索方法的不同实现。这里提出的工作的一个重要目标是了解实现细节对观察到的算法性能的潜在影响。我们的工作动力来自于我们在实现竞赛中的经验，在竞赛中，必须设计和交付解决困难优化问题的最佳算法。在这种情况下，我们可能会问:是什么决定了算法的成功，(i)一些关键的算法成分，(ii)编码细节，或(iii)其他方面?在这里，我们尝试分析(ii)和(iii)。总的来说，我们能够确定一些在科学文章中经常被忽视的重要细节。此外，为了允许任何人复制我们的发现，我们在本文[Martin Josef Geiger]中提供了我们实现的源代码。有能力车辆路径问题的一种元启发式的不同实现。Mendeley数据，2018。https://dx.doi.org/10.17632/s4h89j4tgp.2]。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Electronic Notes in Discrete Mathematics Mathematics-Discrete Mathematics and Combinatorics

CiteScore

1.30

自引率

0.00%

发文量

期刊介绍： Electronic Notes in Discrete Mathematics is a venue for the rapid electronic publication of the proceedings of conferences, of lecture notes, monographs and other similar material for which quick publication is appropriate. Organizers of conferences whose proceedings appear in Electronic Notes in Discrete Mathematics, and authors of other material appearing as a volume in the series are allowed to make hard copies of the relevant volume for limited distribution. For example, conference proceedings may be distributed to participants at the meeting, and lecture notes can be distributed to those taking a course based on the material in the volume.