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

Wildlife reserve design with connectivity and buffer requirements

INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH 2024年第4期31卷 2231-2246页

作者： Patricio, Pedro Ferrao Univ Beira Interior Ctr Matemat & Aplicacoes Dept Matemat Rua Marques Avila & Bolama P-6201001 Covilha Portugal Univ Lisbon Ctr Matemat Aplicacoes Fundamentais & Invest Opera Fac Ciencias C6-Piso 1 Sala 6-1-03 P-1749016 Lisbon Portugal

This paper deals with the problem of finding the optimal configuration of a network of land parcels connecting and protecting core areas through corridors and buffer areas within budget. We focus on polynomial-sized integer linear programming formulations, building on previous research and borrowing some ideas from other authors. We establish the relationships between the proposed and past models in linear programming relaxation terms and test them on synthetic instances with up to 400 land parcels.

关键词： combinatorial optimization integer linear programming polynomial-sized formulations wildlife reserve design connectivity and buffer requirements

来源：评论

学校读者我要写书评

暂无评论

A Novel Reduced-Order Analytical Fault Diagnosis Model for Power Grid

引用

IEEE ACCESS 2024年 12卷 59521-59532页

作者： Lin, Zhuonan Wang, Yongxing Xu, Haoqian Wei, Fanrong Dalian Univ Technol Leicester Int Inst Panjin 124221 Peoples R China Dalian Univ Technol Sch Elect Engn Dalian 116023 Peoples R China China Three Gorges Univ Coll Elect Engn & New Energy Yichang 443002 Peoples R China Huazhong Univ Sci & Technol Sch Elect & Elect Engn Wuhan 430074 Peoples R China

Power grid fault diagnosis methods based on analytical models possess advantages such as logical rigor, strong interpretability, and high applicability. However, the existing design of their objective functions is presented as a 0-1 integer nonlinear programming model, making it difficult to approximate the optimal solution. To address this issue, this paper proposes an improvement to the expression of the second backup protection expectation involved in the diagnostic model. Thus, the order of the objective function is successfully reduced, transforming the original 0-1 integer nonlinear programming model into a constrained 0-1 integer linear programming model, which can be efficiently solved by typical commercial solvers based on a linear integer programming framework. Numerical results demonstrate that the solution time of the proposed linearized model is lower than that of existing nonlinear programming models, and the diagnostic accuracy of the proposed model is higher than that of other state-of-the-art methods.

关键词： Analytical models Circuit breakers fault diagnosis heuristic algorithms integer linear programming linearization techniques optimization methods power grids power system protection problem solving

来源：评论

学校读者我要写书评

暂无评论

Location and capacity allocation for emergency contact points in large-scale power outages

引用

CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH 2025年第1期33卷 241-276页

作者： Truden, Christian Wankmueller, Christian Zehetner, Dominik Gansterer, Margaretha Univ Klagenfurt Dept Operat Energy & Environm Management Univ Str 65-67 A-9020 Klagenfurt Austria

Nowadays, industry and individuals alike are highly dependent on a reliable power supply. A large-scale power outage, commonly known as a "blackout" is caused by natural disasters, cyber attacks, technical failure, or human errors, and can lead to a variety of severe consequences. The far-reaching dynamics of blackouts can even result in the collapse of critical public service infrastructure reliant on electricity (e.g., communication, water supply, medical services, public safety). Particularly, the loss of information and communication infrastructure essential to reporting medical emergencies, and the collapse of the drinking water supply are two critical stressors for the population to cope with. One attempt to tackle this situation is to install temporary emergency contact points (ECPs) into existing infrastructure. These can be approached by the population to communicate with medical personnel and to receive drinking water. Different types of professional personnel, which is a limited resource, are required to run such ECPs. Our study introduces this tactical decision problem. We formulate it as an integer linear program for the optimal spatial allocation of ECPs, such that multiple types of human resources that are required for operating such locations can be efficiently assigned. A comprehensive numerical study, based on data of the City of Vienna, demonstrates how to reduce the walking distance of inhabitants while increasing the efficiency of resource allocation. Matrix pruning based on an enforced limit of the walking distances together with a decomposition approach is utilized to solve the considered instances.

