Calibration of the descent local search algorithm parameters using orthogonal arrays
[EN] Solving optimization problems using heuristic algorithms requires the selection of its parameters. Traditionally, these parameters are selected by a trial and error process that cannot guarantee the quality of the results obtained because not all the potential combinations of parameters are che...
| Authors: | , , , |
|---|---|
| Format: | article |
| Publication Date: | 2020 |
| Country: | España |
| Institution: | Universitat Politècnica de València (UPV) |
| Repository: | RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia |
| Language: | English |
| OAI Identifier: | oai:riunet.upv.es:10251/160982 |
| Online Access: | https://riunet.upv.es/handle/10251/160982 |
| Access Level: | Open access |
| Keyword: | INGENIERIA DE LA CONSTRUCCION |
| Summary: | [EN] Solving optimization problems using heuristic algorithms requires the selection of its parameters. Traditionally, these parameters are selected by a trial and error process that cannot guarantee the quality of the results obtained because not all the potential combinations of parameters are checked. To fill this gap, this paper proposes the application of Taguchi's orthogonal arrays to calibrate the parameters of a heuristic optimization algorithm (the descent local search algorithm). This process is based on the study of the combinations of discrete values of the heuristic tool parameters and it enables optimization of the heuristic tool performance with a reduced computational effort. To check its efficiency, this methodology is applied to a technical challenge never studied before: the optimization of the tensioning process of cable-stayed bridges. The statistical improvement of the heuristic tool performance is studied by the optimization of the tensioning process of a real cable-stayed bridge. Results show that the proposed calibration technique provided robust values of the objective function (with lower minimum and mean values, and lower standard deviation) with reduced computational cost. |
|---|