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

Resilience in Complex Systems: An Agent-Based Approach

SYSTEMS ENGINEERING 2017年第2期20卷 158-172页

作者： Pumpuni-Lenss, Gloria Blackburn, Timothy Garstenauer, Andreas George Washington Univ Sch Engn & Appl Sci Dept Engn Management & Syst Engn Washington DC 20052 USA

This paper presents results from a research project on the behavior of complex systems after they experience disruptive events that impact their performance. As systems become more complex, the probability increases that they will exhibit emergent behavior that could lead to system failures or widespread and prolonged service interruptions. A complex adaptive system (CAS) approach is used to conceptualize a complex network system that has been impacted by disruptions and perturbations. A combination of network analysis and agent-based modeling is used to measure the performance of the system as it responds to disruptive events and restoration efforts. This system-level behavior is an emergent property of the complex network and represents system resilience. Various resilience measures are used to quantify system resilience and assess the effectiveness of strategies system owners employ to restore the system. We illustrate our techniques by characterizing a critical infrastructure system network as a CAS, and applying an agent-based simulation with an adaptive algorithm. (C) 2017 Wiley Periodicals, Inc.

关键词： agent-based model complex adaptive systems critical infrastructure system resilience measures capacitated networks

来源：评论

学校读者我要写书评

暂无评论

A model for the capacitated, hop-constrained, per-packet wireless mesh network design problem

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2009年第2期197卷 773-784页

作者： Scheibe, Kevin P. Ragsdale, Cliff T. Iowa State Univ Dept Logist Operat & Management Informat Syst Ames IA 50011 USA Virginia Tech Pamplin Coll Business Blacksburg VA 24061 USA

Three critical factors in wireless mesh network design are the number of hops between supply and demand points, the bandwidth capacity of the transport media, and the technique used to route packets within the network. Most previous research on network design has focused on the issue of hop constraints and/or bandwidth capacity in wired networks while assuming a per-flow routing scheme. However, networks that employ per-packet routing schemes in wireless networks involve different design issues that are unique to this type of problem. We present a methodology for designing wireless mesh networks that consider bandwidth capacity, hop constraints, and profitability for networks employing a per-packet routing system. (C) 2008 Elsevier B.V. All rights reserved.

关键词： Network planning Broadband wireless mesh Hop-constrained capacitated networks

来源：评论

学校读者我要写书评

暂无评论

A classification tree based approach for the development of minimal cut and path vectors of a capacitated network

引用

IEEE TRANSACTIONS ON RELIABILITY 2007年第3期56卷 474-487页

作者： Ramirez-Marquez, Jose Emmanuel Gebre, Bethel A. Stevens Inst Technol Sch Syst & Enterprises Hoboken NJ 07030 USA

This paper presents a holistic method that links together Monte-Carlo simulation, exact algorithms, and a data mining technique, to develop approximate bounds on the reliability of capacitated two-terminal networks. The method uses simulation to generate network configurations that are then evaluated with exact algorithms to investigate if they correspond to a network success or failure. Subsequently, the method implements commercially available software to generate a classification tree that can then be analyzed, and transformed into capacitated. minimal cut or path vectors. These vectors correspond to the capacitated version of binary minimal cuts & paths of a network. This is the first time that these vectors are obtained from a decision tree, and in this respect, research efforts have been focused on two main directions: 1) deriving an efficient yet intuitive approach to simulate network configurations to obtain the most accurate information;and given that the classification tree method could for some applications provide imperfect or incomplete information without the explicit knowledge of the reliability engineer, 2) understand the relationship between the obtained vectors, and the real capacitated minimal cut & path vectors of the network, and its reliability. The proposed method has been tested on a set of case networks to assess its validity & accuracy. The results obtained show that the technique described is effective, simple, and widely applicable.

关键词： capacitated networks cut set decision tree path set two-terminal reliability

来源：评论

学校读者我要写书评

暂无评论

A column-generation and branch-and-cut approach to the Bandwidth-Packing Problem

引用

JOURNAL OF RESEARCH OF THE NATIONAL INSTITUTE OF STANDARDS AND TECHNOLOGY 2006年第2期111卷 161-185页

作者： Villa, Christine Hoffman, Karla George Mason Univ Syst Engn & Operat Res Dept Fairfax VA 22030 USA

