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

A mathematical programming approach for a wildfire suppression problem

OPERATIONAL RESEARCH 2025年第1期25卷 1-27页

作者： Granda, Bibiana Vitoriano, Begona Figueira, Jose Rui Interdisciplinary Math Inst IMI HUMLOG Res Grp Plaza Ciencias 3 Madrid 28040 Spain Univ Lisbon CEGIST Inst Super Tecn P-1049001 Lisbon Portugal

Wildfires are natural recurrent events, that may be devastating if not addressed correctly. In these situations, where quick and accurate decisions are needed, Operational Research can be helpful for providing fast and robust solutions. This paper focuses on the response actions taken during the suppression stage of a wildfire. A mixed integer linear programming model is proposed to obtain a wildfire suppression strategy, including the wildfire behaviour changes induced by the solution. The selected wildfire suppression strategy is modelled in detail, pointing out which locations to control and their timing, based on available paths between them, avoiding engagement in dangerous situations. A computational study is carried out to determine the most suitable solver to provide exact solutions of the model. Also, a two-stage version of the model is proposed to deal with the multicriteria nature of the problem. A case study is also included to validate the model's applicability, which is solved using the two proposed versions of the model and an iterative approach to compare their performance.

关键词： Wildfire management Wildfire suppression Optimization mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Rail freight transportation service network design with mixed blocking policies: Formulation and solution methods

引用

JOURNAL OF RAIL TRANSPORT PLANNING & MANAGEMENT 2025年 33卷

作者： Xin, Xiaoyu Wu, Xu Wang, Jiaxi Beijing Jiaotong Univ Sch Traff & Transportat Beijing Peoples R China Zhejiang Lab Res Ctr High Efficiency Comp Syst Hangzhou Zhejiang Peoples R China

In the current China railway system, the freight transportation service network is demand category oriented and is designed by using a hierarchical approach. This simplifies the design procedure, but reduces the flexibility and optimality of the plan. To make full use of the limited railway capacity and to improve the service flexibility and quality, this paper addresses the freight service network design problem with simultaneous consideration of mixed blocking policies and mixed service classes for heterogeneous demands. A mixed integer linear programming model is developed for the problem to maximize the operator's total transportation profit. Furthermore, a two-stage decomposition framework is proposed to solve the optimization model, where both exact and heuristic algorithms are employed. Extensive computational experiments on artificial and real-world instances indicate that the proposed solution approaches can generate high-quality solutions within reasonable time frame. Moreover, the mixed blocking policies could attract more freight demands and tend to result in higher profits, compared to the single blocking policy.

关键词： Rail freight transportation Network design Blocking policy mixed integer linear programming Lagrangian relaxation

来源：评论

学校读者我要写书评

暂无评论

On-Demand Urban Air Mobility Scheduling with Operational Considerations

引用

JOURNAL OF AEROSPACE INFORMATION SYSTEMS 2025年第5期22卷 401-411页

作者： Ko, Jaeyoul Ahn, Jaemyung Korea Adv Inst Sci & Technol Dept Aerosp Engn 291 Daehak Ro Daejeon 34141 South Korea

This paper introduces an on-demand sequencing and scheduling framework for Urban Air Mobility (UAM) with electric vertical takeoff and landing (eVTOL) aircraft. Safety and efficiency, considering factors such as battery state of charge and charging infrastructure, are critical factors for UAM operations. A new scheduling framework integrating considerations for battery consumption, parking and charging infrastructure, vertiport throughput, and fleet heterogeneity to maximize the operational efficiency of the eVTOL UAM fleet is proposed. A solution methodology utilizing a genetic algorithm and receding horizon scheduling achieves near-optimal solutions with an average optimality gap of 5.8% and a runtime of less than 1 min for dynamic scheduling. A case study based on the 2024 Paris Olympic air taxi operations demonstrates the efficacy of the proposed problem formulation and solution method.

关键词： Urban Air Mobility Genetic Algorithm Charles De Gaulle Airport mixed integer linear programming Vertical Takeoff and Landing

来源：评论

学校读者我要写书评

暂无评论

Virtual Target Selection for a Multiple-Pursuer-Multiple-Evader Scenario

引用

JOURNAL OF AEROSPACE INFORMATION SYSTEMS 2025年第5期22卷 391-400页

作者： Weintraub, Isaac E. Von Moll, Alexander Casbeer, David W. Manyam, Satyanarayana G. Air Force Res Lab Control Sci Ctr Wright Patterson AFB OH 45433 USA InfoSciTex Corp 4027 Col Glenn Hwy Dayton OH 45431 USA

