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

Balanced scheduling for medical waste treatment in public health emergencies via Simulation-Driven Mixed integer linear programming

引用

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY 2024年

作者： Feng, Hui Mu, Renyan Wu, Lei Li, Yirong Wuhan Univ Technol Sch Management Wuhan Peoples R China Zhongnan Univ Econ & Law Sch Publ Finance & Taxat Wuhan 430073 Peoples R China Zhongnan Univ Econ & Law Wenlan Sch Business Wuhan Peoples R China

This study introduces a Simulation-Driven Mixed integer linear programming (SD-MILP) model developed to optimize the scheduling of medical waste treatment during emergencies. Our approach integrates simulation to reflect the complexities of the real world, providing solutions that are adaptable to dynamic conditions. Initially, we formulate the problem using an MILP model to optimize waste allocation and alleviate operational pressures. We then incorporate a simulation mechanism within the MILP framework, which simulates waste generation to address uncertainties in epidemic transmission and the rehabilitation process. Through computational experiments conducted on benchmark instances, we evaluate the model's performance. The results confirm its efficacy in reducing waste treatment costs, including transportation, fixed expansion costs and temporary overload operating costs at treatment stations, while ensuring equitable load distribution among treatment stations.

关键词： Balanced scheduling medical waste treatment integer linear programming simulation optimization

来源：评论

学校读者我要写书评

暂无评论

A new cutting plane method for lexicographic multi-objective integer linear programming

引用

COMMUNICATIONS IN NONlinear SCIENCE AND NUMERICAL SIMULATION 2024年 129卷

作者： Cococcioni, Marco Cudazzo, Alessandro Fiaschi, Lorenzo Pappalardo, Massimo Sergeyev, Yaroslav D. Univ Pisa Dipartimento Ingn Informaz Largo Lucio Lazzarino 1 I-56122 Pisa Italy Univ Pisa Dipartimento Informat Largo Bruno Pontecorvo 3 I-56127 Pisa Italy Univ Calabria Arcavacata Di Rende CS Italy Lobachevsky State Univ Nizhni Novgorod Nizhnii Novgorod Russia

This work presents a new cutting plane method for lexicographic multi-objective integer linear programming (LMOILP). The method uses Grossone Methodology to reformulate a LMOILP problem into one having a single scalar objective function involving Grossone, as done in Cococcioni et al. (2018) (but in that case in the absence of the integer constraints). The problem, without the integer constraints, is solved using the GrossSimplex algorithm presented in Cococcioni et al. (2018) to find a candidate optimal solution. Here a novel cutting plane is introduced, named Gross-based Objective Function Cutting Plane whenever the optimal value of the Gross-scalar objective function is Gross-fractional. When it happens to be not Gross-fractional, cutting planes are generated using the Fractional Cutting Plane, derived from fractional components of the optimal solution. Moreover, by combining them, we proposed an algorithm that we called Gross-based Cutting Plane (GCP) method. It has been proved that it finds the optimal solution of a LMOILP problem and terminates after a finite number of iterations. To speed-up the GCP, at each iteration subsequent the first one, we re-use the optimal basis of the last continuous relaxation, by running the GrossDualSimplex algorithm. This is the well-known warm-start technique, which, however, needs specific attention due to the need to solve a linear problem having a right-hand side involving Grossone-based numbers. In the experimental part, we show the efficacy of the proposed approach.

关键词： Multi-objective optimization Lexicographic optimization integer linear programming Numerical infinitesimals Grossone methodology Cutting plane

来源：评论

学校读者我要写书评

暂无评论

Enhanced conflict-aware iterated integer linear programming for IEEE 802.1Qbv Time-Sensitive Network scheduling

引用

INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS 2024年第17期37卷

作者： Ozkan, Aziz Kerem Cevher, Selcuk Karadeniz Tech Univ Comp Engn Dept TR-61080 Trabzon Turkiye

