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

7th IEEE International Humanitarian Technologies Conference, IHTC 2024

作者： Cometa, Roberto Velini, Angelo Nasab, Mohammad Rajabi Bruno, Sergio Scala, Massimo La DEI - Politecnico di Bari Bari Italy

ISBN: (纸本)9798350354645

The deep penetration of renewable energy sources (RES) in power systems is increasingly influencing electricity markets and the physical operations of transmission networks. Besides the environmental and climate benefits, RES volatility and aleatory behaviour, combined with the consequent difficulties in control, might lead to voltage issues, which could be particularly critical when the grid lacks reactive power support. In this context, transmission system operators are called upon to make decisions about the use of available grid assets, such as compensating shunt devices and tap-changing transformers. In addition, transmission line switching can be adopted to provide further reactive power control resource. However, it is often difficult to determine which network assets should be enabled within the operation time requirements. Therefore, in this paper, an Optimal Reactive Power Flow tool for operators is proposed, including both shunt devices and transmission line switching, as well as the adjustment of transformers' tap settings. The optimization problem is solved by resorting to a genetic algorithm to account for network model nonlinearities. In order to improve inclusiveness and replicability, the whole tool was developed exploiting open-source libraries only. Numerical tests are carried out on a modified IEEE 118-Bus Test System. © 2024 IEEE.

关键词： integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Fault-adaptive Scheduling for Data Acquisition Networks 48

Fault-adaptive Scheduling for Data Acquisition Networks

引用

48th Conference on Local Computer Networks

作者： Stein, Eloise Bramas, Quentin Colombo, Tommaso Pelsser, Cristel Univ Strasbourg Strasbourg France CERN Prevessin Moens France UCLouvain Ottignies Belgium

ISBN: (纸本)9798350300741;9798350300734

Supporting such an all-to-all traffic matrix is challenging as it can easily lead to congestion. Scheduling patterns are designed to avoid such congestion by spreading the communications over time. The time is divided in phases and communications are spread across the phases. However, current scheduling algorithms are not fault-tolerant. In this paper we propose a fault-adaptive congestion-free scheduling to support an all-to-all exchange in fat tree topology. Our approach consist in the computation of the minimum number of communication phases required to support the all-to-all exchange with the available links, and of the scheduling of the communications on these phases. It enables to recover from failures and makes optimal use of the remaining bandwidth. We show that our scheduling approach provides better performance than the most common approach which is the linear-shift scheduling. The throughput is improved by roughly 80% with our approach, for as little as one link failure.

关键词： all-to-all fat-tree networks integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Pin Access-Oriented Concurrent Detailed Routing 23

Pin Access-Oriented Concurrent Detailed Routing

引用

International Symposium on Physical Design (ISPD)

作者： Jiang, Yun-Jhe Fang, Shao-Yun Natl Taiwan Univ Sci & Technol Dept Elect Engn Taipei Taiwan

ISBN: (纸本)9781450399784

Due to continuously shrunk feature sizes and increased design complexity, the difficulty in pin access becomes one of the most critical challenges in large-scale full-chip routing. State-of-the-art pin access-aware detailed routing techniques suffer from either the ordering problem of the sequential routing scheme or the inflexibility of pre-determining an access point for each pin. Some other routing-related studies create pin extensions with Metal-2 metal segments to optimize pin accessibility;however, this strategy may not be practical without considering the contemporary routing flow. This paper presents a pin access-oriented concurrent detailed routing approach conducted after the track assignment stage. The core detailed routing engine is based on an integer linear programming (ILP) formulation, which has lower complexity and can flexibly tackle multi-pin nets compared to an existing formulation. Besides, to maximize the free routing resource and to keep the problem size tractable, a pre-processing flow trimming redundant metals and inserting assistant metals is developed. The experimental results show that compared to a state-of-the-art academic router, the proposed concurrent scheme can effectively derive good results with fewer design rule violations and less runtime.

关键词： concurrent routing detailed routing integer linear programming pin access

来源：评论

学校读者我要写书评

暂无评论

Simultaneous scheduling of maintenance crew and maintenance tasks in bus operating companies: a case study

引用

JOURNAL OF QUALITY IN MAINTENANCE ENGINEERING 2022年第2期28卷 506-532页

作者： Martins, Rodrigo Fernandes, Francisco Infante, Virginia Andrade, Antonio R. Univ Lisbon Inst Super Tecn IDMEC Lisbon Portugal

