Paper Info
Title
Effect Of Parameters Tuned By A Taguchi Design L(9)3(4) In The Grasp Algorithm To Solve The Vehicle Routing Problem With Time Windows
Abstract
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.
Year
DOI
Venue
2018
10.13053/CyS-22-2-2595
COMPUTACION Y SISTEMAS
Keywords
Field
DocType
Tuning, Taguchi, metaheuristic, GRASP, VRPTW
Black box (phreaking),Mathematical optimization,Vehicle routing problem,GRASP,Computer science,Algorithm,Taguchi methods,Greedy randomized adaptive search procedure,Calibration,Metaheuristic
Journal
Volume
Issue
ISSN
22
2
1405-5546
Citations 
PageRank 
References 
0
0.34
0
Authors
5
Name
Order
Citations
PageRank
Alma Danisa Romero Ocaño100.34
María Cosío León200.34
Manuel Valenzuela-Rendón300.34
Gener José Avilés Rodríguez400.34
Anabel MartíNez-Vargas562.84