Optimization and Engineering最新文献_第4页

Optimizing ventilation in medium- and short-term mine planning 中短期矿山规划中的通风优化

IF 2.1 3区工程技术

Optimization and Engineering Pub Date : 2024-03-09 DOI: 10.1007/s11081-023-09871-3

John Ayaburi, Aaron Swift, Andrea Brickey, Alexandra Newman, Daniel Bienstock

{"title":"Optimizing ventilation in medium- and short-term mine planning","authors":"John Ayaburi, Aaron Swift, Andrea Brickey, Alexandra Newman, Daniel Bienstock","doi":"10.1007/s11081-023-09871-3","DOIUrl":"https://doi.org/10.1007/s11081-023-09871-3","url":null,"abstract":"Mine planners utilize production schedules to determine when activities should be executed, e.g., blocks of ore should be extracted; a medium-term schedule maximizes net present value associated with activity execution while a short-term schedule reacts to unforeseen events. Both types of schedules conform to spatial precedence and resource restrictions. As a result of executing activities, heat accumulates and activities must be curtailed. Airflow flushes heat from the mining areas, but is limited to the capacity of the ventilation system and operational setup. We propose two large-scale production scheduling models: (i) that which prescribes the start dates of activities in a medium-term schedule while considering airspeed, in conjunction with ventilation and refrigeration; and, (ii) that which minimizes deviation between both medium- and short-term schedules, and production goals. We correspondingly present novel techniques to improve model tractability, and demonstrate the efficacy of these techniques on cases that yield short-term schedules congruent with medium-term plans while ensuring the safety of the work environment. We solve otherwise-intractable medium-term instances using an enumeration technique if the gaps are greater than 10%. Our short-term instances solve in 1,800 seconds, on average, to a 0.1% optimality gap, and suggest varying optimal airspeeds based on the maximum heat load on each level.","PeriodicalId":56141,"journal":{"name":"Optimization and Engineering","volume":"285 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2024-03-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140100126","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

Co-optimizing the smart grid and electric public transit bus system 共同优化智能电网和电动公交巴士系统

IF 2.1 3区工程技术

Optimization and Engineering Pub Date : 2024-02-28 DOI: 10.1007/s11081-023-09878-w

Mertcan Yetkin, Brandon Augustino, Alberto J. Lamadrid, Lawrence V. Snyder

{"title":"Co-optimizing the smart grid and electric public transit bus system","authors":"Mertcan Yetkin, Brandon Augustino, Alberto J. Lamadrid, Lawrence V. Snyder","doi":"10.1007/s11081-023-09878-w","DOIUrl":"https://doi.org/10.1007/s11081-023-09878-w","url":null,"abstract":"As climate change provides impetus for investing in smart cities, with electrified public transit systems, we consider electric public transportation buses in an urban area, which play a role in the power system operations in addition to their typical function of serving public transit demand. Our model considers a social planner, such that the transit authority and the operator of the electricity system co-optimize the power system to minimize the total operational cost of the grid, while satisfying additional transportation constraints on buses. We provide deterministic and stochastic formulations to co-optimize the system. Each stochastic formulation provides a different set of recourse actions to manage the variable renewable energy uncertainty: ramping up/down of the conventional generators, or charging/discharging of the transit fleet. We demonstrate the capabilities of the model and the benefit obtained via a coordinated strategy. We compare the efficacies of these recourse actions to provide additional managerial insights. We analyze the effect of different pricing strategies on the co-optimization. Noting the stress growing electrified fleets with greater battery capacities will eventually impose on a power network, we provide theoretical insights on coupled investment strategies for expansion planning in order to reduce greenhouse gas (GH) emissions. Given the recent momentum towards building smarter cities and electrifying transit systems, our results provide policy directions towards a sustainable future. We test our models using modified MATPOWER case files and verify our results with different sized power networks. This study is motivated by a project with a large transit authority in California.","PeriodicalId":56141,"journal":{"name":"Optimization and Engineering","volume":"85 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2024-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140887864","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

Linewalker: line search for black box derivative-free optimization and surrogate model construction Linewalker：用于黑盒无衍生优化和代用模型构建的线性搜索

IF 2.1 3区工程技术

Optimization and Engineering Pub Date : 2024-02-21 DOI: 10.1007/s11081-023-09879-9

Dimitri J. Papageorgiou, Jan Kronqvist, Krishnan Kumaran

{"title":"Linewalker: line search for black box derivative-free optimization and surrogate model construction","authors":"Dimitri J. Papageorgiou, Jan Kronqvist, Krishnan Kumaran","doi":"10.1007/s11081-023-09879-9","DOIUrl":"https://doi.org/10.1007/s11081-023-09879-9","url":null,"abstract":"This paper describes a simple, but effective sampling method for optimizing and learning a discrete approximation (or surrogate) of a multi-dimensional function along a one-dimensional line segment of interest. The method does not rely on derivative information and the function to be learned can be a computationally-expensive “black box” function that must be queried via simulation or other means. It is assumed that the underlying function is noise-free and smooth, although the algorithm can still be effective when the underlying function is piecewise smooth. The method constructs a smooth surrogate on a set of equally-spaced grid points by evaluating the true function at a sparse set of judiciously chosen grid points. At each iteration, the surrogate’s non-tabu local minima and maxima are identified as candidates for sampling. Tabu search constructs are also used to promote diversification. If no non-tabu extrema are identified, a simple exploration step is taken by sampling the midpoint of the largest unexplored interval. The algorithm continues until a user-defined function evaluation limit is reached. Numerous examples are shown to illustrate the algorithm’s efficacy and superiority relative to state-of-the-art methods, including Bayesian optimization and NOMAD, on primarily nonconvex test functions.","PeriodicalId":56141,"journal":{"name":"Optimization and Engineering","volume":"23 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2024-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140888003","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

Adjoint based aerodynamic shape optimization of a semi-submerged inlet duct and upstream inlet surface 基于相加的半浸没式进气管道和上游进气道表面的空气动力学形状优化

IF 2.1 3区工程技术

Optimization and Engineering Pub Date : 2024-01-11 DOI: 10.1007/s11081-023-09877-x

U. C. Küçük, Ismail H. Tuncer

引用次数: 0

Scalable enforcement of geometric non-interference constraints for gradient-based optimization 基于梯度优化的几何无干扰约束的可扩展执行

IF 2.1 3区工程技术

Optimization and Engineering Pub Date : 2023-12-28 DOI: 10.1007/s11081-023-09864-2

Ryan C. Dunn, Anugrah Jo Joshy, Jui-Te Lin, Cédric Girerd, Tania K. Morimoto, John T. Hwang

{"title":"Scalable enforcement of geometric non-interference constraints for gradient-based optimization","authors":"Ryan C. Dunn, Anugrah Jo Joshy, Jui-Te Lin, Cédric Girerd, Tania K. Morimoto, John T. Hwang","doi":"10.1007/s11081-023-09864-2","DOIUrl":"https://doi.org/10.1007/s11081-023-09864-2","url":null,"abstract":"Many design optimization problems include constraints to prevent intersection of the geometric shape being optimized with other objects or with domain boundaries. When applying gradient-based optimization to such problems, the constraint function must provide an accurate representation of the domain boundary and be smooth, amenable to numerical differentiation, and fast-to-evaluate for a large number of points. We propose the use of tensor-product B-splines to construct an efficient-to-evaluate level set function that locally approximates the signed distance function for representing geometric non-interference constraints. Adapting ideas from the surface reconstruction methods, we formulate an energy minimization problem to compute the B-spline control points that define the level set function given an oriented point cloud sampled over a geometric shape. Unlike previous explicit non-interference constraint formulations, our method requires an initial setup operation, but results in a more efficient-to-evaluate and scalable representation of geometric non-interference constraints. This paper presents the results of accuracy and scaling studies performed on our formulation. We demonstrate our method by solving a medical robot design optimization problem with non-interference constraints. We achieve constraint evaluation times on the order of (10^{-6}) seconds per point on a modern desktop workstation, and a maximum on-surface error of less than 1.0% of the minimum bounding box diagonal for all examples studied. Overall, our method provides an effective formulation for non-interference constraint enforcement with high computational efficiency for gradient-based design optimization problems whose solutions require at least hundreds of evaluations of constraints and their derivatives.","PeriodicalId":56141,"journal":{"name":"Optimization and Engineering","volume":"114 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2023-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139057534","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

Extensions to generalized disjunctive programming: hierarchical structures and first-order logic 广义分解式程序设计的扩展：层次结构和一阶逻辑

IF 2.1 3区工程技术

Optimization and Engineering Pub Date : 2023-12-20 DOI: 10.1007/s11081-023-09831-x

Hector D. Perez, Ignacio E. Grossmann

引用次数: 0

Mixed-integer exponential conic optimization for reliability enhancement of power distribution systems 提高配电系统可靠性的混合整数指数圆锥优化法

IF 2.1 3区工程技术

Optimization and Engineering Pub Date : 2023-12-19 DOI: 10.1007/s11081-023-09876-y

Milad Dehghani Filabadi, Chen Chen, Antonio Conejo

引用次数: 0

A solution method for mixed-variable constrained blackbox optimization problems 混合变量约束黑箱优化问题的求解方法

IF 2.1 3区工程技术

Optimization and Engineering Pub Date : 2023-12-19 DOI: 10.1007/s11081-023-09874-0

Marie-Ange Dahito, Laurent Genest, Alessandro Maddaloni, José Neto

引用次数: 0

A direct block scheduling model considering operational space requirement for strategic open-pit mine production planning 考虑作业空间要求的直接分块调度模型，用于露天矿生产战略规划

IF 2.1 3区工程技术

Optimization and Engineering Pub Date : 2023-12-16 DOI: 10.1007/s11081-023-09875-z

Pierre Nancel-Penard, Enrique Jelvez

{"title":"A direct block scheduling model considering operational space requirement for strategic open-pit mine production planning","authors":"Pierre Nancel-Penard, Enrique Jelvez","doi":"10.1007/s11081-023-09875-z","DOIUrl":"https://doi.org/10.1007/s11081-023-09875-z","url":null,"abstract":"Long-term block scheduling is a challenging problem that involves determining the best extraction period for blocks to maximize the net present value of the open-pit mining business. This process involves multiple constraints, mainly ensuring safe pit walls and imposing maximum limits on operational resource consumption. However, most of the models proposed in the literature do not sufficiently consider geometric constraints that ensure a minimum space for mining equipment to operate safely. These models overlook practical and operational constraints and generate solutions that are difficult to implement. Consequently, the promised net present value cannot be achieved. In this paper, we propose an integer linear programming model that considers minimum mining width requirements along with a decomposition heuristic method to solve it.The proposed model determines which blocks should be mined and when to maximize net present value while ensuring safe pit walls and respecting limits on operational resources and geometric constraints. Geometric constraints require that the minimum operational distance be considered within each extraction period. Because the incorporation of geometric constraints in the proposed model makes it harder to solve, a time-space decomposition heuristic is implemented. This heuristic consists of successive time and space aggregation/disaggregation to generate simpler subproblems to be solved. This approach was applied on two case studies. The results show that the proposed methodology generates practical production plans that are more realistic to implement in mining operations, lowering the gap between factual and promised net present value.","PeriodicalId":56141,"journal":{"name":"Optimization and Engineering","volume":"6 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2023-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138686845","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 full-Newton step interior-point algorithm for the special weighted linear complementarity problem based on positive-asymptotic kernel function 基于正渐近核函数的特殊加权线性互补问题全牛顿步长内部点算法

IF 2.1 3区工程技术

Optimization and Engineering Pub Date : 2023-12-14 DOI: 10.1007/s11081-023-09873-1

Mingwang Zhang, Dechun Zhu, Jiawei Zhong

引用次数: 0