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

Reachability Analysis of Augmented Marked Graphs via integer linear programming

COMPUTER JOURNAL 2010年第6期53卷 623-633页

作者： Chen, Chien-Liang Chin, Shao-Chi Yen, Hsu-Chun Natl Taiwan Univ Dept Elect Engn Taipei 106 Taiwan Kainan Univ Dept Comp Sci Tao Yuan 338 Taiwan

Augmented marked graphs (AMGs) are extensions of marked graphs that allow resource sharing. It has been shown that AMGs are useful for modeling and analyzing certain types of flexible manufacturing systems (FMSs). To our knowledge, the techniques developed for analyzing AMGs are mostly based upon checking certain Petri net structures such as siphons. This article exploits the integer linear programming approach for the analysis of a subclass of AMGs called decomposable AMGs. We show that reachability between two configurations of a decomposable AMG can be equated with solving an instance of integer linear programming. We further extend our technique to model checking a type of branching time temporal logics. Examples arisen in FMSs are used to demonstrate the application of our technique.

关键词： reachability augmented marked graphs integer linear programming model checking

来源：评论

学校读者我要写书评

暂无评论

Sparse Array Design via integer linear programming

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2024年 72卷 4812-4826页

作者： Zhuang, Yangjingzhi Zhang, Xuejing He, Zishu Greco, Maria Sabrina Gini, Fulvio Univ Elect Sci & Technol China Dept Informat & Commun Engn Chengdu 611731 Peoples R China Univ Pisa Dept Informat Engn I-56122 Pisa Italy

In this paper, a design framework based on integer linear programming is proposed for optimizing sparse array structures. We resort to binary vectors to formulate the design problem for non-redundant arrays (NRA) and minimum-redundant arrays (MRA). The flexibility of the proposed framework allows for dynamic adjustment of constraints to meet various applicative requirements, e.g., to achieve desired array apertures and mitigate mutual coupling effects. The proposed framework is also extended to the design of high-order arrays associated by exploiting high-order cumulants. The effectiveness of the proposed sparse array design framework is investigated through extensive numerical analysis. A comparative analysis with closed-form solutions and integer linear programming-based array design methods confirms the superiority of the proposed design framework in terms of number of degrees of freedom (DOF) and direction of arrival (DOA) estimation accuracy.

关键词： Sensor arrays Antenna arrays Mutual coupling Vectors Sensors Redundancy Apertures Non-redundant array minimum-redundant array sparse array design integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Optimization of water distribution networks using integer linear programming

引用

JOURNAL OF HYDRAULIC ENGINEERING-ASCE 2006年第5期132卷 501-509页

作者： Samani, HMV Mottaghi, A Shahid Chamran Univ Fac Engn Dept Civil Engn Alwaz Khozistan Iran

In this study optimum design of municipal water distribution networks for a single loading condition is determined by the branch and bound integer linear programming technique. The hydraulic and optimization analyses are linked through an iterative procedure. This procedure enables us to design a water distribution system that satisfies all required constraints with a minimum total cost. The constraints include pipe sizes, which are limited to the commercially available sizes, reservoir levels, pipe flow velocities, and nodal pressures. Accuracy of the developed model has been assessed using a network with limited solution alternatives, the optimal solution of which can be determined without employing optimization techniques. The proposed model has also been applied to a network solved by others. Comparison of the results indicates that the accuracy and convergence of the proposed method is quite satisfactory.

关键词： optimization water distribution systems computer programming water pipelines computer programming Water distribution networks Water distribution systems computer programs integer linear programming Water pipe

来源：评论

学校读者我要写书评

暂无评论

Vehicular ad hoc networks enabled traffic controller for removing traffic lights in isolated intersections based on integer linear programming

引用

IET INTELLIGENT TRANSPORT SYSTEMS 2012年第2期6卷 115-123页

作者： Ghaffarian, H. Fathy, M. Soryani, M. Iran Univ Sci & Technol Comp Engn Sch Tehran Narmak Iran

Traffic management, especially in intersections, is an important part of intelligent transportation systems ( ITS). In this study, a new traffic controller is proposed which removes traffic lights in intersections. The heart of the proposed controller is a simple integer linear program (ILP) code. This program manages safe driving patterns crossing a junction while it tries to maximise number of passed vehicles across the intersection. The demanded data are prepared by vehicular ad hoc networks (VANET). The proposed safe driving pattern assures the safety of moving vehicles and avoiding any accident. Simulation results show that the proposed controller performs efficiently. The average queue lengths and also tolerated delay by vehicles are far better than traditional approaches. Also, for different probabilities of output selection, the proposed approach remains stable yet.

