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

Abstract

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.

Combination of Data-Driven Active Disturbance Rejection and Takagi-Sugeno Fuzzy Control with Experimental Validation on Tower Crane Systems

“…Future work will be focused on the combination of different data-driven techniques with other fuzzy logic techniques [61][62][63][64][65][66][67] targeting experimental validation on different nonlinear laboratory equipment and real-world applications including large-scale systems [61], robotics and autonomous systems [68][69][70][71][72], medicine [73][74][75], engines [76] and combining with fault diagnosis and optimization [77][78][79][80][81][82].…”

Smart Bandwidth Assignation in an Underlay Cellular Network for Internet of Vehicles

“…As can be read in some studies of the literature [ 38 ], something important when any algorithm is developed, or operator, is the codification used to represent the partial, or complete solutions of the problem. For this reason, the codification chosen has to be clearly described, since depending on the representation used, some operators can be developed or not.…”

Adaptive Sequential Constructive Crossover Operator in a Genetic Algorithm for Solving the Traveling Salesman Problem

“…However, the traditional crossover operators such as one-point, two-point, and uniform crossover operators are not suitable for the TSP. Two kinds of crossover operators have been developed for the TSPdistance-based and blind crossover operators [18]. We consider some of them from both kinds and compare our proposed crossover operator with them.…”

“…Among the above discussed crossover operators GX, SCX and BCSCX are called distance-based crossover operators because they care about the distance between nodes. On the other hand, crossover operators like PMX, OX, AEX, CX, GNX and ERX are called blind crossover operators because they only concern about to satisfy the constraints of the problem and do not use any information associated with the problem [18]. We propose to compare our proposed ASCX against both kind of crossover operators.…”

“…As suggested in [18] if the performance of the distancebased crossover is compared with blind crossovers, the comparison is not going to be as fair as it should be. So, we consider both types of crossover operators.…”