Pub Date : 2023-10-09DOI: 10.1007/s11081-023-09853-5
Tim Diller, Anton Soppelsa, Himanshu Nagpal, Roberto Fedrizzi, Gregor Henze
Abstract The residential heating and cooling sector has been increasingly electrifying, predominantly using electrically driven heat pumps (HP) in combination with thermal/electrical energy storage systems. While these developments contribute to increased renewable and low carbon energy shares in the sector, exploiting the full potential of the technology requires a smart control of these systems that can account for predicted renewable energy availability in the future and the corresponding HP system performance. However, modelling a system featuring complex internal dynamics, in a way that is suitable for smart control, is challenging. Models need to be sophisticated enough to accurately capture the system's nonlinearities and intricacies while at the same time fast enough to enable a thorough search of the solutions space, in suitable computational time. Dynamic programming (DP) is a promising approach to smart controls, as it combines the ability to use complex, non-linear models while being an exhaustive search algorithm, guaranteeing that the global optimum is found. This paper presents an innovative modelling framework that entails reduced order models (ROM) of an HP substation's main components (i.e., HP and thermal energy storage—TES), elaborated in a fashion suitable for use in DP; these have been shaped as to include significant physical operating constraints (e.g., HP compressor variable speed, non-linear coefficient of performance—COP—dependency on outdoor and distribution temperature) affecting the system performance, while at the same time minimising the amount of state variables (i.e., TES temperatures, HP thermal and electric capacity) the optimizer needs to handle. In an application to an exemplary HP system, our system models compare remarkably well to detailed TRNSYS counterparts, used as a reference ground truth. The system achieves significant cost-saving enabled by the dynamic programming optimization approach, facilitating a 13% decrease in power consumption compared to conventional rule-based control.
{"title":"A dynamic programming based method for optimal control of a cascaded heat pump system with thermal energy storage","authors":"Tim Diller, Anton Soppelsa, Himanshu Nagpal, Roberto Fedrizzi, Gregor Henze","doi":"10.1007/s11081-023-09853-5","DOIUrl":"https://doi.org/10.1007/s11081-023-09853-5","url":null,"abstract":"Abstract The residential heating and cooling sector has been increasingly electrifying, predominantly using electrically driven heat pumps (HP) in combination with thermal/electrical energy storage systems. While these developments contribute to increased renewable and low carbon energy shares in the sector, exploiting the full potential of the technology requires a smart control of these systems that can account for predicted renewable energy availability in the future and the corresponding HP system performance. However, modelling a system featuring complex internal dynamics, in a way that is suitable for smart control, is challenging. Models need to be sophisticated enough to accurately capture the system's nonlinearities and intricacies while at the same time fast enough to enable a thorough search of the solutions space, in suitable computational time. Dynamic programming (DP) is a promising approach to smart controls, as it combines the ability to use complex, non-linear models while being an exhaustive search algorithm, guaranteeing that the global optimum is found. This paper presents an innovative modelling framework that entails reduced order models (ROM) of an HP substation's main components (i.e., HP and thermal energy storage—TES), elaborated in a fashion suitable for use in DP; these have been shaped as to include significant physical operating constraints (e.g., HP compressor variable speed, non-linear coefficient of performance—COP—dependency on outdoor and distribution temperature) affecting the system performance, while at the same time minimising the amount of state variables (i.e., TES temperatures, HP thermal and electric capacity) the optimizer needs to handle. In an application to an exemplary HP system, our system models compare remarkably well to detailed TRNSYS counterparts, used as a reference ground truth. The system achieves significant cost-saving enabled by the dynamic programming optimization approach, facilitating a 13% decrease in power consumption compared to conventional rule-based control.","PeriodicalId":56141,"journal":{"name":"Optimization and Engineering","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135095517","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-10-07DOI: 10.1007/s11081-023-09855-3
Jörg Lampe, Steffen Menz
{"title":"Optimized operational strategy of a solar reactor for thermochemical hydrogen generation","authors":"Jörg Lampe, Steffen Menz","doi":"10.1007/s11081-023-09855-3","DOIUrl":"https://doi.org/10.1007/s11081-023-09855-3","url":null,"abstract":"","PeriodicalId":56141,"journal":{"name":"Optimization and Engineering","volume":"215 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135254747","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-09-29DOI: 10.1007/s11081-023-09849-1
Vrinda Dhingra, Amita Sharma, Shiv K. Gupta
{"title":"Sectoral portfolio optimization by judicious selection of financial ratios via PCA","authors":"Vrinda Dhingra, Amita Sharma, Shiv K. Gupta","doi":"10.1007/s11081-023-09849-1","DOIUrl":"https://doi.org/10.1007/s11081-023-09849-1","url":null,"abstract":"","PeriodicalId":56141,"journal":{"name":"Optimization and Engineering","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135131721","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-09-28DOI: 10.1007/s11081-023-09850-8
F. Javier Toledo, Vicente Galiano, Victoria Herranz, Jose M. Blanes, Efstratios Batzelis
Abstract In this paper we describe and compare the methods for the calculation of all the key points of the photovoltaic single-diode model. These include the short-circuit point, the open-circuit point, the maximum power point, the mean slope point, the maximum curvature point, and the jerk point. The main contribution of this paper is a new algorithm to obtain the maximum power point which is based on reducing its computation to solve a single-variable equation. Its unique solution leads to an explicit expression of the point by using a recent parametrization of the single-diode model current–voltage curve. In the numerical resolution of the previous equation, we will use as starting point the mean slope point which has been proved to be close to the maximum power point. Previously, we will provide for the first time in the literature an exact and explicit expression of the mean slope point. The new algorithm proposed reaches the accuracy of the best known numerical methods, but it is much faster, almost reaching the execution times of explicit formulas.
{"title":"A comparison of methods for the calculation of all the key points of the PV single-diode model including a new algorithm for the maximum power point","authors":"F. Javier Toledo, Vicente Galiano, Victoria Herranz, Jose M. Blanes, Efstratios Batzelis","doi":"10.1007/s11081-023-09850-8","DOIUrl":"https://doi.org/10.1007/s11081-023-09850-8","url":null,"abstract":"Abstract In this paper we describe and compare the methods for the calculation of all the key points of the photovoltaic single-diode model. These include the short-circuit point, the open-circuit point, the maximum power point, the mean slope point, the maximum curvature point, and the jerk point. The main contribution of this paper is a new algorithm to obtain the maximum power point which is based on reducing its computation to solve a single-variable equation. Its unique solution leads to an explicit expression of the point by using a recent parametrization of the single-diode model current–voltage curve. In the numerical resolution of the previous equation, we will use as starting point the mean slope point which has been proved to be close to the maximum power point. Previously, we will provide for the first time in the literature an exact and explicit expression of the mean slope point. The new algorithm proposed reaches the accuracy of the best known numerical methods, but it is much faster, almost reaching the execution times of explicit formulas.","PeriodicalId":56141,"journal":{"name":"Optimization and Engineering","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135386800","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-09-27DOI: 10.1007/s11081-023-09852-6
Adrian Diaz, Nathaniel Morgan, John Bernardin
{"title":"Parallel 3D topology optimization with multiple constraints and objectives","authors":"Adrian Diaz, Nathaniel Morgan, John Bernardin","doi":"10.1007/s11081-023-09852-6","DOIUrl":"https://doi.org/10.1007/s11081-023-09852-6","url":null,"abstract":"","PeriodicalId":56141,"journal":{"name":"Optimization and Engineering","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135535550","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-09-27DOI: 10.1007/s11081-023-09834-8
Luca Mencarelli, Julien Floquet, Frédéric Georges
Abstract In this paper, we propose two novel matheuristic algorithms, i.e., heuristics based on mathematical formulations of the problem, in order to find a good feasible solution to the satellite constellation design problem for discontinuous coverage with a constrained revisit time. This problem consists in searching for a constellation able to periodically observe several targets at the Earth surface with the smallest number of satellites achievable. A Feasibility Pump approach is described: we specifically adapt the Feasibility Pump procedure to our design problem and we report results highlighting the benefits of this approach compared to the base Mixed Integer Nonlinear Programming (MINLP) algorithm it is derived from. Then, we propose a second matheuristic based on the discretized Mixed Integer Linear Programming (MILP) formulation of the problem, which outperforms the plain MILP formulation.
{"title":"Matheuristics approaches for the satellite constellation design problem","authors":"Luca Mencarelli, Julien Floquet, Frédéric Georges","doi":"10.1007/s11081-023-09834-8","DOIUrl":"https://doi.org/10.1007/s11081-023-09834-8","url":null,"abstract":"Abstract In this paper, we propose two novel matheuristic algorithms, i.e., heuristics based on mathematical formulations of the problem, in order to find a good feasible solution to the satellite constellation design problem for discontinuous coverage with a constrained revisit time. This problem consists in searching for a constellation able to periodically observe several targets at the Earth surface with the smallest number of satellites achievable. A Feasibility Pump approach is described: we specifically adapt the Feasibility Pump procedure to our design problem and we report results highlighting the benefits of this approach compared to the base Mixed Integer Nonlinear Programming (MINLP) algorithm it is derived from. Then, we propose a second matheuristic based on the discretized Mixed Integer Linear Programming (MILP) formulation of the problem, which outperforms the plain MILP formulation.","PeriodicalId":56141,"journal":{"name":"Optimization and Engineering","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135535554","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-09-25DOI: 10.1007/s11081-023-09846-4
Nabil Nahas, Haifa Rekik, Safa Bhar Layeb, Mohammed Abouheaf, Ibrahim Najum
{"title":"A multi-vendor multi-buyer integrated production-inventory model with greenhouse gas emissions","authors":"Nabil Nahas, Haifa Rekik, Safa Bhar Layeb, Mohammed Abouheaf, Ibrahim Najum","doi":"10.1007/s11081-023-09846-4","DOIUrl":"https://doi.org/10.1007/s11081-023-09846-4","url":null,"abstract":"","PeriodicalId":56141,"journal":{"name":"Optimization and Engineering","volume":"128 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135816054","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-09-23DOI: 10.1007/s11081-023-09836-6
Sajad Fathi Hafshejani, Daya Gaur, Shahadat Hossain, Robert Benkoczi
{"title":"A fast non-monotone line search for stochastic gradient descent","authors":"Sajad Fathi Hafshejani, Daya Gaur, Shahadat Hossain, Robert Benkoczi","doi":"10.1007/s11081-023-09836-6","DOIUrl":"https://doi.org/10.1007/s11081-023-09836-6","url":null,"abstract":"","PeriodicalId":56141,"journal":{"name":"Optimization and Engineering","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135967080","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：