Good practice proposal for the implementation, presentation, and comparison of metaheuristics for solving routing problems

Researchers who investigate in any area related to computational algorithms (both defining new algorithms or improving existing ones) usually find large difficulties to test their work. Comparisons among different researches in this field are often a hard task, due to the ambiguity or lack of detail...

Full description

Saved in:
Bibliographic Details
Published in:Neurocomputing (Amsterdam) 2018-01, Vol.271, p.2-8
Main Authors: Osaba, E., Carballedo, R., Diaz, F., Onieva, E., Masegosa, A.D., Perallos, A.
Format: Article
Language:English
Subjects:
Combinatorial optimization
Good practice proposal
Metaheuristics
Routing problems
Traveling salesman problem
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Researchers who investigate in any area related to computational algorithms (both defining new algorithms or improving existing ones) usually find large difficulties to test their work. Comparisons among different researches in this field are often a hard task, due to the ambiguity or lack of detail in the presentation of the work and its results. On many occasions, the replication of the work conducted by other researchers is required, which leads to a waste of time and a delay in the research advances. The authors of this study propose a procedure to introduce new techniques and their results in the field of routing problems. In this paper, this procedure is detailed, and a set of good practices to follow are deeply described. It is noteworthy that this procedure can be applied to any combinatorial optimization problem. Anyway, the literature of this study is focused on routing problems. This field has been chosen because of its importance in real world, and its relevance in the actual literature.
ISSN:0925-2312
1872-8286
DOI:10.1016/j.neucom.2016.11.098