{"id":128,"date":"2022-06-16T15:15:51","date_gmt":"2022-06-16T15:15:51","guid":{"rendered":"http:\/\/vps29.math-in.net\/163esgi\/?page_id=128"},"modified":"2024-11-01T11:26:06","modified_gmt":"2024-11-01T11:26:06","slug":"problem-2","status":"publish","type":"page","link":"https:\/\/math-in.net\/184esgi\/en\/program\/problem-2\/","title":{"rendered":"Problem 2: Multi-objective optimization algorithms in solar thermal power plants (Sunntics)"},"content":{"rendered":"

Problem 2: Multi-objective optimization algorithms in solar thermal power plants<\/h4>\n<\/div>
<\/span><\/div>
\n
\n
\n

\"\"<\/p>\n

Academic Coordinator | <\/strong>TBA
\n<\/strong><\/p>\n

Business Coordinator<\/strong> | Manuel Quero Garc\u00eda, CEO of Sunntics.<\/p>\n

Specialist<\/strong> | Roc\u00edo Mingorance, Head of Algorithms and Processes at Sunntics.<\/p>\n

Scope<\/strong> | In the context of multi-objective optimization, evolutionary algorithms have proven to be powerful tools due to their ability to explore multiple solutions simultaneously. However, their applicability and effectiveness are not universally standardized. In cases where optimization requires immediate responses, such as the aiming strategy of heliostats at an external tower receiver, evolutionary algorithms may not be the best option due to their high computational cost. For these types of problems, where a balance between accuracy and computing time is sought, approximate or metaheuristic algorithms may be more effective, as they provide approximate solutions in less time. Choosing the optimal algorithm requires a detailed analysis of these, as each method has specific strengths and weaknesses. Factors such as the complexity of the problem to be optimized, the number of objectives, the structure of the search space, and time and computational resource constraints are key considerations in the selection and validation process. A comparative analysis will help identify which algorithms, such as heuristics, metaheuristics, or approximates, achieve a better balance between precision and computational cost, adapting better to the peculiarities of this problem.<\/p>\n

\n<\/div>\n<\/div>\n<\/div>\n<\/div><\/div>