检索结果-内蒙古大学图书馆

A binary integer Linear programming Model for Optimizing Underground Stope Layout

MINING METALLURGY & EXPLORATION 2025年 1-26页

作者： Mensah, Theophilus Awuah-Offei, Kwame Missouri Univ Sci & Technol Min & Explos Engn Dept Rolla MO 65409 USA

Underground mine planning engineers face significant challenges when determining what design and layout provides the most profitable and safe stope for extraction. While researchers have developed several techniques and optimization algorithms in recent years to solve this problem, most fail to find optimal solutions because they are heuristic or LP-based without efficient shape constraints. This work proposes a two-dimensional binary integer linear programming (BILP) model for determining the optimal combination of blocks in a stope that maximizes the economic value of the layout of stopes while respecting all constraints. The work draws on Queyranne and Wolsey's (2017 & 2018) formulations of tight constraints for bounded up/down times in production planning problems to formulate novel and efficient geometric constraints along with geotechnical and grade constraints for the stope layout optimization problem. Results of the case study indicate that it is possible to formulate efficient shape constraints in LP-based stope optimization models. The block model used for the numerical example contained 144 valuable blocks out of 774 blocks. The BILP model selected 60 valuable blocks and 13 waste blocks that met all constraints translating into a maximum economic value of $34.4 M in 1.83 h with a gap tolerance of 0.00%. A series of experiments show that the model is sensitive to cutoff grade, stope frame size, pillar size, number of stopes, and problem size as these key parameters affect the objective function value, solution time, and final layout of stopes. The main limitation of the proposed model is that pillar constraints are implemented in the Z-X or Z-Y directions but not implemented diagonally.

关键词： Underground mine planning binary integer programming Sublevel stoping Stope layout optimization

来源：评论

学校读者我要写书评

暂无评论

binary integer programming formulations for scheduling in market-driven foundries

引用

COMPUTERS & INDUSTRIAL ENGINEERING 2010年第3期59卷 425-435页

作者： Teixeira, Rodolfo Florence, Jr. Faria Fernandes, Flavio Cesar Pereira, Neocles Alves Sao Paulo State Univ Dept Prod Engn BR-17033360 Bauru SP Brazil Univ Fed Sao Carlos Dept Prod Engn BR-13565905 Sao Carlos SP Brazil

This paper describes the development and solution of binary integer formulations for production scheduling problems in market-driven foundries. This industrial sector is comprised of small and mid-sized companies with little or no automation, working with diversified production, involving several different metal alloy specifications in small tailor-made product lots. The characteristics and constraints involved in a typical production environment at these industries challenge the formulation of mathematical programming models that can be computationally solved when considering real applications. However, despite the interest on the part of these industries in counting on effective methods for production scheduling, there are few studies available on the subject. The computational tests prove the robustness and feasibility of proposed models in situations analogous to those found in production scheduling at the analyzed industrial sector. (C) 2010 Elsevier Ltd. All rights reserved.

关键词： binary integer programming Production scheduling Market-driven foundries

来源：评论

学校读者我要写书评

暂无评论

NVR-BIP: Nuclear Vector Replacement using binary integer programming for NMR Structure-Based Assignments

引用

COMPUTER JOURNAL 2011年第5期54卷 708-716页

作者： Apaydin, Mehmet Serkan Catay, Bulent Patrick, Nicholas Donald, Bruce R. Sabanci Univ Fac Engn & Nat Sci TR-34956 Istanbul Turkey Duke Univ Dept Comp Sci Durham NC 27708 USA Duke Univ Dept Biochem Med Ctr Durham NC 27708 USA

Nuclear magnetic resonance (NMR) spectroscopy is an important experimental technique that allows one to study protein structure and dynamics in solution. An important bottleneck in NMR protein structure determination is the assignment of NMR peaks to the corresponding nuclei. Structure-based assignment (SBA) aims to solve this problem with the help of a template protein which is homologous to the target and has applications in the study of structure-activity relationship, protein-protein and protein-ligand interactions. We formulate SBA as a linear assignment problem with additional nuclear overhauser effect constraints, which can be solved within nuclear vector replacement's (NVR) framework (Langmead, C., Yan, A., Lilien, R., Wang, L. and Donald, B. (2003) A Polynomial-Time Nuclear Vector Replacement Algorithm for Automated NMR Resonance Assignments. Proc. the 7th Annual Int. Conf. Research in Computational Molecular Biology (RECOMB), Berlin, Germany, April 10-13, pp. 176-187. ACM Press, New York, NY. J. Comp. Bio., (2004), 11, pp. 277-298;Langmead, C. and Donald, B. (2004) An expectation/maximization nuclear vector replacement algorithm for automated NMR resonance assignments. J. Biomol. NMR, 29, 111-138). Our approach uses NVR's scoring function and data types and also gives the option of using CH and NH residual dipolar coupling (RDCs), instead of NH RDCs which NVR requires. We test our technique on NVR's data set as well as on four new proteins. Our results are comparable to NVR's assignment accuracy on NVR's test set, but higher on novel proteins. Our approach allows partial assignments. It is also complete and can return the optimum as well as near-optimum assignments. Furthermore, it allows us to analyze the information content of each data type and is easily extendable to accept new forms of input data, such as additional RDCs.

