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

An Improved Synthesis Method Based on ILPP and Colored Petri Net for Liveness Enforcing Controller of Flexible Manufacturing Systems

引用

IEEE ACCESS 2022年 10卷 68570-68581页

作者： Kaid, Husam Al-Ahmari, Abdulrahman Li, Zhiwu Ameen, Wadea King Saud Univ Coll Engn Ind Engn Dept Riyadh 11421 Saudi Arabia King Saud Univ Adv Mfg Inst Raytheon Chair Syst Engn RCSE Chair Riyadh 11421 Saudi Arabia Macau Univ Sci & Technol Inst Syst Engn Taipa 999078 Macao Peoples R China Al Yamamah Univ Coll Engn & Architecture Ind Engn Dept Riyadh 11512 Saudi Arabia

Petri nets are used to design deadlock control strategies for flexible manufacturing systems (FMSs), which typically involve the addition of monitors and the associated arcs to the FMS. The addition of several monitors and associated arcs to the first constructed Petri net model significantly complicates the Petri net controller. This paper develops a two-step method for preventing deadlocks based on a colored Petri net and a structurally minimal approach that significantly reduces the number of monitors. In the first step, a vector covering technique is applied to generate a minimal covered set of first-met bad markings (FBMs) and legal markings that are respectively smaller than the sets of FBMs and legal markings. At one iteration, place invariants (PIs) corresponding to monitors are constructed by solving an integer linear programming problem (ILPP) to prohibit the maximum number of FBMs, while allowing all legal markings in the minimal covering set. The purpose of the ILPP is to maximize the number of FBMs forbidden by the PIs. Then, based on a colored Petri net, all generated monitors are combined into a global control place. Therefore, a supervisor with minimal structural complexity can be constructed. The obtained net model is controlled after the addition of the designed supervisor. Two instances from the literature are considered to illustrate the proposed approach.

关键词： System recovery Monitoring Petri nets Law Complexity theory Frequency modulation Behavioral sciences Colored Petri nets integer linear programming flexible manufacturing system deadlock prevention

来源：评论

学校读者我要写书评

暂无评论

Optimization Model for Primary and Backup Resource Allocation With Workload-Dependent Failure Probability

引用

IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT 2022年第1期19卷 452-471页

作者： Zhu, Mengfei He, Fujun Oki, Eiji Kyoto Univ Grad Sch Informat Kyoto 6068501 Japan

This paper proposes an optimization model to derive a primary and backup resource allocation considering a workload-dependent failure probability to minimize the maximum expected unavailable time (MEUT). The workload-dependent failure probability is a non-decreasing function which reveals the relationship between the workload and the failure probability. The proposed model adopts hot backup and cold backup strategies to provide protection. The cold backup strategy is a protection strategy, in which the requested loads of backup resources are not activated before failures occur to reduce resource utilization with the cost of longer recovery time. The hot backup strategy is a protection strategy, in which the backup resources are activated and synchronized with the primary resources to recover promptly with the cost of higher workload. We formulate the optimization problem as a mixed integer linear programming (MILP) problem. We prove that MEUT of the proposed model is equal to the smaller value between the two MEUTs obtained by applying only hot backup and cold backup strategies with the same total requested load. A heuristic algorithm inspired by the water-filling algorithm is developed with the proved theorem. The numerical results show that the proposed model suppresses MEUT compared with the conventional model which does not consider the workload-dependent failure probability. The developed heuristic algorithm is approximately 10(5) times faster than the MILP approach with 10(-2) performance penalty on MEUT.

关键词： Resource management Optimization Numerical models Heuristic algorithms Costs Load modeling Servers Virtual resource allocation workload-dependent unavailable time protection strategies integer linear programming

来源：评论

学校读者我要写书评

暂无评论

OPTIMAL DISTRIBUTION SYSTEM PLANNING INTEGRATING SOFT OPEN POINTS UNDER DISTRIBUTED GENERATION UNCERTAINTY

OPTIMAL DISTRIBUTION SYSTEM PLANNING INTEGRATING SOFT OPEN P...

引用

CIRED 2024 Vienna Workshop

作者： de Barros, Heitor Farias Hérault, Marie-Cécile Alvarez Raison, Bertrand Tran, Quoc Tuan Univ.Grenoble Alpes CNRS Grenoble INP G2Elab Grenoble France CEA-INES Le Bourget-du-Lac France

ISBN: (纸本)9781837242672

As load growth and Distributed Generation (DG) connection in distribution systems increase in recent years, network reinforcements are required to avoid security constraint *** this context, Sot Open Points (SOPs) appear as a solution to defer network reinforcements by providing active and reactive power *** work proposes a two-stage distribution system planning to cope with load growth and with DG connection under high uncertainty, comparing network reinforcement with SOPs *** first stage employs a Mixed integer linear programming (MILP) optimization to find the optimal network upgrades (Reinforcement or SOP) based on the expected load *** second stage uses a Monte Carlo simulation combined with a linear programming DG curtailment minimization to compute expected curtailment for multiple connection scenarios and hosting capacity *** results indicate that installing SOP can be advantageous from both economic and DG curtailment point-of-view in comparison to network reinforcements for the case studies considered regardless of hosting capacity target level. © The Institution of Engineering & Technology 2024.