关键词： traffic controller integer linear programming V2V Defensive driving Traffic lights Traffic management vehicle Ad hoc networks Isolated intersections trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

An integer linear programming model for efficient scheduling of UGV tasks in precision agriculture under human supervision

引用

COMPUTERS & OPERATIONS RESEARCH 2020年 114卷 104826-000页

作者： Tiotsop, Lohic Fotio Servetti, Antonio Masala, Enrico Politecn Torino Control & Comp Engn Dept Corso Duca Abruzzi 24 I-10129 Turin Italy

In precision agriculture more and more robots are being used to perform tasks that may include some farming activities, such as pruning, inspection or spraying, assigned to the robot as a result of a previous analysis activity or autonomously identified by the machine itself. In this sensitive scenario, reporting difficult situations to a decision maker, e.g., a human operator or some sophisticated software tools that cannot be integrated with the robot, could be useful to perform the correct action that the machine has to execute. Unfortunately, this key aspect is still neglected in current literature that focuses, instead, on fully automated operations by robots. Moreover, it is necessary to consider that in rural areas it often happens that successful data communication can only be achieved in certain locations in the field. In this context, we aim to address all the previous shortcomings by formulating a more comprehensive optimization problem, which also models the necessity to report to a central location and get instructions on the task to be done before proceeding to perform each action. After presenting two alternative analytical formulations of the problem, i.e. an integer linear programming model (ILP) and a mixed integer linear programming model, we propose a branch and bound algorithm that is guaranteed to find the global minimum cost solution in terms of navigation time. Simulation results show that our proposed algorithm performs about 20 to 30 times faster with respect to commercial linear programming solvers using any of the two analytical models proposed. Moreover, we also propose further improvements to reduce computational time while maintaining solution optimality. Finally, some insight into the development of future heuristics is given by analyzing the speed of convergence towards the optimal solution. (C) 2019 Elsevier Ltd. All rights reserved.

关键词： Data acquisition Farming activities UGV Navigation integer linear programming Service robotics

来源：评论

学校读者我要写书评

暂无评论

Estimating the strength of poker hands by integer linear programming techniques

引用

CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH 2015年第3期23卷 625-640页

作者： Dalpasso, Marcello Lancia, Giuseppe Univ Padua Dipartimento Ingn Informaz I-35131 Padua Italy Univ Udine Dipartimento Informat & Matemat I-33100 Udine Italy

We illustrate how integer linear programming techniques can be applied to the popular game of poker Texas Hold'em in order to evaluate the strength of a hand. In particular, we give models aimed at (1) minimizing the number of features that a player should look at when estimating his winning probability (called his equity), (2) giving weights to such features so that the equity is approximated by the weighted sum of the selected features. We show that ten features or less are enough to estimate the equity of a hand with high precision.

关键词： Poker Texas Hold'em integer linear programming Equity

来源：评论

学校读者我要写书评

暂无评论

Local edge metric dimensions via corona products and integer linear programming

引用

COMPUTATIONAL & APPLIED MATHEMATICS 2024年第6期43卷 1-12页

作者： Amini, Fateme Henning, Michael A. Tavakoli, Mostafa Ferdowsi Univ Mashhad Fac Math Sci Dept Appl Math Mashhad 91775 Iran Univ Johannesburg Dept Math & Appl Math ZA-2006 Auckland Pk South Africa

Let G be a connected graph. The distance between two vertices u and v in G, denoted by dG(u, v), is the number of edges in a shortest path from u to v, while the distance between an edge e = xy and a vertex v in G is dG(e, v) = min{dG(x, v), dG(y, v)}. For an edge e. E(G) and a subset S of V( G), the representation of e with respect to S = {x1,..., xk} is the vector rG(e|S) = (d1,..., dk), where di = dG(e, xi) for i. [k]. If rG(e|S) = rG( f |S) for every two adjacent edges e and f of G, then S is called a local edge metric generator for G. The local edge metric dimension of G, denoted by edim (G), is the minimum cardinality among all local edge metric generators in G. For two non-trivial graphs G and H, we determine edim ( G H) in the edge corona product G H and we determine edim (G. H) in the corona product G H. We also formulate the problem of computing edim (G) as an integer linear programming model.

关键词： Metric dimension Local edge metric dimension Corona product Edge corona product integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Topology optimization of fluid flow by using integer linear programming

引用