关键词： binary integer programming structural bioinformatics automated NMR assignments

来源：评论

学校读者我要写书评

暂无评论

Power line routing design by GIS-driven fuzzy traveling salesman problem-binary integer programming for green energy integration

引用

APPLIED ENERGY 2024年 374卷

作者： Jong, Far Chen Ahmed, Musse Mohamud Univ Malaysia Sarawak Dept Elect & Elect Engn Kota Samarahan 94300 Sarawak Malaysia

In response to the obstacles posed by finite resources and environmental issues, Sarawak has transitioned its focus towards sustainable and green energy to establish a resilient and eco-friendly energy landscape. Generally, Sarawak is blessed with abundant green energy resources;however, constructive green energy integration methods were absent. Proper green energy integration is necessary due to its intermittent properties and geographical dispersion. Therefore, the paper proposes a novel methodology using Geographical Information System tools incorporating geographical databases, fuzzy logic operations and Traveling Salesman Problembinary integer programming algorithms to integrate green energies focusing on optimal power line routing design. The methodology begins with clustering the green energies based on geographical divisions. Then, it considers three influential factors (distance, elevation difference, and average ground flash density) and transforms them into matrix data for each cluster. Fuzzy logic operations optimize the trade-off among these factors and form fuzzy values. Following this, the Traveling Salesman Problem-binary integer programming formulation creates pairs of green energy, distance vectors, equality constraints, and binary bounds. The optimization process constructs and eliminates multiple subtours to generate an optimal single loop with minimal value, representing the optimal power line routing design. Rigorous analyses, comparison, and validation demonstrate that the proposed method consistently outperforms ordinary Traveling Salesman Problem-binary integer programming, ranking top 1 across all clusters. Further evaluation against the state-of-the-art fuzzy Traveling Salesman Problem algorithms reveals that the proposed model secures the lowest fuzzy values with extremely low computation times across all clusters. Furthermore, the paper presents an innovative way to consider the ground flash density factor in green energy integration. Th

关键词： binary integer programming Fuzzy Geographical information system Green energy integration Traveling salesman problem

来源：评论

学校读者我要写书评

暂无评论

Online coordination of directional overcurrent relays using binary integer programming

引用

ELECTRIC POWER SYSTEMS RESEARCH 2015年 127卷 118-125页

作者： Correa, Rafael Cardoso, Ghendy, Jr. de Araujo, Olinto C. B. Mariotto, Lenois Fed Inst Educ Sci & Technol Rio Grande do Sul Farroupilha RS Brazil Univ Fed Santa Maria BR-97119900 Santa Maria RS Brazil

This work presents a binary programming model for online coordination of directional overcurrent relay problems in interconnected power distribution and subtransmission systems. The proposed model considers discrete time dial and pickup current settings as in microprocessor-based relays. The coordination problem is solved for every topological change in the network and whose optimized settings are remotely adjusted on each relay through a SCADA system, enhancing the speed and sensitivity of the protection system. A pre-processing step is performed to ensure that the operation time of each relay be below the melting curve of the protected cable. Computational results for the binary programming model solved by CPLEX optimization package are compared to heuristic-based techniques. The simulation results indicates that our approach is suitable for online applications, since an optimal solution can be found in reduced times. (C) 2015 Elsevier B.V. All rights reserved.

关键词： binary integer programming Directional overcurrent relay Online coordination SCADA system Smart grid Optimization

来源：评论

学校读者我要写书评

暂无评论

Optimal road side units placement model based on binary integer programming for efficient traffic information advertisement and discovery in vehicular environment

引用

IET INTELLIGENT TRANSPORT SYSTEMS 2015年第9期9卷 851-861页

作者： Balouchzahi, Nik Mohammad Fathy, Mahmood Akbari, Ahmad Iran Univ Sci & Technol Sch Comp Engn Tehran Iran Univ Sistan & Baluchestan Fac Elect & Comp Engn Zahedan Iran

Road side units (RSUs) are considered to be one of the most important components in vehicular networks to send and receive data from other components inside the networks. Regarding the fact that vehicular network performance and vehicular environment coverage are highly related, the maximum coverage via RSUs improves the efficiency of vehicular networks. However, because of high costs of RSU placement, it would be impossible to have full coverage through RSUs. Hence, it would be necessary to optimally install a limited number of RSUs in the most appropriate locations. In this article, the problem of RSU placement is formulated to binary integer programming. The objective of the present study is to find locations which have higher impacts on efficiency of vehicular networks. The objective function is minimising the costs of RSU placement. Moreover, coverage of the most important locations by RSUs has been applied in the form of optimization constraints. The performance of the given mechanism has been assessed by real traces. Simulation results indicate that the method is able to find optimal locations of RSUs in highway and urban environments. Furthermore, the results show that by optimal RSU placement inside the environment, the performance of vehicular network is improved.

