Parameter estimation of a thermoelectric generator by using salps search algorithm

Thermoelectric generators (TEGs) have the potential to convert waste heat into electrical energy, making them attractive for energy harvesting applications. However, accurately estimating TEG parameters from industrial systems is a complex problem due to the mathematical complex non-linearities and numerous variables involved in the TEG modeling. This paper addresses this research gap by presenting a comparative evaluation of three optimization methods, Particle Swarm Optimization (PSO), Salps Search Algorithm (SSA), and Vortex Search Algorithm (VSA), for TEG parameter estimation. The proposed integrated approach is significant as it overcomes the limitations of existing methods and provides a more accurate and rapid estimation of TEG parameters. The performance of each optimization method is evaluated in terms of root mean square error (RMSE), standard deviation, and processing time. The results indicate that all three methods perform similarly, with average RMSE errors ranging from 0.0019 W to 0.0021 W, and minimum RMSE errors ranging from 0.0017 W to 0.0018 W. However, PSO has a higher standard deviation of the RMSE errors compared to the other two methods. In addition, we present the optimized parameters achieved through the proposed optimization methods, which serve as a reference for future research and enable the comparison of various optimization strategies. The disparities observed in the optimized outcomes underscore the intricacy of the issue and underscore the importance of the integrated approach suggested for precise TEG parameter estimation

A Novel Back-Off Algorithm for the Integration Between Dynamic Optimization and Scheduling of Batch Processes Under Uncertainty

This thesis presents a decomposition algorithm for obtaining robust scheduling and control decisions. It iteratively solves scheduling and dynamic optimization problems while approximating stochastic uncertainty through back-off terms, calculated through dynamic simulations of the process. This algorithm is compared, both in solution quality and performance, against a fully-integrated MINLP

Computational strategies for improved MINLP algorithms

<p>In order to improve the efficiency for solving MINLP problems, we present in this paper three computational strategies. These include multiple-generation cuts, hybrid methods and partial surrogate cuts for the Outer Approximation and Generalized Benders Decomposition. The properties and convergence of the strategies are analyzed. Based on the proposed strategies, five new MINLP algorithms are developed, and their implementation is discussed. Results of numerical experiments for benchmark MINLP problems are reported to demonstrate the efficiency of the proposed methods.</p