关键词： integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Loop-Based Maritime Transport Optimization in Swedish National Freight Transport Models

Loop-Based Maritime Transport Optimization in Swedish Nation...

引用

2024 IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2024

作者： Westin, Jonas Olsson, Leif Åhag, Per Department of Mathematics and Mathematical Statistics Umeå University Umeå Sweden Department of Communication Quality Management and Information Systems Mid Sweden University Sundsvall Sweden

ISBN: (纸本)9798350386097

This study addresses enhancements to the Swedish national freight transport model, Samgods, focusing on improving its maritime transport modeling capabilities. The current model faces challenges in accurately representing maritime transport due to its limitations in consolidation of diverse cargo types, and modeling indirect sea routes. We propose an advanced model using a mixed integer linear programming (MILP) technique to integrate transport loops, thereby increasing the model's efficiency and realism in depicting maritime transport scenarios. A case study on the shipping of forest products from Northern Sweden to Western Europe illustrates the method's effectiveness. Introducing transport loops into the model results in a 10-21% reduction in logistics costs and a 2-4% increase in the utilization of maritime transport. The fleet composition also changes to more resemble real world data. These findings highlight the importance of loop structures in accurately capturing the full benefits of maritime transport in freight transport modeling. © 2024 IEEE.

关键词： integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Robust Designs Against Data Loss: A General Approach 51st

Robust Designs Against Data Loss: A General Approach

引用

51st Scientific Meeting of the Italian Statistical Society, SIS 2022

作者： Fontana, Roberto Rapallo, Fabio Department of Mathematical Sciences Politecnico di Torino Corso Duca degli Abruzzi 24 Torino10129 Italy Department of Economics University of Genova Via Vivaldi 5 Genova16126 Italy

ISBN: (纸本)9783031656989

We describe an algorithm that, given an initial design Fn of size n and a linear model with p parameters, provides a sequence Fn⊃⋯⊃Fn-k⊃⋯⊃Fp of nested robust designs. The sequence is obtained by removing each individual run of Fn until a p-run saturated design Fp is obtained. The potential impact of the algorithm on real applications is high, because it can be used in a wide spectrum of designs. The initial fraction Fn can be of any type and the output sequence can be used to organize the experimental activity. The experiments can start with the runs corresponding to Fp and then continue by adding one run after the other (from Fn-k to Fn-k+1) until the initial design Fn is obtained. In this way, if for some unexpected reasons the experimental activity has to be interrupted before the end when only n-k runs have been completed, the corresponding Fn-k will have a high value of robustness for k∈{1,…,n-p}. The algorithm uses the circuit basis, a special representation of the kernel of a matrix with integer entries. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.

关键词： integer linear programming

来源：评论

学校读者我要写书评

暂无评论

PACE Solver Description: CRGone 19

PACE Solver Description: CRGone

引用

19th International Symposium on Parameterized and Exact Computation, IPEC 2024

作者： Dobler, Alexander TU Wien Austria

ISBN: (纸本)9783959773539

We describe CRGone, our solver for the exact and parameterized track of the Pace Challenge 2024. It solves the problem of one-sided crossing minimization, is based on an integer linear programming (ILP) formulation with additional reduction rules, and is implemented in C++ using the ILP solver SCIP with Soplex. © Alexander Dobler.

关键词： integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Green Dual Connectivity Selection Algorithm in 5G-NR/4G-LTE NSA HetNet 7

Green Dual Connectivity Selection Algorithm in 5G-NR/4G-LTE ...

引用

7th IEEE International Symposium on Telecommunication Technologies, ISTT 2024

作者： Syukri, Nur Anisya Anis Binti Thiagarajah, Siva Priya Dwijaksara, Made Harta Alias, Mohamad Yusoff Lee, It Ee Multimedia University Faculty of Engineering Cyberjaya Malaysia University of Indonesia Faculty of Computer Science Java Barat Indonesia

ISBN: (纸本)9798350392074

