Resumen

ROMERO-OCANO, Alma Danisa et al. Effect of Parameters Tuned by a Taguchi Design L₉3⁴ in the GRASP Algorithm to Solve the Vehicle Routing Problem with Time Windows. Comp. y Sist. [online]. 2018, vol.22, n.2, pp.657-673.  Epub 21-Ene-2021. ISSN 2007-9737.  https://doi.org/10.13053/cys-22-2-2595.

Metaheuristic algorithms are black box procedures that analyze a subset of possible solutions to solve a problem or a set of instances. Before they are implemented, it is necessary to select an optimum parameter vector $P*$, a task known as tuning. The vector $P*$ affects the efficiency of metaheuristics in solving a given problem. In this paper, the impact of tuning parameters using the Taguchi $L_9{3}^4$ statistical procedure is analyzed. The effect of this method is analyzed in the metaheuristic algorithm named Greedy Randomized Adaptive Search Procedure (GRASP), solving the problem of Vehicle Routes with Time Windows (VRPTW). The results offered by the algorithm in a subset of instances of 25 clients improve on average to those reported in the literature, using a $P*$ proposed by Taguchi calibration.

Palabras llave : Tuning; Taguchi; metaheuristic; GRASP; VRPTW.