Deterministic communication plays a crucial role for real-time distributed embedded systems by guaranteeing a low end-to-end delay and minimal jitter. Conflict-aware iterated ILP-based scheduling (IIS) is an incremental approach to enhance the scalability of single-shot ILP computation to solve the computationally hard Qbv-compliant offline scheduling problem for IEEE 802.1 Time-Sensitive Networking (TSN). Taking into account the conflicting demands of the streams, IIS computes no-wait schedules by dividing the set of streams into disjoint partitions, each of which is incrementally scheduled by an ILP solver. In this work, defining the no-wait communication constraints for TSN scheduling, we propose a novel iterated scheduling approach, namely, O-IIS, with a backtracking mechanism and partial solution support extending the conventional IIS procedure. O-IIS relies on an ordering strategy to determine the order in which the constructed partitions will be processed by an ILP solver. We evaluate the performance of our approach in terms of schedulability success rate and schedule synthesis time using various network topologies and different partitioning schemes to construct the partitions. The evaluation results show that our approach provides significantly better scheduling performance compared to the existing work in the literature. Conflict-aware iterated ILP-based scheduling is an incremental approach to enhance the scalability of single-shot ILP computation to solve the computationally hard Qbv-compliant offline scheduling problem for IEEE 802.1 Time-Sensitive Networking (TSN). In this work, we propose a novel iterated scheduling approach with a backtracking mechanism and partial solution support extending the conventional procedure. Evaluation results show that our approach provides a significantly better scheduling performance compared to the existing work in the literature. image

关键词： incremental scheduling integer linear programming Time-Sensitive Network

来源：评论

学校读者我要写书评

暂无评论

Non-interference assessment in colored net systems via integer linear programming

引用

INFORMATION SCIENCES 2024年 658卷

作者： Zhong, Wenjing Zhao, Jinjing Hu, Hesuan Xidian Univ Sch Electromech Engn Xian 710071 Shaanxi Peoples R China Natl Key Lab Sci & Technol Informat Syst Secur Beijing 100101 Peoples R China Nanyang Technol Univ Coll Engn Sch Comp Sci & Engn Singapore 639798 Singapore Xi An Jiao Tong Univ State Key Lab Mfg Syst Engn Xian 710049 Shaanxi Peoples R China

Event-related information leaks are a potential security hazard in information systems. Non-interference is a security property to describe event-related information security. Non-interference assessment is to detect whether a public observer can infer the occurrences of private events from the observation of public ones. To assess the non-interference of information systems, the utilization of formal modeling tools, especially Petri nets (PNs), is an effective way used in most previous works. However, for large-scale systems, non-interference assessment leads to the problem of state explosion in the context of basic net systems (NSs) defined by PNs. In this paper, considering the structural similarity of large-scale systems, colored PNs are used to model them more compactly and efficiently. We focus on the assessment of two typical non-interference properties, i.e., strong nondeterministic non-interference (SNNI) and bisimulation SNNI (BSNNI), in colored NSs (CNSs). Specifically, we propose a non-interference assessment method for bounded CNSs based on the definitions of SNNI and BSNNI in the context of CNSs. This method involves coarse and fine assessments. A coarse assessment is achieved via integer linear programming (ILP) by leveraging the structural similarity of systems. In contrast, the fine assessment can be fulfilled using ILP-based analysis or firing way analysis based on the results obtained by the coarse assessment, which is not essentially necessary. In particular, a fine assessment is necessary only if a coarse assessment is failed to obtain accurate assessment results. Finally, efficiency analysis reveals that our method reduces assessment redundancy and improves assessment efficiency.

关键词： Information leak Non-interference Colored net systems (CNSs) integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Using integer linear programming for correctly rounded multipartite architectures 21

Using integer linear programming for correctly rounded multi...

引用

21st International Conference on Field-Programmable Technology (ICFPT)

作者： Desrentes, Oregane de Dinechin, Florent Ecole Normale Super Lyon Lyon France Univ Lyon INSA Lyon INRIA CITI Lyon France

ISBN: (数字)9781665453363

ISBN: (纸本)9781665453363

This article introduces several improvements to the multipartite method, a generic technique for the hardware implementation of numerical functions. A multipartite architecture replaces a table of value with several tables and an adder tree. Here, the optimization of multipartite tables is formalized using integer linear programming so that generic ILP solvers can be used. This improves the quality of faithfully rounded architectures compared to the state of the art. The proposed approach also enables correctly rounded multipartite architectures, providing errorless table compression. This improves the area by a factor 5 without any performance penalty compared with the state of the art in errorless compression. Another improvement of the proposed work is a cost function that attempts to predict the total cost of an architecture in FPGA architectural LUTs, where most of the previous works only count the size of the tables, thus ignoring the cost of the adder tree.

关键词： Costs integer linear programming linear programming Cost function Hardware Table lookup Field programmable gate arrays

来源：评论

学校读者我要写书评

暂无评论

Adaptive integer linear programming Model for Optimal Qubit Permutation

