Open AccessHEURISTIC OPTIMIZATION OF THE FOUNDATION OF A DYNAMICALLY STRESSED ROTATING MACHINE USING THE LATE ACCEPTANCE HILL CLIMBING (LAHC) ALGORITHM
Author(s) -
Juan Luis Terrádez Marco,
Antonio Hospitaler,
Vicente Albero Gabarda
Publication year - 2021
Publication title -
dyna
Language(s) - English
Resource type - Journals
eISSN - 1989-1490
pISSN - 0012-7361
DOI - 10.6036/9762
Subject(s) - hill climbing , foundation (evidence) , algorithm , heuristic , point (geometry) , set (abstract data type) , mathematical optimization , function (biology) , computer science , local search (optimization) , mathematics , geometry , archaeology , evolutionary biology , biology , history , programming language
This paper proposal the optimization of a foundation for rotative machine under dynamic loads in transient and permanent working mode. The foundation depends on fix parameters and 37 variables. Functional constraints are defined for the foundation. A cost function depending on the variables is defined to be minimized to find the optimal. From all the possible solutions, only are selected the ones that validate the constrains and minimize the cost function. The search of the optimal solution is made with an algorithm of random search by “neighbouring of one point” called Last AcceptanceHill Climbing(LAHC). It is an algorithm of the type called “Adaptative Memory Programming” (AMP) that accepts worse solutions to get the local minimum and learns of the results of the search. The algorithm only depends on the length of the comparison vector and the stop criteria. 350 experiences were made with different length of the comparison vector. It was analysed the quality of the optimal solutions got it witheach length of the vector. Quality of the set of solutions was compared fitting them to a 3 parameters Weibull distribution.