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

作者： Aytekin, Mehmet Naval Postgraduate School

学位级别：硕士

Capital Investment Planning Aid (CIPA) is an optimization-based decision support system created for the U. S. Navy to help plan yearly force structure procurement and retirement. CIPA constraints include yearly industrial and budget limits, as well as mission inventory and force mix requirements. Over a 30-year planning horizon, CIPA helps plan over $1 trillion. Several approaches have been proposed and implemented to solve the CIPA core, a mixed-integer linear program (MILP). Unfortunately, some of these MILPs cannot be solved in a reasonable amount of time using general-purpose commercially available optimization software. This thesis presents a new MILP-based heuristic technique, fix-and-relax, that yields good quality solutions and reduces the computational solution time for our set of realistic test cases.

关键词： Operations Research Capital Investment Planning Aid CIPA Heuristic Optimization integer linear programming

来源：评论

学校读者我要写书评

暂无评论

A methodology for determining cutting stock sizes and cutting patterns

引用

INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING-THEORY APPLICATIONS AND PRACTICE 2002年第4期9卷 351-362页

作者： Holthaus, O Univ Passau Fac Business Adm & Econ Dept Prod Operat & Logist Management D-94032 Passau Germany

This paper considers a real-world cutting problem arising from caravan manufacturing companies. For each caravan large stock sizes have to be cut into smaller sizes required for finishing the front panels of the furniture. In order to minimize the total cost of the stock material needed for cutting the smaller sizes for all units of all caravan models of a yearly production plan, the best combination of stock sizes to keep in inventory has to be selected and for each caravan model the cutting patterns have to be determined. For simultaneously solving the stock size selection problem and a series of cutting pattern selection problems, a methodology based on an enumeration scheme for the possible combinations of different stock sizes and integer linear programming is presented. For the real-world problem under study, the results of the computational experiments prove the effectiveness of the proposed methodology.

关键词： assortment problem cutting stock problem stock size selection cutting pattern selection cost minimization integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Dynamic sectorization of microcells for balanced traffic in CDMA: genetic algorithms approach

引用

IEEE Transactions on Vehicular Technology 2002年第1期51卷 63-72页

作者： C.Y. Lee H.G. Kang Taehoon Park Department of Industrial Engineering Korea Advanced Institute of Science and Technology Taejon South Korea Contela Inc. Kyunggi South Korea

With the increase of cellular users, traffic hot spots and unbalanced call distributions are common in wireless networks. As a solution to this problem, code-division multiple-access techniques enable a base transceiver station to connect microcells with optical fibers and to control the channels by sectorizing the microcells. To solve the load balancing among microcells, we dynamically sectorize the microcells depending on the time-varying traffic. The microcell sectorization problem is formulated as an integer linear programming that minimizes the blocked and handoff calls in the network. In the proposed sectorization, proper, connected, and compact sectors are considered to keep the handoffs as small as possible while satisfying the channel capacity at each sector. Three genetic algorithms (GAs) are proposed to solve the problem: standard GA, grouping GA, and parallel GA. Computational results show that the proposed GAs are highly effective. All three GAs illustrate outstanding performance for small size problems. The parallel GA, which is based on the operators used in grouping GA, demonstrates excellent solution quality in a reasonable time.

关键词： Microcell networks Multiaccess communication Communication system traffic control Cellular networks Wireless networks Transceivers Optical fibers Optical control Load management integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Traffic grooming for minimizing wavelength usage in WDM networks

Traffic grooming for minimizing wavelength usage in WDM netw...

引用

International Conference on Computer Communications and Networks (ICCCN)

作者： Deying Li Zhenqiang Sun Xiaohua Jia S. Makki Department of Computer Science City University of Hong Kong Hong Kong Hong Kong China School of Computing Science Queensland University of Technology Australia