Purpose The purpose of this paper is to describe an integer linear programming model to schedule the maintenance crew and the maintenance tasks in a bus operating company. Design/methodology/approach The proposed methodology relies on an integer linear programming model that finds feasible maintenance schedules. It minimizes the costs associated with maintenance crew and the costs associated with unavailability. The model is applied in a real-world case study of a Portuguese bus operating company. A constructive heuristic approach is put forward, based on solving the maintenance scheduling problem for each bus separately. Findings The heuristic finds better solutions than the exact methods (based on branch-and-bound techniques) in a much lower computational time. Practical implications The results suggest the relevance of such heuristic approaches for maintenance scheduling in practice. Originality/value This proposed model is an effective decision-making support method that provides feasible maintenance schedules for the maintenance technicians and for the maintenance tasks in a fleet of buses. It also complies with several operational, technical and labour constraints.

关键词： Optimization Scheduling Maintenance scheduling Maintenance planning Maintenance optimization integer linear programming

来源：评论

学校读者我要写书评

暂无评论

A MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts

引用

ANNALS OF OPERATIONS RESEARCH 2022年第2期316卷 805-835页

作者： do Nascimento, Oliviana Xavier de Queiroz, Thiago Alves Junqueira, Leonardo Univ Fed Goias Inst Math & Technol Campus Catalao BR-75704020 Catalao Go Brazil Univ Sao Paulo Polytech Sch Dept Prod Engn BR-05508010 Sao Paulo SP Brazil

This work presents guillotine constraints for two- and three-dimensional cutting problems. These problems look for a subset of rectangular items of maximum value that can be cut from a single rectangular container. Guillotine constraints seek to ensure that items are arranged in such a way that cuts from one edge of the container to the opposite edge completely separate them. In particular, we consider the possibility of 2, 3, and 4 cutting stages in a predefined sequence. These constraints are considered within a two-level iterative approach that combines the resolution of integer linear programming and constraint programming models. Experiments with instances of the literature are carried out, and the results show that the proposed approach can solve in less than 500 s approximately 60% and 50% of the instances for the two- and three-dimensional cases, respectively. For the two-dimensional case, in comparison with the recent literature, it was possible to improve the upper bound for 16% of the instances.

关键词： Two and three-dimensional cutting problems Guillotine cutting stage constraints integer linear programming Constraint programming

来源：评论

学校读者我要写书评

暂无评论

Minimizing makespan under data prefetching constraints for embedded vision systems: a study of optimization methods and their performance

引用

OPERATIONAL RESEARCH 2022年第3期22卷 1639-1673页

作者： Salem, Khadija Hadj Jost, Vincent Kieffer, Yann Libralesso, Luc Mancini, Stephane Univ Tours LIFAT EA 6300 CNRS ROOT ERL CNRS 7002 F-37200 Tours France Univ Grenoble Alpes GSCOP Grenoble INP F-38031 Grenoble France Univ Grenoble Alpes LCIS Grenoble INP F-26000 Valence France Univ Grenoble Alpes TIMA Grenoble INP F-38031 Grenoble France

In confronting the "Memory Wall", the design of embedded vision systems exhibits many challenges regarding design cost, energy consumption, and performance. This paper considers a variant of the Job Shop Scheduling Problem with tooling constraints, arising in this context, in which the completion time (makespan) is to be minimized. This objective corresponds to the performance of the produced circuit. We discuss different formulations using integer linear programming and point out their characteristics, namely the size and the quality of the linear programming relaxation bound. To solve this scheduling problem with large size, we compare various approaches, including a Constraint programming model, two constructive greedy heuristics, two models of LocalSolver, a Simulated Annealing algorithm, and a Beam Search algorithm. Numerical experiments are conducted on 16 benchmark instances from the literature and 12 real-life non-linear image processing kernels for validating their efficiency.

关键词： Embedded vision systems Scheduling Makespan integer linear programming Constraint programming Greedy algorithms LocalSolver Simulated annealing Beam search

来源：评论

学校读者我要写书评

暂无评论

School Families: A New Formulation of School District Planning Problem 56

School Families: A New Formulation of School District Planni...

引用

56th Annual Hawaii International Conference on System Sciences (HICSS)

作者： Shimizu, Hitoshi Suwa, Hirohiko Iwata, Tomoharu Fujino, Akinori Sawada, Hiroshi Yasumoto, Keiichi Nippon Telegraph & Tel Corp Tokyo Japan NAIST Ikoma Japan

ISBN: (纸本)9780998133164

This paper makes a plan to introduce school families. School families refer to a hierarchical system where the junior high school district encompasses the elementary school district. School families have the advantage of promoting efficient cooperation between elementary and junior high schools. Therefore, we formulated a new school district planning problem to introduce school families and created an optimal plan under changing population situations. Our formulation achieves school families by exploiting the continuity constraints of the school district. We also compare two different methods of reorganizing school districts in the simulation experiments: changing school districts by transferring current students in a given year (school-year method) and switching new students' schools over a multi-year period (birth-year method). We examined the cost and computation time of plans obtained with both methods and showed that the method combining the two provides the most significant cost savings.

关键词： School family integer linear programming School district planning problem

来源：评论

学校读者我要写书评

暂无评论