IEEE DESIGN & TEST

引用

IEEE DESIGN & TEST 2021年第4期38卷 78-84页

作者： de Almeida, Alexandre A. A. Dueck, Gerhard W. Sao Paulo State Univ UNESP Sch Engn BR-01049010 Sao Paulo Brazil Univ New Brunswick Fac Comp Sci Fredericton NB E3B 5A3 Canada

Editor's notes: Quantum computer performance is often limited by the maximum number of pairs of qubits that can interact. This article expresses the problem in terms of integer linear programming, showing that in this way we can identify an optimal solution. -Marcelo Lubaszewki, Universidade Federal do Rio Grande do Sul -Matteo Sonza Reorda, Politecnico di Torino

关键词： Logic gates Qubit Integrated circuit modeling Quantum circuit Manganese Computer architecture Mathematical model integer linear programming IBM quantum processors quantum circuits reversible circuits

来源：评论

学校读者我要写书评

暂无评论

An Efficient Fault Diagnosis Approach Based on integer linear programming for Labeled Petri Nets

引用

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2021年第5期66卷 2393-2398页

作者： Zhu, Guanghui Feng, Lei Li, Zhiwu Wu, Naiqi Macau Univ Sci & Technol Inst Syst Engn Taipa 999078 Macao Peoples R China Macau Univ Sci & Technol Collaborat Lab Intelligent Sci & Syst Taipa 999078 Macao Peoples R China Aix Marseille Univ Univ Toulon LIS CNRS F-13007 Marseille France KTH Royal Inst Technol Dept Machine Design S-10044 Stockholm Sweden Xidian Univ Sch Electromech Engn Xian 710071 Peoples R China Guangdong Univ Technol State Key Lab Precis Elect Mfg Technol & Equipmen Guangzhou 510006 Peoples R China

In this article, we present a fault diagnosis approach for discrete event systems using labeled Petri nets. In contrast to the existing works, a new fault class containing all the fault transitions is additionally introduced in the diagnosis function, leading to a more informative and precise diagnosis result. An integer linear programming (ILP) problem is built according to an observed word. By specifying different objective functions to the ILP problem, the diagnosis result is obtained without enumerating all observable transition sequences consistent with the observed word, which is more efficient in comparison with the existing ILP-based approaches.

关键词： Petri nets Fault diagnosis integer linear programming Discrete-event systems Labeling linear programming Modeling Discrete event system fault diagnosis integer linear programming (ILP) Petri net

来源：评论

学校读者我要写书评

暂无评论

Iterative integer linear programming-based heuristic for solving the multiple-choice knapsack problem with setups

引用

EXPERT SYSTEMS WITH APPLICATIONS 2024年 242卷

作者： Adouani, Yassine Masmoudi, Malek Jarray, Fethi Jarboui, Bassem Univ Sfax Lab MODILS Sfax Tunisia Univ Sharjah Coll Engn Sharjah U Arab Emirates Univ Jean Monnet St Etienne France Univ Tunis El Manar LIMTIC Lab El Manar Tunisia Univ Polytech Hauts De France LAMIH CNRS UMR 8201 F-59313 Valenciennes France

This paper studies the multiple-choice knapsack problem with setup (MCKS) which is a generalization of the knapsack problem with setup (KPS) where the items can be processed in multiple periods. The integer linear programming (ILP) of the MCKS shows its limitations when solved using CPLEX 12.7 solver, and the existing algorithms VNS&IP and VND-LB from the literature outperform the ILP and provide the best-known solutions but solve to optimality only 29 out of 120 instances, respectively. This paper is dedicated to exposing an Iterative integer linear programming-based heuristic (IILP-H) that deals with the MCKS. The IILP-H has been experimented on the MCKS benchmark instances. A sensitivity analysis of the MCKS parameters is provided. A comparison of the IILP-H with the upper bound obtained by the CPLEX 12.7 solver and the best state-of-the-art algorithms has been conducted. The numerical results show that the IILP-H outperforms all the existing solving techniques when it comes to solution quality and computation time. It reaches 120 out of 120 best solutions, including 77 out of 120 optimal and 69 new best solutions. The complexity of the MCKS and the nature of the solutions obtained by the IILP-H are studied regarding the number of periods to which a family is assigned.

关键词： Knapsack Problem with setup Multiple-Choice Knapsack Problem with Setups integer linear programming Iterative integer linear programming Heuristic approach

