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

28th Annual IEEE International Conference on Local Computer Networks held in conjunction with Workshop on High-Speed Local Networks/Workshop on Wireless Local Networks

作者： Han, J McMahon, G Sugden, S Bond Univ Sch Informat Technol Gold Coast Qld Australia

ISBN: (纸本)0769520375

This paper studies the capacitated minimum spanning tree (CMST) problem, which is one of the most fundamental and significant problems in the optimal design of local computer networks. A solution method using a node-oriented branch and bound technique is introduced and its performance is presented. We show the advantages of the algorithm while illustrating the process of searching for the optimal solution. Techniques for finding tighter lower bounds are emphasized. Computational experiences demonstrate the algorithm's effectiveness.

关键词： Bonding Computer networks Costs Graph theory Information technology mixed integer linear programming Tree graphs

来源：评论

学校读者我要写书评

暂无评论

Design of light-tree based logical topologies for multicast streams in wavelength routed optical networks

Design of light-tree based logical topologies for multicast ...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： D.-N. Yang W. Liao Department of Electrical Engineering National Taiwan University Taipei Taiwan

In this paper, we formulate an optimization problem for the design of light-tree based logical topology in wavelength division multiplexing (WDM) networks. The problem is comprised of two parts: (1) multicast routing and wavelength assignment of light-trees, and (2) the design of light-tree based logical topology for multicast streams. In the first part, we use mixed integer linear programming (MILP) to solve the optimal routing and wavelength assignment problem of light-trees with an end-to-end delay bound, and obtain the optimal placement of power splitters and wavelength converters. The numerical results show that networks with just a few power splitters and wavelength converters can efficiently carry multicast data. In the second part, we extend the above formulation to design the logical topology based on light-trees for multicast streams. In our approach, a light-tree can carry data of multiple multicast streams, and data of a multicast stream may traverse multiple light-trees to reach a receiver. The numerical results show that our approach use network resources more efficiently, as compared to the approach with a separate light-tree for a multicast stream and to the approach of transporting multicast streams over lightpath based logical networks.

关键词： Optical design Network topology Wavelength routing Optical fiber networks Wavelength division multiplexing Wavelength assignment Optical wavelength conversion Design optimization WDM networks mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

A node-oriented branch and bound algorithm for the capacitated minimum spanning tree problem

A node-oriented branch and bound algorithm for the capacitat...

引用

Conference on Local Computer Networks (LCN)

作者： Jun Han G. McMahon S. Sugden School of Information Technology Bond University Australia

关键词： Costs Tree graphs Computer networks Information technology Bonding Graph theory mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

A co-evolutionary algorithm for train timetabling

A co-evolutionary algorithm for train timetabling

引用

Congress on Evolutionary Computation

作者： R.S.K. Kwan P. Mistry School of Computing University of Leeds Leeds UK

With many train operating companies sharing limited capacity on the UK rail network, the train timetabling problem is complex and difficult to solve. This paper reports on a cooperative coevolutionary approach for the automatic generation of planning train timetables at the early stages of the timetabling process, when the main objective is to try to accommodate the bids as much as possible and to identify the major conflicts that need resolving by negotiations with the train operating companies. Some test experiments based on artificial problem instances as well as a real network are discussed.

关键词： Rail transportation Technology planning Time sharing computer systems Testing Process planning Lagrangian functions mixed integer linear programming Timing Simulated annealing Evolutionary computation

来源：评论

学校读者我要写书评

暂无评论

System-on-Chip design using intellectual properties with imprecise design costs

System-on-Chip design using intellectual properties with imp...

引用

IEEE International Symposium on Circuits and Systems (ISCAS)

作者： Byoung-Woon Kim Chong-Min Kyung Smart MCU SP BU Hynix Seoul South Korea Department of EECS KAIST Taejon South Korea

ISBN: (纸本)0780377613