关键词： traffic information systems vehicular ad hoc networks integer programming optimal RSU placement optimisation constraints objective function vehicular environment coverage vehicular networks traffic information advertisement binary integer programming optimal road side unit placement model

来源：评论

学校读者我要写书评

暂无评论

A binary integer programming model for optimal load scheduling of household appliances with consumer's preferences

A binary integer programming model for optimal load scheduli...

引用

International Conference on the Domestic Use of Energy (DUE)

作者： Yahia, Zakaria Kholopane, Pule Univ Johannesburg Dept Qual & Operat Management Johannesburg South Africa

ISBN: (纸本)9781538667323;9780994675941

This paper addresses the residential demand response problem through the scheduling of typical home appliances while incorporating more realistic aspects. The objective of this study is to generate an optimal load schedule of home appliances with consumer's preferences, which includes preferred schedule for some appliances. To obtain an optimal load schedule of home appliances, a binary integer programming optimization model is proposed under a time-of-use electricity tariff. The proposed mathematical formulation is compared against a non-linear mathematical model formulation from the literature. The objective function minimizes the weighted score of electricity cost and earn the relevant incentive and the scheduling inconvenience. A case study shows that a household can shift consumption in response to the varying prices and incentives, through which the consumer may realize an electricity cost saving of around 55% compared to the preferred schedule defined by the consumer, and by around 31% compared to the schedule resulted from the non-linear model from the literature. Furthermore, the results show that the proposed binary model proves a significant superior performance, especially in terms of computation time.

关键词： binary integer programming Household appliances Household energy management Inconvenience Residential load scheduling

来源：评论

学校读者我要写书评

暂无评论

Application of binary integer programming for load transfer of distribution systems

Application of binary integer programming for load transfer ...

引用

International Conference on Power System Technology (POWERCON 2000)

作者： Chen, CS Kang, MS Hwang, JC Huang, CW Natl Sun Yat Sen Univ Dept Elect Engn Kaohsiung 80424 Taiwan

ISBN: (纸本)0780363388

This paper is to investigate the load transfer function of distribution automation project to be implemented in Taipower distribution system During the summer peak season, the main transformers of distribution substations in Taipower become over loaded due to the usage of air conditioners in the commercial and residential sections. The non-interruptible load transfer among distribution main transformers has to be executed for power reallocation to solve the problem. In this paper, the hourly loading of each service zone in the distribution system is determined by the load composition of the customers served within the service zone. The hourly current flows of line switches are derived by simplified three-phase load now analysis. Applying the binary integer programming (BIP) to solve the distribution system reconfiguration so that the load transfer among main transformers can be obtained derives the optimal switching operation. With the execution of the load transfer for Taipower distribution system by the proposed BIP method, the load balance among distribution main transformers during the summer peak hours is obtained. A Taipower distribution system with six feeders is selected for computer simulation to demonstrate the effectiveness of the proposed methodology.

关键词： load transfer distribution automation three phase load flow binary integer programming

来源：评论

学校读者我要写书评

暂无评论

A binary integer programming for Nurse Scheduling

A Binary Integer Programming for Nurse Scheduling

引用

Cairo International Biomedical Engineering Conference (CIBEC)

作者： Zen-El-Din, Wisam K. Kamel, Mohamed S. A. Mohamed, Abdalla S. A. Cairo Univ Fac Engn Syst & Biomed Eng Dept Giza 12211 Egypt

ISBN: (纸本)9781467328005;9781467327992

In this study, a computerized nurse scheduling model is developed. The model is approached through a binary integer programming. It is adapted to ICU in university educational hospital, New Kasr El-Eni in Cairo to improve the current manual-made schedules. The developed model accounts both for hospital objectives and nurses' preferences seniority.

关键词： binary integer programming nurse rostering shift schedules

来源：评论

学校读者我要写书评

暂无评论

Currency arbitrage detection using a binary integer programming model

Currency arbitrage detection using a binary integer programm...

引用

IEEE International Conference on Industrial Engineering and Engineering Management

作者： Soon, Wanmei Ye, Heng-Qing Nanyang Technol Univ Natl Inst Educ Math & Math Educ Acad Grp Singapore Singapore Natl Univ Singapore Fac Business Singapore 117548 Singapore

ISBN: (纸本)9781424415281

We introduce a binary integer programming model to detect arbitrage opportunities in currency exchanges. A network simplex method has been introduced to solve the model efficiently. Moreover, through sensitivity analysis, the solution to our model can be updated quickly to detect new arbitrage opportunities when the exchange rates change in real-time.

关键词： binary integer programming network simplex method currency arbitrage detection

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：