来源：评论

学校读者我要写书评

暂无评论

Topology optimization for stationary fluid-structure interaction problems with turbulent flow via sequential integer linear programming and smooth explicit boundaries

引用

ADVANCES IN ENGINEERING SOFTWARE 2024年 190卷

作者： Siqueira, Lucas O. Cortez, Romulo L. Sivapuram, Raghavendra Ranjbarzadeh, Shahin Gioria, Rafael dos S. Silva, Emilio C. N. Picelli, Renato Univ Sao Paulo Dept Mechatron & Mech Syst Engn Polytech Sch Ave Prof Mello Moraes 2231 BR-05508030 Sao Paulo SP Brazil Univ Sao Paulo Dept Naval Architecture & Ocean Engn Polytech Sch Ave Prof Mello Moraes 2231 BR-05508030 Sao Paulo SP Brazil Univ Calif San Diego Struct Engn Dept San Diego CA USA Univ Sao Paulo Dept Min & Petr Engn Polytech Sch Ave Prof Mello Moraes 2231 BR-05508030 Sao Paulo SP Brazil

Topology optimization methods face serious challenges when applied to structural design with fluid-structure interaction (FSI) loads, especially for high Reynolds fluid flow, i.e., considering turbulence. In this problem, the information at the fluid-structure interface is crucial for the modeling and convergence of the turbulent fluid flow analysis. This paper devises a new explicit boundary method that generates two- and three-dimensional smooth surfaces to be used in topology optimization with binary {0,1} design variables. A phase-field function is obtained after nodal spatial filtering of the design variables. The 0.5 isoline defines a smooth surface to construct the topology. The FSI problem can then be modeled with accurate physics and explicitly defined regions. The Finite Element Method is used to solve the fluid and structural domains. This is the first work to consider a turbulent flow in the fluid-structure topology optimization framework. The fluid flow is solved considering the �� - �� turbulence model including standard wall functions at the fluid and fluid-structure boundaries. The structure is considered to be linearly elastic. Semi-automatic differentiation is employed to compute sensitivities and the optimization problem is solved via sequential integer linear programming. Results show that the proposed methodology is able to provide structural designs with smooth boundaries considering loads from low and high Reynolds flow.

关键词： Topology optimization Fluid-structure interaction integer linear programming Turbulence High Reynolds flow

来源：评论

学校读者我要写书评

暂无评论

CDPath: Cooperative Driver Pathways Discovery Using integer linear programming and Markov Clustering

引用

IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS 2021年第4期18卷 1384-1395页

作者： Yang, Ziying Yu, Guoxian Guo, Maozu Yu, Jiantao Zhang, Xiangliang Wang, Jun Shandong Univ Sch Software Jinan 250101 Peoples R China Beijing Univ Civil Engn & Architecture Sch Elect & Informat Engn Beijing 100044 Peoples R China North West A&F Univ Coll Informat Engn Xianyang Shaanxi Peoples R China King Abdullah Univ Sci & Technol Comp Elect & Math Sci & Engn Div Thuwal Saudi Arabia

Discovering driver pathways is an essential task to understand the pathogenesis of cancer and to design precise treatments for cancer patients. Increasing evidences have been indicating that multiple pathways often function cooperatively in carcinogenesis. In this study, we propose an approach called CDPath to discover cooperative driver pathways. CDPath first uses integer linear programming to explore driver core modules from mutation profiles by enforcing co-occurrence and functional interaction relations between modules, and by maximizing the mutual exclusivity and coverage within modules. Next, to enforce cooperation of pathways and help the follow-up exact cooperative driver pathways discovery, it performs Markov clustering on pathway-pathway interaction network to cluster pathways. After that, it identifies pathways in different modules but in the same clusters as cooperative driver pathways. We apply CDPath on two TCGA datasets: breast cancer (BRCA) and endometrial cancer (UCEC). The results show that CDPath can identify known (i.e., TP53) and potential driver genes (i.e., SPTBN2). In addition, the identified cooperative driver pathways are related with the target cancer, and they are involved with carcinogenesis and several key biological processes. CDPath can uncover more potential biological associations between pathways (over 100 percent) and more cooperative driver pathways (over 200 percent) than competitive approaches. The demo codes of CDPath are available at http://***/***?name=CDPath.

关键词： Cancer Markov processes Proteins integer linear programming Genomics Bioinformatics Cooperative driver pathway data fusion integer linear programming markov clustering

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：