This paper considers an N-pursuer-M-evader scenario involving L virtual targets. The virtual targets serve as an intermediary target for the pursuers, allowing the pursuers to delay their final assignment to the evaders. However, upon reaching the virtual target, the pursuers must decide which evader to capture. It is assumed that there are more pursuers than evaders and that the pursuers are faster than the evaders. The objective is two-part: first, assign each pursuer to a virtual target and evader such that the pursuer team's energy is minimized, and, second, choose the virtual targets' locations for this minimization problem. The approach taken is to consider the Apollonius geometry between each pursuer's virtual target location and each evader. Using the constructed Apollonius circles, the pursuer's travel distance and maneuver at a virtual target are obtained. These metrics serve as a gauge for the total energy required to capture a particular evader and are used to solve the joint virtual target selection and pursuer-evader assignment problem. This paper provides a mathematical definition of this problem, the solution approach taken, and an example. Following the example, a Monte Carlo analysis is performed, demonstrating the efficacy of the algorithm and its suitability for real-time applications.

关键词： mixed integer linear programming Optimal Control Theory Optimization Algorithm Weapon Target Assignment Monte Carlo Analysis Guidance, Navigation, and Control Systems Missile Defense

来源：评论

学校读者我要写书评

暂无评论

AccMILP: An Approach for Accelerating Neural Network Verification Based on Neuron Importance 28th

AccMILP: An Approach for Accelerating Neural Network Verific...

引用

28th International Conference on Engineering of Complex Computer Systems (ICECCS)

作者： Zheng, Fei Xu, Qingguo Lei, Zhou Miao, Huaikou Shanghai Univ Sch Comp Engn & Sci Shanghai Peoples R China Shanghai Key Lab Comp Software Evaluating & Testi Shanghai Peoples R China

ISBN: (纸本)9783031664557;9783031664564

Deep Neural Networks (DNNs) have found successful applications in various non-safety-critical domains. However, given the inherent lack of interpretability in DNNs, ensuring their prediction accuracy through robustness verification becomes imperative before deploying them in safety-critical applications. Neural Network Verification (NNV) approaches can broadly be categorized into exact and approximate solutions. Exact solutions are complete but time-consuming, making them unsuitable for large network architectures. In contrast, approximate solutions, aided by abstraction techniques, can handle larger networks, although they may be incomplete. This paper introduces AccMILP, an approach that leverages abstraction to transform NNV problems into mixed integer linear programming (MILP) problems. AccMILP considers the impact of individual neurons on target labels in DNNs and combines various relaxation methods to reduce the size of NNV models while ensuring verification accuracy. The experimental results indicate that AccMILP can reduce the size of the verification model by approximately 30% and decrease the solution time by at least 80% while maintaining performance equal to or greater than 60% of MIPVerify. In other words, AccMILP is well-suited for the verification of large-scale DNNs.

关键词： Neural network Formal verification mixed integer linear programming Neuron importance

来源：评论

学校读者我要写书评

暂无评论

Assignment strategy and lane depth in homogeneous multi-deep shuttle-based S/R systems

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2025年

作者： Lupi, Giacomo Accorsi, Riccardo Battarra, Ilaria Guidani, Beatrice Manzini, Riccardo Sirri, Gabriele Univ Bologna Dept Ind Engn Bologna Italy

An automated vehicle storage and retrieval system (AVS/RS) is a widely used warehouse solution that adopts automated technologies to store and retrieve palletised unit loads. Several factors affect the performance of such shuttle-based systems in terms of productivity and space efficiency. This study focuses on the best achievable performance of nominal storage capacity saturation via assignment strategy selection and lane depth determination. These are the crucial aspects to consider when designing and configuring a homogeneous AVS/RS, where homogeneity means that the generic storage lane hosts unit loads (UL) of the same item. This study aims to introduce and apply an original mixed-integer linear programming model to optimise the space efficiency and storage capacity of a multi-deep tier-captive AVS/RS. A time-splitting methodology is introduced to obtain solutions for real applications. A multi-scenario analysis conducted on a case study demonstrates the effectiveness of the proposed model and solution methods.

关键词： Automated warehouses Multi-deep AVS/RS Assignment strategy Lane depth mixed integer linear programming Performance analysis

来源：评论

学校读者我要写书评

暂无评论

A multi-echelon closed-loop supply chain model with multi-recovery systems and carbon regulation

SUPPLY CHAIN ANALYTICS

引用

SUPPLY CHAIN ANALYTICS 2025年 10卷

作者： Harefah, Dimas Nurbani Jauhari, Wakhid Ahmad Rosyidi, Cucuk Nur Utama, Dana Marsetiya Univ Sebelas Maret Dept Ind Engn Surakarta Indonesia Univ Muhammadiyah Malang Dept Ind Engn Malang Indonesia