Cost-damage analysis of attack trees 53

Cost-damage analysis of attack trees

引用

53rd Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN)

作者： Lopuhaa-Zwakenberg, Milan Stoelinga, Marielle Univ Twente Enschede Netherlands Radboud Univ Nijmegen Nijmegen Netherlands

ISBN: (纸本)9798350347937

Attack trees (ATs) are a widely deployed modelling technique to categorize potential attacks on a system. An attacker of such a system aims at doing as much damage as possible, but might be limited by a cost budget. The maximum possible damage for a given cost budget is an important security metric of a system. In this paper, we find the maximum damage given a cost budget by modelling this problem with ATs, both in deterministic and probabilistic settings. We show that the general problem is NP-complete, and provide heuristics to solve it. For general ATs these are based on integer linear programming. However when the AT is tree-structured, then one can instead use a faster bottom-up approach. We also extend these methods to other problems related to the cost-damage tradeoff, such as the cost-damage Pareto front.

关键词： Attack trees Pareto front cost-damage analysis integer linear programming

来源：评论

学校读者我要写书评

暂无评论

A dynamic integer programming approach for free flight air traffic management (ATM) scenario with 4D-trajectories and energy efficiency aspects

引用

OPTIMIZATION LETTERS 2020年第7期14卷 1659-1680页

作者： Ntakolia, Charis Caceres, Hernan Coletsos, John Univ Thessaly Dept Comp Sci & Biomed Informat Lamia Greece Univ Catolica Norte Chile Dept Ind Engn Antofagasta Chile Natl Tech Univ Athens Sch Appl Math & Nat Sci Dept Math Athens Greece

The growth in demand for air transport has generated new challenges for capacity and safety. In response, manufacturers develop new types of aircraft while airlines open new routes and adapt their fleet. This excessive demand for air transport also leads to the need for further investments in airport expansion and ATM modernization. The current work was focused on the ATM problem with respect to new procedures, such as free flight, for addressing the air capacity issues in an environmental approach. The study was triggered by and aligned with the following performance objectives set by EUROCONTROL and the European Commission: (1) to improve ATM safety whilst accommodating air traffic growth;(2) to increase the ATM network efficiency;(3) to strengthen ATM's contribution to aviation security and to environmental objectives;(4) to match capacity and air transport growth. The proposed mathematical model covers the aforementioned objectives by focusing on energy losses and costs of flights under the scenario of a controlled free flight and a unified airspace. The factors enhanced in the model were chosen based on their impact on the ATM energy efficiency, such as the airborne delays and flight duration, the delays due to ground holding, the flight cancellation, the flight speed deviations and the flight level alterations. Therefore, the presented mathematical model minimizes the energy costs due to the above terms under certain assumptions and constraints. Finally, simulation case studies, used as proof tests, have been conducted under different ATM scenarios to examine the complexity and the efficiency of the developed model.

关键词： Operations research integer linear programming Dynamic programming Air traffic management Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

KtreeBnIp: An Efficient Epistasis Mining Approach Using K-tree Optimizing Bayesian Network

KtreeBnIp: An Efficient Epistasis Mining Approach Using K-tr...

引用

2023 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2023

作者： Li, Keqin Yang, Xuan Xie, Ao Kan, Yulong Wang, Xu Deng, Junli Liu, Jianxiao Huazhong Agricultural University Key Laboratory of Smart Farming for Agricultural Animals Hubei Key Laboratory of Agricultural Bioinformatics College of Informatics Wuhan China

ISBN: (纸本)9798350337488

Mining the epistatic gene loci for complex diseases is an important research topic in recent years. The existing epistasis detection methods have the shortcomings of high complexity, low efficiency, high false positive rate, inability to deal with large-scale genome-wide data, etc. In this work, we propose a epistasis mining method which using k-tree optimizing Bayesian network (BN) (KtreeBnIp). Firstly, it constructs the k-tree including large-scale of SNP loci and phenotype by sampling the Dandelion code uniformly. Then it decomposes k-tree into different k-cliques by using the graph decomposition algorithm based on neighbor nodes. For the nodes in each k-clique, the integer linear programming optimizing Bayesian network (ILPBN) is used to obtain the sub-network quickly and accurately. Finally, it merges all the sub-networks to obtain the whole network. It repeats the above operations (k-tree generation, k-tree decomposition, network generation) several times and gets the final network according to the frequency of edges, and thus to obtain the epistatic loci affecting phenotype. We compare KtreeBnIp with the current popular epistasis mining algorithms using both simulated and real age-related macular degeneration(AMD) datasets. Experiment results show that KtreeBnIp has better epistasis detection accuracy, higher F1-score, and lower false positive rate. Most importantly, it can be used in large-scale of SNPs for epistasis detection. © 2023 IEEE.

关键词： Bayesian Network Epistasis integer linear programming k-clique k-tree

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：