发布求助
文献互助 智能选刊 最新文献

Optimization and Engineering最新文献

筛选
英文 中文
Sectoral portfolio optimization by judicious selection of financial ratios via PCA 通过PCA对财务比率的明智选择来优化部门投资组合
3区 工程技术
Optimization and Engineering Pub Date : 2023-09-29 DOI: 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":null,"pages":null},"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}
引用次数: 1
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 对PV单二极管模型各关键点的计算方法进行了比较，其中包括最大功率点的新算法
3区 工程技术
Optimization and Engineering Pub Date : 2023-09-28 DOI: 10.1007/s11081-023-09850-8
F. Javier Toledo, Vicente Galiano, Victoria Herranz, Jose M. Blanes, Efstratios Batzelis
{"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":null,"pages":null},"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}
引用次数: 0
Parallel 3D topology optimization with multiple constraints and objectives 多约束多目标并行三维拓扑优化
3区 工程技术
Optimization and Engineering Pub Date : 2023-09-27 DOI: 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":null,"pages":null},"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}
引用次数: 0
Matheuristics approaches for the satellite constellation design problem 卫星星座设计问题的数学方法
3区 工程技术
Optimization and Engineering Pub Date : 2023-09-27 DOI: 10.1007/s11081-023-09834-8
Luca Mencarelli, Julien Floquet, Frédéric Georges
{"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":null,"pages":null},"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}
引用次数: 0
A multi-vendor multi-buyer integrated production-inventory model with greenhouse gas emissions 考虑温室气体排放的多供应商多买家集成生产库存模型
3区 工程技术
Optimization and Engineering Pub Date : 2023-09-25 DOI: 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":null,"pages":null},"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}
引用次数: 0
A fast non-monotone line search for stochastic gradient descent 随机梯度下降的快速非单调直线搜索
3区 工程技术
Optimization and Engineering Pub Date : 2023-09-23 DOI: 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":null,"pages":null},"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}
引用次数: 0
Network flow problem heuristic reduction using machine learning 使用机器学习的网络流问题启发式约简
3区 工程技术
Optimization and Engineering Pub Date : 2023-09-23 DOI: 10.1007/s11081-023-09838-4
M. Rosecký, J. Pluskal, R. Šomplák
{"title":"Network flow problem heuristic reduction using machine learning","authors":"M. Rosecký, J. Pluskal, R. Šomplák","doi":"10.1007/s11081-023-09838-4","DOIUrl":"https://doi.org/10.1007/s11081-023-09838-4","url":null,"abstract":"Abstract Most of the supporting tools developed for logistic optimization and processing infrastructure planning are based on the network flow problem. The real-world application of these instruments can provide great insight and help to ensure long-term sustainability. The main limitation of these tools lies in great computing demand when there is the necessity of solving large-scale tasks in great detail. It means that the ability to find the optimal solution for real-world problems is limited. Thus, the detail of infrastructure is often reduced by data aggregation or heuristic approaches are used to find a suboptimal solution. This paper proposes a machine learning classification model to reduce the number of variables for an exact solution algorithm. First, the design of experiments is used to create a set of smaller problems that are possible to solve exactly. Artificial data are used at this stage, while domain knowledge is used to set appropriate distribution and parameters. Second, the classification model estimates the probability of the presence of each arc in the optimal solution. Features, which are related to costs and capacity, of each arc are utilized in the classification model. Models created on a subset of generated problems are then tested on the other problems. Finally, the proposed framework is applied to the waste management problem in the Czech Republic. The results of the verification show, that it is possible to remove 95% of arcs without impact on strategic decisions and without significant change of an objective function. The computing time of the reduced problem takes only 7% of the original task.","PeriodicalId":56141,"journal":{"name":"Optimization and Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135959419","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}
引用次数: 0
Optimization of data centre waste heat integration into the low-temperature district heating networks 数据中心废热集成到低温区域供热网络的优化
3区 工程技术
Optimization and Engineering Pub Date : 2023-09-23 DOI: 10.1007/s11081-023-09837-5
Josip Miškić, Hrvoje Dorotić, Tomislav Pukšec, Vladimir Soldo, Neven Duić
{"title":"Optimization of data centre waste heat integration into the low-temperature district heating networks","authors":"Josip Miškić, Hrvoje Dorotić, Tomislav Pukšec, Vladimir Soldo, Neven Duić","doi":"10.1007/s11081-023-09837-5","DOIUrl":"https://doi.org/10.1007/s11081-023-09837-5","url":null,"abstract":"","PeriodicalId":56141,"journal":{"name":"Optimization and Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135966865","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}
引用次数: 0
Statistical static timing analysis via modern optimization lens: I. Histogram-based approach 基于现代优化镜头的统计静态时序分析:1 .基于直方图的方法
3区 工程技术
Optimization and Engineering Pub Date : 2023-09-23 DOI: 10.1007/s11081-023-09847-3
Adam Bosák, Dmytro Mishagli, Jakub Mareček
{"title":"Statistical static timing analysis via modern optimization lens: I. Histogram-based approach","authors":"Adam Bosák, Dmytro Mishagli, Jakub Mareček","doi":"10.1007/s11081-023-09847-3","DOIUrl":"https://doi.org/10.1007/s11081-023-09847-3","url":null,"abstract":"Abstract Statistical Static Timing Analysis (SSTA) is studied from the point of view of mathematical optimization. We present two formulations of the problem of finding the critical path delay distribution that were not known before: (i) a formulation of the SSTA problem using Binary–Integer Programming and (ii) a practical formulation using Geometric Programming. For simplicity, we use histogram approximation of the distributions. Scalability of the approaches is studied and possible generalizations are discussed.","PeriodicalId":56141,"journal":{"name":"Optimization and Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135967316","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}
引用次数: 0
A gradient-based approach for optimal actuator design with morphing wings 基于梯度的变形翼致动器优化设计方法
3区 工程技术
Optimization and Engineering Pub Date : 2023-09-22 DOI: 10.1007/s11081-023-09835-7
Erich Wehrle, Veit Gufler, Fabian Sturm
{"title":"A gradient-based approach for optimal actuator design with morphing wings","authors":"Erich Wehrle, Veit Gufler, Fabian Sturm","doi":"10.1007/s11081-023-09835-7","DOIUrl":"https://doi.org/10.1007/s11081-023-09835-7","url":null,"abstract":"","PeriodicalId":56141,"journal":{"name":"Optimization and Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136061529","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}
引用次数: 0
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信