We consider the traffic grooming problem on general topology WDM networks. The problem is: given a set of t connections and their routes, and the grooming factor g, to find an optimal wavelength assignment and grooming such that the number of wavelengths required in the network is minimized. We first formulate this problem as an integer linear programming problem, and then propose a heuristics method to solve it. Our simulation results show that an increase of the grooming factor can considerably decrease the number of wavelengths required in the system.

关键词： Telecommunication traffic Intelligent networks WDM networks Bandwidth Wavelength division multiplexing Add-drop multiplexers Network topology Wavelength assignment integer linear programming Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

ILP modelling of the common subexpression sharing problem

ILP modelling of the common subexpression sharing problem

引用

IEEE International Conference on Electronics, Circuits and Systems (ICECS)

作者： O. Gustafsson L. Wanhammar Department of Electrical Engineering Linköping University Linkoping Sweden

Subexpression sharing is an important implementation issue when one data is multiplied with many constants or a sum of products is computed. By modelling the subexpression sharing problem using integer linear programming (ILP) an optimal solution can be found. Further, the model can be directly incorporated with the design of algorithms that have linear design constraints, e.g., linear-phase FIR filters. The proposed method is compared with previously reported algorithms. It produces better results than other subexpression sharing methods, even though it is still not comparable with the optimal method based on graph representation. However, the possibility to expand the ILP model beyond subexpression sharing is discussed. This would then produce identical results to the optimal adder graph method.

关键词： Finite impulse response filter Pattern matching integer linear programming Algorithm design and analysis Digital signal processing Hardware Costs Flow graphs Process design

来源：评论

学校读者我要写书评

暂无评论

Power-performance trade-offs for energy-efficient architectures: A quantitative study

Power-performance trade-offs for energy-efficient architectu...

引用

IEEE International Conference on Computer Design: VLSI in Computers and Processors, (ICCD)

作者： Hongbo Yang R. Govindarajan G.R. Gao K.B. Theobald Electrical and Computer Engineering University of Delaware Newark USA Department of Computer Science & Automation Indian Institute of Science Bangalore Karnataka India

The drastic increase in power consumption by modern processors emphasizes the need for power-performance trade-offs in architecture design space exploration and compiler optimizations. This paper reports a quantitative study on the power-performance trade-offs in software pipelined schedules for an Itanium-like EPIC architecture with dual-speed pipelines, in which functional units are partitioned into fast ones and slow ones. We have developed an integer linear programming formulation to capture the power-performance tradeoffs for software pipelined loops. The proposed integer linear programming formulation and its solution method have been implemented and tested on a set of SPEC2000 benchmarks. The results are compared with an Itanium-like architecture (baseline) in which there are four functional units (FUs) and all of them are fast units. Our quantitative study reveals that by introducing a few slow FUs in place of fast FUs in the baseline architecture, the total energy consumed by FUs can be considerably reduced. When 2 out of 4 FUs are set as slow, the total energy consumed by FUs is reduced by up to 31.1% (with an average reduction of 25.2%) compared with the baseline configuration, while the performance degradation caused by using slow FUs is small. If performance demand is less critical, then energy reduction of up to 40.3% compared with the baseline configuration can be achieved.

关键词： Energy efficiency Computer architecture integer linear programming Energy consumption Space exploration Design optimization Optimizing compilers Processor scheduling Pipelines Testing

来源：评论

学校读者我要写书评

暂无评论

A comprehensive approach for FACTS devices optimal allocation to mitigate voltage collapse

A comprehensive approach for FACTS devices optimal allocatio...

引用

IEEE/PES Transmission and Distribution Conference and Exhibition: Asia and Pacific

作者： E.E. El-Araby N. Yorino H. Sasaki Department of Electrical Engineering Hiroshima University Japan

This paper presents a comprehensive approach for optimal allocation of FACTS devices against voltage collapse. The objective is to install a minimum number and sizes of FACTS so that the preventive and corrective control are made possible based on the available VAR sources and new FACTS devices for a set of contingencies. The corrective control is to stabilize the system for the contingencies that drive the system to unstable zone, where the fast devices are merely used for these situations. The preventive control is assumed based on the slow and fast devices for the cases with an inadequate security margin. The problem is formulated as mixed integer nonlinear programming problem, where a hybrid method based on genetic algorithm/successive linear programming (GA/SLP) is used to find the optimal solution.