关键词： Large-scale power outage Blackout Facility location Resource allocation Demand estimation integer linear programming

来源：评论

学校读者我要写书评

暂无评论

V2VDisCS: Vehicle to Vehicle Distributed Charge Sharing in Intelligent Transportation Systems

引用

IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS 2025年第4期26卷 4960-4974页

作者： Chatterjee, Punyasha Majumder, Pratham Das, Sajal K. Jadavpur Univ Sch Mobile Comp & Commun Kolkata 700032 India Jain Deemed Univ Dept Informat Sci & Engn Bengaluru 560069 India Missouri Univ Sci & Technol Dept Comp Sci Rolla MO 65409 USA

Electric Vehicles (EVs) have become popular in the domain of Intelligent Transportation Systems for their ability to mitigate increasing environmental concerns by reducing carbon footprints and conserving fossil fuels. Due to the scarcity of static charging stations, Vehicle-to-Vehicle (V2V) charge sharing can facilitate the on-demand charging requirement of EVs. However, most of the V2V charge-sharing solutions are either centralized or semi-centralized, causing long waiting times, huge message overhead, and high infrastructural costs. For a large network, assigning a suitable donor EV for an acceptor EV as well as maximizing the matching cardinality in a distributed environment is a challenging problem. In this paper, the problem of V2V matching for charge sharing is mapped to the classical stable matching problem in bipartite graphs. The problem is formulated using integer linear programming that considers flexible decision making for EVs based on multiple charging criteria and constraints. However, as EVs have limited communication ranges, an EV can't possess knowledge about the entire vehicular network. So we propose two sets of distributed heuristics under the name of Vehicle to Vehicle Distributed Charge Sharing (V2VDisCS), which yield a sub-optimal solution with lower computational and message complexities compared to existing distributed solutions. We analyze the average case matching probabilities and prove the sub-optimality of our approach. Simulation studies show that our heuristics outperform the existing distributed approaches in terms of message overhead and matching percentage. They show a comparable result for matching preference with respect to the standard centralized stable matching algorithm.

关键词： Costs Charging stations Charge transfer Servers integer linear programming Electronic mail Electric vehicles Adaptation models Wireless communication Vehicular ad hoc networks Intelligent transportation system (ITS) electric vehicles (EVs) V2V charge sharing multi-criteria decision making integer linear programming distributed algorithm stable matching

来源：评论

学校读者我要写书评

暂无评论

Orbit-finite linear programming

引用

JOURNAL OF THE ACM 2025年第1期72卷 1-39页

作者： Ghosh, Arka Hofman, Piotr Lasota, Slawomir Univ Warsaw Dept Math Informat & Mech Warsaw Poland

An infinite set is orbit-finite if, up to permutations of atoms, it has only finitely many elements. We study a generalisation of linear programming where constraints are expressed by an orbit-finite system of linear inequalities. As our principal contribution we provide a decision procedure for checking if such a system has a real solution, and for computing the minimal/maximal value of a linear objective function over the solution set. We also show undecidability of these problems in case when only integer solutions are considered. Therefore orbit-finite linear programming is decidable, while orbit-finite integer linear programming is not.

关键词： Orbit-finite linear programming linear programming integer linear programming sets with atoms orbit-finite sets

来源：评论

学校读者我要写书评

暂无评论

A TOPSIS-based framework for construction projects' portfolio selection in the public sector

引用

ENGINEERING CONSTRUCTION AND ARCHITECTURAL MANAGEMENT 2025年第4期32卷 2553-2570页

作者： Nascimento, Claudia Rafaela Saraiva de Melo Simoes de Almeida-Filho, Adiel Teixeira Palha, Rachel Perez Univ Fed Pernambuco Dept Civil Engn Recife Brazil Univ Fed Pernambuco Dept Comp Sci Recife Brazil Univ Fed Pernambuco Ctr Tecnol & Geociencias Escola Engn Pernambuco Dept Civil & Environm Engn Recife Brazil

