Researchers who investigate in any area related to computational algorithms (both
dening new algorithms or improving existing ones) usually nd large diculties to test
their work. Comparisons among dierent researches in this eld 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 eld 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 eld has been chosen because of its importance in real world,
and its relevance in the actual literature
