3 research outputs found

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

    Get PDF
    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

    Crossover vs. Mutation: A Comparative Analysis of the Evolutionary Strategy of Genetic Algorithms Applied to Combinatorial Optimization Problems

    Get PDF
    Since their first formulation, genetic algorithms (GA) have been one of the most widely used techniques to solve combinatorial optimization problems. The basic structure of the GA is known by the scientific community, and thanks to their easy application and good performance, GAs are the focus of a lot of research works annually. Although throughout history there have been many studies analyzing various concepts of GAs, in the literature there are few studies that analyze objectively the influence of using blind crossover operators for combinatorial optimization problems. For this reason, in this paper a deep study on the influence of using them is conducted. The study is based on a comparison of nine techniques applied to four well-known combinatorial optimization problems. Six of the techniques are GAs with different configurations, and the remaining three are evolutionary algorithms that focus exclusively on the mutation process. Finally, to perform a reliable comparison of these results, a statistical study of them is made, performing the normal distribution z-test
    corecore