PurposeThis paper proposes selecting a construction project portfolio in the context of a public institution, which makes it possible to assess quantitative and qualitative criteria, thereby meeting the needs of the institution and the existing ***/methodology/approachThe research design follows a framework using technique for order preference by similarity to ideal solution (TOPSIS) associated with integer linear *** method involves a flow of assessments allowing criteria and weights to be elicited where outcomes are based on the experts' intra-criteria assessment of alternatives and decision-makers' inter-criteria assessment. This is of utmost interest to public organizations, where selections must result in benefits and lower costs, integrating the experts' technical and management *** implicationsPublic institutions are characterized by having limited financial and personnel resources for project development despite having a high demand for requests not associated with profits, making it essential to have a framework that enables using multiple criteria to better evaluate the benefits related to these ***/valueThe main contributions of this article are: (1) the proposition of a framework for selecting construction project portfolios considering the organization's strategic needs;(2) identifying quantitative and qualitative assessment criteria for project selection;(3) integrating TOPSIS with an optimization process for selecting the construction project portfolios and (4) providing a structured decision process for selecting the portfolio that best represents the interests of the institution within its limited resources and personnel.

关键词： TOPSIS integer linear programming Portfolio selection Public sector

来源：评论

学校读者我要写书评

暂无评论

Intelligent factory layout design framework through collaboration between optimization, simulation, and digital twin

引用

JOURNAL OF INTELLIGENT MANUFACTURING 2025年第3期36卷 1547-1561页

作者： Choi, Seon Han Kim, Byeong Soo Ewha Womans Univ Fac Elect & Elect Engn Seoul South Korea Seoul Natl Univ Sci & Technol Fac Appl Artificial Intelligence Seoul South Korea

In the era of the fourth industrial revolution, various internet and communications technologies (ICTs) are being applied to manufacturing systems. Based on these technologies, many companies utilize smart manufacturing systems to optimize the design and operation of their lines and to diagnose failures. To build and/or improve production lines, various computer-aided engineering (CAE) tools such as optimization solvers and simulation tools for validation are required. In addition, experts depend on their experience or utilize numerous trial and error processes, implying that a large time investment is required obtain the best layout design, without any guarantee that the result is in fact the best. Therefore, the paper proposes an integrated intelligent layout design framework that automatically derives an optimal layout according the requirements of the layout. The proposed framework uses mixed integer linear programming, simulation-based optimization, and digital twin to perform processes such as assembly line balancing, cell/buffer optimization, and layout planning sequentially and repeatedly to derive an optimal layout. By applying this, it is possible to automatically derive the optimal layout design considering limited resources and physical constraints. In addition, it can contribute to improving productivity and work efficiency at manufacturing sites.

关键词： Assembly line layout Digital twin integer linear programming Intelligent manufacturing systems Simulation-based optimization

来源：评论

学校读者我要写书评

暂无评论

A Novel Approximation Algorithm for the Shortest Vector Problem

引用

IEEE ACCESS 2024年 12卷 141026-141031页

作者： Ajitha Shenoy, K. B. Manipal Acad Higher Educ Manipal Inst Technol Dept Informat & Commun Technol Manipal 576104 Karnataka India

Finding the shortest vector in a lattice is a NP-hard problem. The best known approximation alpha(n-1/2), alpha >= 4/3, which is not algorithm for this problem is LLL algorithm with the approximation factor of alpha a good approximation factor. This work proposes a new polynomial time approximation algorithm for the shortest lattice vector problem. The proposed method makes use of only integer arithmetic and does not require Gram-Schmidt orthogonal basis for generating reduced basis. The proposed method is able to obtain an approximation factor of 1/(1-delta), where 0 <= delta < 1.