关键词： Costs Reactive power Control systems Power system stability Voltage control integer linear programming Power generation economics Environmental economics Power system security Power systems

来源：评论

学校读者我要写书评

暂无评论

Wavelength assignment to minimize the number of SONET ADMs in WDM rings

Wavelength assignment to minimize the number of SONET ADMs i...

引用

IEEE International Conference on Communications (ICC)

作者： Xin Yuan A. Fulay Department of Computer Science Florida State University Tallahassee FL USA

ISBN: (纸本)0780374002

Optical wavelength division multiplexing (WDM) rings are being deployed to support SONET/SDH self-healing rings. The cost of such a system is dominated by the SONET add/drop multiplexers (ADM). To minimize the system cost, algorithms must be developed to assign wavelengths to lightpaths in the system so that the number of ADM required is minimized. This problem of optimal wavelength assignment to minimize the number of SONET ADM is NP-hard. In this paper, we develop an integer linear programming (ILP) formation for this problem, propose a new wavelength assignment heuristic, and evaluate the existing and the newly proposed heuristic using the ILP formation. We conclude that the performance of the newly proposed heuristic is very close to optimal.

关键词： Wavelength assignment Add-drop multiplexers Wavelength division multiplexing SONET Costs Synchronous digital hierarchy integer linear programming Iterative algorithms Computer science Protection

来源：评论

学校读者我要写书评

暂无评论

Traffic grooming in WDM networks with multi-layer switches

Traffic grooming in WDM networks with multi-layer switches

引用

IEEE International Conference on Communications (ICC)

作者： G. Huiban S. Perennes M. Syska MASCOTTE I3S-INRIA 2004 Sophia-Antipolis France

ISBN: (纸本)0780374002

We develop traffic grooming algorithms for WDM networks with multi-layer switches. We consider a node as an N-layer switch, in which a given layer k is an aggregated set of elements of layer k-1. Typical examples of layers are wavelengths, bands and fibers. The cost of a given node depends on the number of input and output ports of each layer. Assuming this model and a traffic matrix - with unity elements in layer 0 - minimizing the cost of the network consists of grooming traffic in such a way that as much traffic as possible is switched in the highest possible layer (fibers in our example). When some traffic is switched along a path in the network within the same layer, we represent it with a pipe. Each pipe has an associated linear cost depending on the current layer and on the number of nodes crossed in that pipe. In the case of a two layers model the problem was considered in Gerstel et al. (2000) for rings or in Cinker et al. (2000) for general topologies. We present an integer linear programming formulation for this model that aims to minimize the overall cost of the network for a given input traffic matrix. We ran experiments using the CPLEX optimization package on various topologies such as actual networks like the Pan-European all optical network (Batchelor et al. (1999)) as well as rings and meshes of various sizes.

关键词： Telecommunication traffic WDM networks Traffic control Switches Costs Network topology integer linear programming Radio access networks Packaging All-optical networks

来源：评论

学校读者我要写书评

暂无评论

Multi-domain mesh optical network protection using Hamiltonian cycles

Multi-domain mesh optical network protection using Hamiltoni...

引用

IEEE Workshop on High Performance Switching and Routing

作者： Hong Huang J.A. Copeland Comm System Centre School of Electrical & Computer Engineering Georgia Institute of Technology Atlanta GA USA

Designing simple and efficient network protection mechanism is an important requirement of optical networks, which is a challenging task for large mesh networks. We extend our previous work on Hamiltonian cycle protection to large-scale multiple domain inhomogeneous optical networks. We proposed two protection schemes with different trade-off between spare resource usage and failure isolation. Our proposed schemes are simple and competitive in network resource usage.

关键词： Optical fiber networks Protection Optical design Telecommunication traffic Traffic control SONET Mesh networks Large-scale systems Optimization methods integer linear programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：