Dual connectivity (DC) can increase network capacity by allowing a user to simultaneously connect to more than one Radio Access Technology (RAT) at the same time. Although it offers higher network capacity, power management is a constraint in DC enabled heterogeneous networks (HetNet). This work aims to find the best trade-off between network capacity and power efficiency in DC deployed Fifth Generation New Radio (5G-NR) and Long Term Evolution (LTE) HetNet. Past works have not conducted a simultaneous optimization of power saving and capacity enhancement for DC in a Non Standalone(NSA) setup. A novel base station pairing technique is used to determine Next Generation Node B (gNB) sleep patterns. Two algorithms, the Super Greedy algorithm and the integer linear programming (ILP)-Greedy algorithm are proposed to find the optimal way to preserve network power and enhance the user throughput. The ILP-Greedy uses ILP optimization for power minimizing through cell sleeping and a greedy algorithm for user association. Based on comparison with past baseline works, the ILP-Greedy algorithm is found to be superior for DC implementation in a 4G/5G NSA HetNet, saving 7.02 % of network power and still providing comparable network capacity improvement. © 2024 IEEE.

关键词： integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Crisis2Sum: An Exploratory Study on Disaster Summarization from Multiple Streams 21

Crisis2Sum: An Exploratory Study on Disaster Summarization f...

引用

21st International ISCRAM Conference, ISCRAM 2024

作者： Seeberger, Philipp Riedhammer, Korbinian Technische Hochschule Nürnberg Germany

Automatic summarization of natural and human-made disaster events is an important area to increase situational awareness for human response organizations and disaster management. However, the incorporation of multiple data sources poses a challenge to current summarization systems, as the typically large document collections exceed the input limits of neural models. Additionally, Large Language Models (LLM) often omit key information present at different positions in long context inputs. Furthermore, disaster reporting requires fine-grained information content and therefore relaxes the restriction to high compression rates, resulting into rather long summaries. In this work, we study different extractive and LLM-based abstractive baselines and highlight shortcomings in present approaches. Our experimental results on the CrisisFACTS datasets show that LLM-based approaches tend to fail in generating long informative summaries. Taking these limitations into account, we propose a disaster summarization framework and introduce query-focused extensions, which demonstrate advantages and superior performance over the baseline methods. © 2024 Information Systems for Crisis Response and Management, ISCRAM. All rights reserved.

关键词： integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Kernelization for Orthogonality Dimension 19

Kernelization for Orthogonality Dimension

引用

19th International Symposium on Parameterized and Exact Computation, IPEC 2024

作者： Haviv, Ishay Rabinovich, Dror School of Computer Science The Academic College of Tel Aviv-Yaffo Israel

ISBN: (纸本)9783959773539

The orthogonality dimension of a graph over R is the smallest integer d for which one can assign to every vertex a nonzero vector in Rd such that every two adjacent vertices receive orthogonal vectors. For an integer d, the d-Ortho-DimR problem asks to decide whether the orthogonality dimension of a given graph over R is at most d. We prove that for every integer d ≥ 3, the d-Ortho-DimR problem parameterized by the vertex cover number k admits a kernel with O(kd−1) vertices and bit-size O(kd−1 · log k). We complement this result by a nearly matching lower bound, showing that for any Ε > 0, the problem admits no kernel of bit-size O(kd−1−Ε) unless NP ⊆ coNP/poly. We further study the kernelizability of orthogonality dimension problems in additional settings, including over general fields and under various structural parameterizations. © Ishay Haviv and Dror Rabinovich.

关键词： integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Train rescheduling in a major disruption on a high-speed railway network with seat reservation

引用

TRANSPORTMETRICA A-TRANSPORT SCIENCE 2022年第3期18卷 532-567页

作者： Zhan, Shuguang Wong, S. C. Shang, Pan Lo, S. M. Southwest Jiaotong Univ Sch Transportat & Logist Chengdu 610031 Sichuan Peoples R China Univ Hong Kong Dept Civil Engn Pok Fu Lam Hong Kong Peoples R China Southwest Jiaotong Univ Natl United Engn Lab Integrated & Intelligent Tra Chengdu Sichuan Peoples R China Southwest Jiaotong Univ Natl Engn Lab Integrated Transportat Big Data App Chengdu Sichuan Peoples R China Beijing Jiaotong Univ Sch Traff & Transportat Beijing 100044 Peoples R China City Univ Hong Kong Dept Architecture & Civil Engn Kowloon Tong Hong Kong Peoples R China

In this paper, we develop a method of real-time train rescheduling on double-track high-speed railway lines undergoing major disruption. As a result, trains approaching the disrupted area cannot use the blocked tracks and must be efficiently rescheduled. As most tracks in a high-speed railway station can be shared by trains arriving from both directions, we reschedule both inbound and outbound trains simultaneously by allowing them to share sidings. Based on a space-time network, an integer linear programming (ILP) model is formulated to minimize the train-deviation cost. As the ILP model is difficult to solve for real-world problems, we decompose it into many easy-to-solve subproblems by the alternating direction method of multipliers (ADMM) algorithm. Our model is tested on an abstract representation of the Chinese high-speed railway system to illustrate both the benefit of rescheduling trains in both directions simultaneously and the efficiency of the ADMM algorithm in train rescheduling.

关键词： High-speed railway train rescheduling integer linear programming alternating direction method of multipliers

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：