关键词： Vectors Approximation algorithms Lattices Polynomials Numerical analysis NP-hard problem Object recognition integer linear programming Indexes Computational complexity Lattice reduced basis shortest vector problem approximation algorithm computational complexity

来源：评论

学校读者我要写书评

暂无评论

Network design with vulnerability constraints and probabilistic edge reliability

引用

NETWORKS 2024年第2期84卷 181-199页

作者： Arslan, Okan Laporte, Gilbert HEC Montreal CIRRELT GERAD 3000 Chemin Cote St Catherine Montreal PQ H3T 2A7 Canada HEC Montreal Dept Decis Sci 3000 Chemin Cote St Catherine Montreal PQ H3T 2A7 Canada Univ Bath Sch Management Bath England

The network design problem with vulnerability constraints and probabilistic edge reliability (NDPVC-PER) is an extension of the NDPVC obtained by additionally considering edge reliability. We consider the design of a telecommunication network in which every origin-destination pair is connected by a hop-constrained primal path, and by a hop-constrained backup path when certain edges in the network fail. The edge failures occur with respect to their reliability, and the network is designed by considering a minimum reliability level. Therefore, a hop-constrained backup path must be built by considering all simultaneous edge failures that have a certain probability of realization. While there exist models to solve the NDPVC without enumerating all edge subsets, edge reliability cannot be dealt with by applying the techniques applied to the NDPVC. Therefore, we develop models based on a new concept of resilient length-bounded cuts, and solve the NDPVC-PER without edge set enumerations. We perform extensive testing of the model to determine the best performing settings, and demonstrate the computational efficiency of the developed model. Our findings on these instances show that, in the dataset considered in this study, increasing the reliability level from 90% to 95% increases the average cost only by 12.4%, while increasing it from 95% to 99% level yields a cost increase of 93.9%.

关键词： integer linear programming length-bounded cut network design reliability resilient length-bounded cut survivability vulnerability

来源：评论

学校读者我要写书评

暂无评论

A tactical carcass optimisation tool for assisting boning room managers to increase boning room profit

引用

MEAT SCIENCE 2025年 220卷 109690页

作者： Wang, Guangsong Costa, Andre Flanigan, Dale Smith, Chris Preston, Farrah Miller, Sean M. Meehan, Daniel Pitchford, Wayne S. Univ Adelaide Teletraff Res Ctr Adelaide SA 5005 Australia Univ Adelaide Davies Livestock Res Ctr Roseworthy SA 5371 Australia Meat Data Log Horsham Vic 3400 Australia Agbiz Solut Natimuk Vic 3409 Australia Meehan AgriBusiness Solut Brisbane Qld 4000 Australia

In collaboration with Australian lamb supply chains, an integer linear programming model was developed for use by processors to optimally allocate carcasses to different cutting plans for implementation in a boning room on a daily or lot basis. This tactical carcass optimisation tool (TCOT) addresses the daily challenge of developing operational plans to process carcasses into products whilst maximising profitability subject to constraints on carcass availability, variability of carcass weight and fatness, number of product orders, product size and retail prices. Predicted weights for all available products were derived from cut-weight prediction algorithms established from the combination of carcass weight and fatness ranges. Carcass fatness was expressed as lean meat yield percentage (LMY%) and measured using dual-energy X-ray absorptiometry (DXA) of hot carcasses immediately after slaughter. The TCOT utilises a group-based labour cost model which closely aligns with real-world supply chain practices. The function and application of the optimisation tool were tested in two contrasting case studies. The first case study demonstrated the ability of the optimiser to allocate carcasses to optimal cutting plans based on carcass weight and LMY%. The second case study examined the potential value of the tool for processors supplying lamb into the Australian domestic lamb market and subject to the constraints applied, demonstrated opportunities to increase profitability by at least 1 % compared to current best practice. This work provides a pathway whereby objective carcass measurement technology, combined with carcass sortation and optimisation algorithms, can be leveraged to improve profitability for lamb supply chains.

关键词： integer linear programming Optimisation Objective carcass measurement Lamb processing Meat production planning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：