The telecommunications problem of assigning calls with point to point demand to a capacitated network where each call can be assigned to at most one path has been called the Bandwidth-Packing Problem. For a given network, with specified arc costs and arc capacities, one wishes to route calls ( defined by a starting and ending point) through the network to maximize the profit from the calls routed. Each such call is single path routed and not all calls will be routed. We propose a branch-and-cut methodology coupled with column generation to optimally solve such problems. We examine the alternative approaches in the literature and explain how this new method takes the best of all components of methods suggested previously. The method we suggest is new in that it includes a linear programming-based heuristic for obtaining good lower bounds, uses lifted minimal covers that take into account special-ordered set constraints, and dynamically choose among three alternative branching strategies. In addition, whenever a new column is generated, it is lifted into all existing cuts. We also discuss the need to generate all tied optimal linear optimization solutions if one wishes to assure that the solution obtained is optimal. Our computational results provide solutions to problems previously unsolvable.

关键词： capacitated networks column generation combinatorial optimization cutting planes facet-defining cuts heuristics integer programming network planning telecommunications networks zero-one optimization

来源：评论

学校读者我要写书评

暂无评论

capacitated network design considering survivability: An evolutionary approach

引用

ENGINEERING OPTIMIZATION 2004年第2期36卷 189-205页

作者： Konak, A Smith, AE Auburn Univ Dept Ind & Syst Engn Auburn AL 36849 USA Informat Sci & Technol Reading PA 19610 USA

This paper presents an evolutionary approach to design of capacitated networks considering cost, performance, and survivability. Traditionally, network performance and survivability have been considered independently. The approach presented in this paper is comprehensive where selecting network topology, assigning capacities for each link, and determining a route for each communicating node pair are simultaneously performed during optimization. Dual objectives of minimizing cost and minimizing delay are used, and the network design is subject to a survivability constraint. The proposed approach is tested on problems from the literature, and it is shown that it improves significantly upon previous single objective approaches and provides the user with a Pareto optimal set of designs to examine further.

关键词： network design capacitated networks survivability multi-objective design

来源：评论

学校读者我要写书评

暂无评论

COMPUTING EDGE-CONNECTIVITY IN MULTIGRAPHS AND capacitated GRAPHS

引用

SIAM JOURNAL ON DISCRETE MATHEMATICS 1992年第1期5卷 54-66页

作者： NAGAMOCHI, H IBARAKI, T

Given an undirected graph G = (V, E), it is known that its edge-connectivity lambda(G) can be computed by solving O(\V\) max-flow problems. The best time bounds known for the problem are O(lambda(G)\V\2), due to Matula (28th IEEE Symposium on the Foundations of Computer Science, 1987, pp. 249-251) if G is simple, and O(\E\3/2\V\), due to Even and Tarjan (SIAM J. Comput., 4 (1975), pp. 507-518) if G is multiple. An O(\E\ + min {lambda(G)\V\2, p\V\ + \V\2 log \V\}) time algorithm for computing the edge-connectivity lambda(G) of a multigraph G = (V, E), where p(less-than-or-equal-to \E\) is the number of pairs of nodes between which G has an edge, is proposed. This algorithm does not use any max-flow algorithm but consists only of \V\ times of graph searches and edge contractions. This method is then extended to a capacitated network to compute its minimum cut capacity in O(\V\\E\ + \V\2 log\V\) time.

关键词： UNDIRECTED MULTIGRAPHS EDGE-CONNECTIVITY capacitated networks MAXIMUM FLOWS MINIMUM CUTS POLYNOMIAL TIME ALGORITHMS

来源：评论

学校读者我要写书评

暂无评论

Network transformations and some applications

Network transformations and some applications

引用

作者： Cheong, Yue Pui Naval Postgraduate School

学位级别：硕士

The growing number of large scale applications of network models and the availability of very fast solution codes make it attractive to formulate problems as networks whenever such models are adequate for the purpose. In this thesis, concep- tualization of, and notation used to express these models is based on the interpretation of physical flows of commodity through a network structure of nodes and arcs. As an aid to modelling, and to allow codes of varying specificity to be used, nine well-known Transformations are catalogued here for easy reference. Two recent results for special cases of the multicommodity flow problem are re-derived and in the case of (1) below, is significantly extended: (1) The case with all capacitated arcs in the network structure incident with one common node. (2) The case of a transportation structure with two sinks (or two sources). Using the network approach, these are shown to have equivalent network formulations. Lastly, a Transformation which uncapacitates a network is implemented in various ways into a contemporary solution code named GNET.

关键词： capacitated networks multicommodity flow problem GNET solution code network transformations

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：