This paper presents an IP-based System-on-Chip (SoC) synthesis framework focusing on how to select intellectual properties (IP's) from different sources and how to integrate the selected IP's using on-chip buses. In order to synthesize an on-chip bus-based SoC architecture using IP's with imprecise design costs, we propose a possibilistic mixed integer linear programming (PMILP) model, which is converted into an equivalent mixed integer linear programming (MILP) model without increasing the computational complexity. Experimental results on an MP3 decoding system show that the IP-centric design space with uncertainty can be successfully explored using the proposed scheme.

关键词： System-on-a-chip Costs Computer architecture mixed integer linear programming integer linear programming Design methodology Ear Digital audio players Decoding Uncertainty

来源：评论

学校读者我要写书评

暂无评论

Minimum-energy broadcast routing in wireless multi-hop networks

Minimum-energy broadcast routing in wireless multi-hop netwo...

引用

IEEE International Conference on Performance, Computing and Communications (IPCCC)

作者： Song Guo O. Yang School of Information Technology and Engineering University of Ottawa Ottawa ONT Canada

Energy conservation is a critical issue in wireless multi-hop networks since the nodes are powered by batteries only. One major metric for energy conservation is to route a communication session along the routes which requires the lowest total energy consumption. In this paper, based on the concepts of virtual relay, we present a constraint formulation for the minimum-energy broadcast routing problem in terms of mixed integer linear programming (MIP). Moreover the model extends its analytical capability into more general scenarios in asymmetric networks, where few studies have addressed the broadcast routing problem before. The experiment results show that in a typical multi-hop network with node less than 50, optimal solution can be always solved in a timely manner, and save up to 30% power consumption compared to the most efficient heuristic algorithm BIP known so far.

关键词： Broadcasting Routing Spread spectrum communication Energy conservation Energy consumption Batteries Relays mixed integer linear programming Analytical models Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

Under-relaxed iterative procedure for feasible short-term scheduling of a hydro chain

Under-relaxed iterative procedure for feasible short-term sc...

引用

Power Tech Conference

作者： J. Garcia-Gonzalez E. Parrilla J. Barquin J. Alonso A. Saiz-Chicharro A. Gonzalez Instituto de Investigación Tcmoiógica (IIT) Universidad. Pontifica·Comillas de. Madrid Madrid CP SPAIN Instituto de Investigacidn Teololdgica Universidad Politecnica de Madrid Madrid Spain ENDESA Madrid CP SPAIN

This paper presents a method for short-term hydro scheduling. The objective is to determine a feasible operation of a set of coupled hydro units, fulfilling the aggregate requirements obtained from a higher-level hydrothermal coordination tool. In order to take into account the nonlinear relationship among the electrical power, the net head and the turbine water discharge, an under-relaxed iterative procedure is proposed. The performance of this algorithm enhances previous research works as possible diverging oscillations are damped in order to reach the convergence. Therefore, the net heads used to build the power/discharge curves of the head dependent units are determined using previous iterations results. This way, each stage can be solved by means of a MILP optimization problem where binary variables allow modeling the discrete hydro unit-commitment decisions. The process finishes when the maximum gap between the reservoir levels of two consecutive iterations satisfies the convergence tolerance. A case study is also presented to show its application to a real size hydro chain.

关键词： Reservoirs Power generation Ink Convergence mixed integer linear programming Hydraulic turbines Iterative algorithms Partial discharges Costs Power demand

来源：评论

学校读者我要写书评

暂无评论

Computation of competitive market equilibrium in hydrothermal power systems with cascaded reservoirs

Computation of competitive market equilibrium in hydrotherma...

引用

Power Tech Conference

作者： A.R.M. Guerra J.L.M. Ramos Department of Electrical Engineering University of Seville Seville Spain

In a competitive electricity market, generation companies have to maximize their benefits selecting the best strategy; therefore it is convenient to previously know the resulting spot prices. This paper presents a model to determine market clearing prices and hourly generation levels of each participant over a 24-hour period, including hydrothermal constraints. The optimal competitive market equilibrium problem is formulated as a large-scale mixed integer linear programming algorithm and is solved by using an optimization package. The model incorporates the following elements: thermal plants (maximum up and down ramp), hydro units, hydro systems (cascaded reservoirs, spillway flow, generator I/O characteristic), and inelastic demand. Numerical tests of a day ahead market are presented.

关键词： Power systems Reservoirs Power system modeling Electricity supply industry Power generation Large-scale systems mixed integer linear programming Packaging Character generation Testing

来源：评论

学校读者我要写书评

暂无评论

Building hybrid industrial process model mixed with rules

Building hybrid industrial process model mixed with rules

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Liyan Zhang Longhua Ma Yongling Zheng Jixin Qian National Laboratory of Industrial Control Technology Institute of Systems Engineering University of Zhejiang Hangzhou China

ISBN: (纸本)0780379527

In process control fields it is hard to build precise model due to complexity and nonlinear of industrial process. To solve this problem, this paper proposes a framework for modeling and controlling systems integrating continuous variable linear model and rules. A predictive control scheme is proposed which is able to stabilize this framework on desired reference trajectories. This problem can be solved as mixed-integer linear programming/ Constraint programming (MILP/CP). We use MILP to optimize and find partial solutions and CP to check feasibility and produce complete solutions. An example demonstrates how problems can be modeled and solved using this framework.

关键词： Electrical equipment industry Predictive control integer linear programming Industrial control Predictive models Process control mixed integer linear programming Artificial neural networks Equations Laboratories

来源：评论

学校读者我要写书评

暂无评论

Aggregate planning in supply chains by pinch analysis

引用

CHEMICAL ENGINEERING RESEARCH & DESIGN 2002年第A6期80卷 597-605页

作者： Singhvi, A Shenoy, UV Indian Inst Technol Dept Chem Engn Bombay 400076 Maharashtra India

This work presents a novel extension of the targeting methods front pinch analysis to aggregate planning in supply chains. Aggregate planning aims at meeting demand over a specified time horizon in a way that maximizes profit through optimal levels of production, capacity, subcontracting, inventory, and stockouts. It is demonstrated how minimum production rates for a given demand forecast may be targeted through composite curves on a time versus material quantity plot. The grand composite curve (GCC) representation may be conveniently used to depict how surpluses and shortages in inventory fluctuate over time. The pinch corresponds to the point of minimum lead time and zero inventory. An example problem is used to illustrate the approach. The initial aggregate plan from pinch analysis exactly matches the solution reported in literature obtained by solving a linear programming formulation. On the other hand, the final aggregate plans from the pinch targeting method are superior to the solution in literature, as they are more realistic. It may be concluded that the production composite determined by the pinch targeting method provides either the best aggregate plan or an excellent starting point to reduce computational time for a solution by mixed integer linear programming.

关键词： pinch analysis supply chain management production planning cost targeting resource optimization mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：