STRUCTURAL AND MULTIDISCIPLINARY OPTIMIZATION 2021年第3期64卷 1221-1240页

作者： Souza, B. C. Yamabe, P. V. M. Sa, L. F. N. Ranjbarzadeh, S. Picelli, R. Silva, E. C. N. Univ Sao Paulo Escola Politecn Dept Mechatron & Mech Syst Engn Av Prof Mello Moraes 2231 BR-05508030 Sao Paulo Brazil Univ Sao Paulo Dept Min & Petr Engn Praca Narciso Andrade S-N BR-11013560 Santos SP Brazil

Topology optimization of fluid flow problems is still a challenging open problem, especially when considering turbulence, compressibility, or the addition of different physics. In the current implementation of topology optimization for fluids considering density methods, there are essentially three problems. First, the grayscale in the result makes it difficult to identify the precise contour of the fluid region, which may be a problem in some applications and during the optimization process as well. Second, even for low Reynolds flow design problems, a continuation scheme of the material model penalization parameters is necessary to avoid a grayscale and to obtain a clear boundary. Third, in complex fluid flow optimization problems, it is difficult to specify the maximum value of the inverse permeability to avoid the fluid to flow inside the solid. This work proposes a novel methodology that tackles the first two problems, i.e., it avoids the grayscale and obtains clear boundaries. The goal of this work is to implement the Topology Optimization of Binary Structures (TOBS) (Sivapuram and Picelli, Finite Elem Anal Des 139:49-61, 2018) for fluid flow design, which is a novel topology optimization method that has been used in solid mechanics to generate optimized structural solutions considering only binary {0,1} design variables. The main advantage of {0,1} methods is the clear definition of the interface and the absence of grayscale. It is a method easy to implement which preserves the material distribution features. Some classic fluid problems are considered to illustrate the problem, such as the double channel and the bend pipe, and also a more complex example that usually presents grayscale issues, which is the fluid diode design. The optimization results show the feasibility of the TOBS when applied to fluid flow problems. The physical problem is solved by using the finite element method and the optimization problem with CPLEX (c), a proprietary optimization pack

关键词： Topology optimization Fluid flow Navier-Stokes flow TOBS method integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Redundancy allocation for series-parallel systems using integer linear programming

引用

IEEE TRANSACTIONS ON RELIABILITY 2008年第3期57卷 507-516页

作者： Billionnet, Alain Conservatoire Natl Arts & Metiers Comp Sci Lab CEDRIC Combinatorial Optimizat Grp Paris France

We consider the problem of maximizing the reliability of a series-parallel system given cost and weight constraints on the system. The number of components in each subsystem, and the choice of components are the-decision variables. In this paper, we propose an integer linear programming approach that gives an approximate feasible solution, close to the optimal solution, together with an upper bound on the optimal reliability. We show that integer linear programming is a useful approach for solving this reliability problem. The mathematical programming model is relatively simple. Its implementation is immediate by using a mathematical programming language, and integer linear programming software. And the computational experiments show that the performance of this approach is excellent based on a comparison with previous results.

关键词： computational experiments integer linear programming multiple component choices redundancy allocation system reliability

来源：评论

学校读者我要写书评

暂无评论

Accurate Flow Decomposition via Robust integer linear programming

引用

IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS 2024年第6期21卷 1955-1964页

作者： Dias, Fernando H. C. Tomescu, Alexandru I. Aalto Univ Dept Math & Syst Anal Syst Anal Lab Espoo 02150 Finland Univ Helsinki Dept Comp Sci Helsinki 00100 Finland

Minimum flow decomposition (MFD) is a common problem across various fields of Computer Science, where a flow is decomposed into a minimum set of weighted paths. However, in Bioinformatics applications, such as RNA transcript or quasi-species assembly, the flow is erroneous since it is obtained from noisy read coverages. Typical generalizations of the MFD problem to handle errors are based on least-squares formulations or modelling the erroneous flow values as ranges. All of these are thus focused on error handling at the level of individual edges. In this paper, we interpret the flow decomposition problem as a robust optimization problem and lift error-handling from individual edges to solution paths. As such, we introduce a new minimum path-error flow decomposition problem, for which we give an integer linear programming formulation. Our experimental results reveal that our formulation can account for errors significantly better, by lowering the inaccuracy rate by 30-50% compared to previous error-handling formulations, with computational requirements that remain practical.

关键词： Bioinformatics Genomics RNA Splicing Assembly integer linear programming Sequential analysis Flow decomposition integer programming network flow uncertainty

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：