This study develops a multi-echelon closed-loop supply chain (CLSC) optimization model for durable products by considering refurbishment, recycling processes, and carbon regulation. A mixed integer linear programming (MILP) is developed for CLSC network design involving suppliers, manufacturers, refurbishment centers, recycling centers, disposal centers, assembly centers, collection centers, and retailers. A carbon cap-and-trade policy is adopted to lessen the emissions emitted from some activities in CLSC. The objectives of the study are to determine the optimal allocations of echelons and to investigate the influences of collection rate, refurbishment rate, recycling rate and carbon policy on CLSC. A numerical example is presented to illustrate the application of the proposed model, and a sensitivity analysis is provided to investigate the effect of key parameters on the model's behavior and system performance. The results show that the changes in collection, refurbishment, and recycling rates significantly influence the optimal allocation decisions. The results also show that by adopting a carbon cap-and-trade policy, CLSC can benefit both economically and environmentally. However, the level of benefits obtained will depend significantly on the size of the carbon cap and the selling or buying price of carbon in the market.

关键词： Closed-loop supply chain mixed integer linear programming Carbon cap-and-trade Refurbishment Recycling Durable products

来源：评论

学校读者我要写书评

暂无评论

Strategic Optimization of Electric Vehicle Charging Station Placement in Romania

引用

Operations Research Forum 2025年第2期6卷 1-17页

作者： Popa, Alexandru Sîrbu, Tiberiu-Iulian Department of Computer Science University of Bucharest Regina Elisabeta Bld. Bucharest 030018 Romania

The article studies a variant of the facility location problem applied for electric vehicle charging station infrastructure in Romania. The best places are chosen from the locations without a charging station to minimize a combination between the maximum distance from a location without a charging station to the closest location with a charging station, the total electricity consumption of each location, the CO2 emission for each city based on the electrical grid configuration, and the electric vehicles penetration rate for respective locations. A formulation using mixed integer linear programming is presented, along with the results of the conducted simulations. © The Author(s) 2025.

关键词： Facility location problem Infrastructure planning mixed integer linear programming Optimization

来源：评论

学校读者我要写书评

暂无评论

Solving an Integrated Project Portfolio Selection and Contractor Selection Problem: Fuzzy Goal programming Based on Fuzzy Preference Relations

引用

FUZZY INFORMATION AND ENGINEERING 2025年第1期17卷 75-107页

作者： Zahedirad, Mostafa Khalili-Damghani, Kaveh Ghezavati, Vahidreza Komijan, Alireza Rashidi Islamic Azad Univ Dept Ind Engn South Tehran Branch Tehran *** Iran Islamic Azad Univ Dept Ind Engn Sci & Res Branch Tehran *** Iran

Several factors affect the flexibility and the complexity of the project selection and the contractor selection problems. Project portfolio managers are expected to select the best combination of projects and contractors considering multiple conflicting objectives in a multi-period planning horizon. In this paper, we propose an integrated project portfolio optimization and contractor selection problem. The problem is modeled through a multi-objective mixed integer linear programming (MILP) model. Three solution approaches including Goal programming (GP), Fuzzy Goal programming (FGP), and fuzzy goal programming considering a fuzzy preference relationship are proposed. All solution approaches have been applied to a real case. The computational results show the out performance of FGP considering fuzzy relations. The time complexity of the proposed models in the sense of the relation of CPU time and the number constraints and variables of the models were discussed.

关键词： integer programming Computational modeling programming Planning mixed integer linear programming Complexity theory Time complexity Portfolios Optimization project selection contractor selection multi-objective mixed integer programming goal programming fuzzy goal programming fuzzy preference relation

来源：评论

学校读者我要写书评

暂无评论

Job shop planning and scheduling of reconfigurable manufacturing systems

引用

OPERATIONS MANAGEMENT RESEARCH 2025年 1-22页

作者： Imsetif, Jad Nezamoddini, Nasim Aqlan, Faisal Oakland Univ Ind & Syst Engn 115 Lib Dr Rochester MI 48309 USA Univ Louisville Dept Ind Engn 132 Eastern Pkwy Louisville KY 40292 USA

The fourth industrial revolution (Industry 4.0) has enabled rapid product variations and technological developments such as reconfigurable manufacturing systems (RMSs). Planning and scheduling in RMS differ from traditional systems;therefore, the manufacturing industry has faced implementation barriers. This research proposes a new mixed-integer linear programming (MILP) formulation for process planning and scheduling in RMSs. The formulation, considers new aspects such as number of products, their quantity and complexity, calibration rate, work-in-process (WIP), and inventory management. Moreover, this research promotes RMS effectiveness for business and provides new insights on the effects of different factors on the overall performance. The applicability of the proposed formulation is illustrated with a case study. The results showed that RMS outperforms a traditional system with 30% savings in cost and up to a 25% increase in demand fulfillment. Sensitivity analyses are conducted to investigate the effect of different parameters on the cost-effectiveness of RMS compared to traditional manufacturing systems. Analysis of variance (ANOVA) highlighted the importance of the reconfigurability of the machines compared to other settings

关键词： Reconfigurable manufacturing systems mixed integer linear programming Optimization Sensitivity analyses Cost effectiveness

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：