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

International Conference on Emerging Trends in Engineering, Technology and Science (ICETETS)

作者： R. Agalya S. Saravanan School of Computing SASTRA University Thanjavur India

ISBN: (纸本)9781467367264

Post-silicon validation is the most vital parts of modern Integrated Circuits. The key challenge of silicon validation is that it has limited observability and controllability of internal signals. To improve those, a profitable set of signals should be selected. An automated procedure is proposed to select those signals which are used to facilitate early malfunctions of the design. Given the input vector set to the design an error transmission matrix is generated. From that, both relatively independent and dependent flip-flops are identified for grouping the signals through mixed-integer linear programming. This method precisely identifies the paths which improves observability and can speed up the process.

关键词： Observability Computer bugs Silicon Flip-flops Controllability mixed integer linear programming linear programming

来源：评论

学校读者我要写书评

暂无评论

mixed-integer linear programming for Multibeam Satellite Systems Design: Application to the Beam Layout Optimization

Mixed-Integer Linear Programming for Multibeam Satellite Sys...

引用

Annual IEEE International Systems Conference

作者： Jean-Thomas Camino Christian Artigues Laurent Houssin Stephane Mourgues Airbus Defence and Space Space Systems Telecommunication Systems Department CNRS LAAS

ISBN: (纸本)9781467395205

In a society where the demand for multimedia applications and data exchange is experiencing an unstoppable growth, multibeam systems have proven to be one of the most relevant solutions for satellite-based communication systems. Though already well represented among the geostationary satellites today, there are still several unresolved design optimization challenges for these complex systems that could lead to improved performances and to better system costs. The satellite platform, the repeater, and the antennas are examples of subsystems that should be designed jointly in order to reach an optimized technical solution that fulfills the service requirements. Traditionally, such complex tasks are addressed through a decomposition of the overall system design into a sequence of smaller decision problems. In this article, we propose to rely on operations research techniques to, on the one hand, take into account explicitly the interdependencies of these decomposed problems, and on the other hand, to handle the own constraints of each subsystem and their interactions. In this paper, the focus is laid on the optimization of the beam layouts of the multibeam satellites. Indeed, in addition to being a perfect example of the aforementioned importance of dealing with subsystem constraints, this problem appears early in the chain of design of a multibeam satellite system and is therefore critical for the quality of the telecommunication system;the weaknesses of a beam layout cannot be made up for later on in the system design. For this crucial optimization phase, the strength of the methodology we propose in this paper is to use mixed-integer linear programming to incorporate explicitly technological feasibility constraints of the subsystems involved, while preparing at best the subsequent design problems. Most importantly, our approach allows to overcome several resisting flaws of the already existing algorithms.

关键词： Satellite Telecommunications Systems Design mixed-integer linear programming Operations Research Operations Research SUB-SYSTEM System design mixed integer linear programming Satellite communication systems engineering Satellite systems layouts Telecommunication systems Satellite platforms integer linear programming Beams and girders

来源：评论

学校读者我要写书评

暂无评论

Inter-sample avoidance in trajectory optimizers using mixed-integer linear programming

引用

INTERNATIONAL JOURNAL OF ROBUST AND NONlinear CONTROL 2015年第4期25卷 521-526页

作者： Richards, Arthur Turnbull, Oliver Univ Bristol Dept Aerosp Engn Bristol Avon England Univ Bristol Dept Aerosp Engn Bristol Avon England

This paper proposes an extension to trajectory optimization using mixed-integer linear programming. The purpose of the extension is to ensure that avoidance constraints are respected at all times between discrete samples, not just at the sampling times themselves. The method is very simple and involves applying the same switched constraints at adjacent time steps. This requires fewer additional constraints than the existing approach and is shown to reduce computation time. A key benefit of efficient inter-sample avoidance is the facility to reduce the number of time steps without having to compensate by enlarging the obstacles. A further extension to the principle is presented to account for curved paths between samples, proving useful in cases where narrow passageways are traversed. Copyright (c) 2013 John Wiley & Sons, Ltd.

关键词： trajectory optimization mixed integer linear programming collision avoidance

来源：评论

学校读者我要写书评

暂无评论

A mixed integer linear programming model and variable neighborhood search for Maximally Balanced Connected Partition Problem

引用

APPLIED MATHEMATICS AND COMPUTATION 2014年 237卷 85-97页

作者： Matic, Dragan Univ Banja Luka Fac Math & Nat Sci Banja Luka 78000 Bosnia & Herceg

This paper deals with Maximally Balanced Connected Partition (MBCP) problem. It introduces a mixed integer linear programming (MILP) formulation of the problem with polynomial number of variables and constraints. Also, a variable neighborhood search (VNS) technique for solving this problem is presented. The VNS implements the suitable neighborhoods based on changing the component for an increasing number of vertices. An efficient implementation of the local search procedure yields a relatively short running time. The numerical experiments are made on instances known in the literature. Based on the MILP model, tests are run using two MILP solvers, CPLEX and Gurobi. It is shown that both solvers succeed in finding optimal solutions for all smaller and most of medium scale instances. Proposed VNS reaches most of the optimal solutions. The algorithm is also successfully tested on large scale problem instances for which optimal solutions are not known. (C) 2014 Elsevier Inc. All rights reserved.

关键词： Balanced graphs Graph partitioning mixed integer linear programming Variable neighborhood search Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

On reduction of the multistage problem of stochastic programming with quantile criterion to the problem of mixed integer linear programming

引用

AUTOMATION AND REMOTE CONTROL 2014年第4期75卷 688-699页

作者： Kibzun, A. I. Khromova, O. M. Moscow State Aviat Inst Moscow Russia

Consideration was given to the a priori formulation of the multistage problem of stochastic programming with a quantile criterion which is reducible to the two-stage problem. Equivalence of the two-stage problems with the quantile criterion in the a priori and a posteriori formulations was proved for the general case. The a posteriori formulation of the two-stage problem was in turn reduced to the equivalent problem of mixed integer linear programming. An example was considered.

关键词： mixed integer linear programming STOCHASTIC programming A priori EQUIVALENCE classes (Set theory) CONSTRAINT programming (Computer science)

来源：评论

学校读者我要写书评

暂无评论

Closed loop supply chain network design and optimisation using fuzzy mixed integer linear programming model

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2014年第14期52卷 4156-4173页

作者： Jindal, Anil Sangwan, Kuldip Singh Birla Inst Technol & Sci Dept Mech Engn Pilani Rajasthan India

Owing to the revolution in sustainable and green manufacturing the production planning and network design of closed loop supply chain concept has got the attention of researchers and managers. In this paper, a multi-product, multi-facility capacitated closed-loop supply chain framework is proposed in an uncertain environment including reuse, refurbish, recycle and disposal of parts. The uncertainty related to demand, fraction of parts recovered for different product recovery processes, product acquisition cost, purchasing cost, transportation cost, processing, and set-up cost is handled with fuzzy numbers. A fuzzy mixed integer linear programming model is proposed to decide optimally the location and allocation of parts at each facility and number of parts to be purchased from external suppliers in order to maximise the profit of organisation. The proposed solution methodology is able to generate a balanced solution between the feasibility degree and degree of satisfaction of the decision maker. The proposed model has been tested with an illustrative example.

关键词： closed loop supply chain mixed integer linear programming fuzzy numbers reverse logistics

来源：评论

学校读者我要写书评

暂无评论

Hybrid simulated annealing and mixed integer linear programming algorithm for optimal planning of radial distribution networks with distributed generation

引用

ELECTRIC POWER SYSTEMS RESEARCH 2014年 108卷 211-222页

作者： Popovic, Z. N. Kerleta, V. Dj. Popovic, D. S. Univ Novi Sad Fac Tech Sci Novi Sad 21000 Serbia Univ Novi Sad Tech Fac Mihailo Pupin Zrenjanin 23000 Serbia

This paper presents a hybrid simulated annealing (SA) and mixed integer linear programming (MILP) approach for static expansion planning of radial distribution networks with distributed generators (DGs). The expansion planning problem is first modeled as MILP optimization problem with the goal of minimizing the investment cost, cost of losses, cost of customer interruptions due to failures at the branches and at DGs and the cost of lost DG production due to failures at branches. In order to reduce the complexity of planning problems the decomposition of the original problem is proposed into a number of sequences of sub-problems (local networks) that are solved using the MILP model. The decomposition and solution process is iteratively guided and controlled by the proposed SA algorithm that employs the proper intensification and diversification mechanism to obtain the minimum total cost solution. (C) 2013 Elsevier B.V. All rights reserved.

关键词： Distribution network planning Distributed generators Decomposition approach mixed integer linear programming Simulated annealing

来源：评论

学校读者我要写书评

暂无评论

Planning of Distribution Systems Using mixed-integer linear programming Models Considering Network Reliability

引用

JOURNAL OF CONTROL AUTOMATION AND ELECTRICAL SYSTEMS 2015年第2期26卷 170-179页

作者： de Souza, Joao Rider, Marcos J. Sanches Mantovani, Jose Roberto Univ Fed Mato Grosso Dept Matemat Cuiaba MT Brazil Univ Estadual Paulista Fac Engn Ilha Solteira Dept Engn Eletr Sao Paulo Brazil

In this paper, a two-stage solution methodology for distribution network planning considering reliability indices improvement is proposed. This methodology comprises optimal distribution network expansion and improves network reliability by allocating sectionalizing switches and interconnection circuits (tie line circuits). The optimal expansion problem of radial aerial distribution systems is formulated as a mixed binary linear programming (MILP) problem aiming to reduce the investment and operational costs, subject to physical and operational constraints. The allocation of controlled sectionalizing switches and interconnection circuits is also formulated as a MILP in order to improve the network reliability indices. A pseudo-dynamic planning method is used to solve planning and reliability models through a heuristic technique that first solves the planning model followed by the solution of the reliability model, in each stage of planning horizon. Numerical results are presented for a 54-bus distribution system from literature.

关键词： Distribution systems planning Reliability indices mixed integer linear programming Mathematical models

来源：评论

学校读者我要写书评

暂无评论

A mixed integer linear programming solution for single hoist multi-degree cyclic scheduling with reentrance

引用

ENGINEERING OPTIMIZATION 2014年第5期46卷 704-723页

作者： Li, Xin Fung, Richard Y. K. City Univ Hong Kong Dept Syst Engn & Engn Management Hong Kong Hong Kong Peoples R China

This article considers single hoist multi-degree cyclic scheduling problems with reentrance. Time window constraints are also considered. Firstly, a mixed integer programming model is formulated for multi-degree cyclic hoist scheduling without reentrance, referred to as basic lines in this article. Two valid inequalities corresponding to this problem are also presented. Based on the model for basic lines, an extended mixed integer programming model is proposed for more complicated scheduling problems with reentrance. Phillips and Unger's benchmark instance and randomly generated instances are applied to test the model without reentrance, solved using the commercial software CPLEX. The efficiency of the model is analysed based on computational time. Moreover, an example is given to demonstrate the effectiveness of the model with reentrance.

关键词： hoist scheduling problems mixed integer linear programming multi-degree cycle reentrance robotic cells

来源：评论

学校读者我要写书评

暂无评论

Spillways Scheduling for Flood Control of Three Gorges Reservoir Using mixed integer linear programming Model

引用

MATHEMATICAL PROBLEMS IN ENGINEERING 2014年第1期2014卷 1-9页

作者： Feng, Maoyuan Liu, Pan Wuhan Univ State Key Lab Water Resources & Hydropower Engn S Wuhan 430072 Peoples R China Hubei Prov Collaborat Innovat Ctr Water Resources Wuhan 430072 Peoples R China

This study proposes a mixed integer linear programming (MILP) model to optimize the spillways scheduling for reservoir flood control. Unlike the conventional reservoir operation model, the proposed MILP model specifies the spillways status (including the number of spillways to be open and the degree of the spillway opened) instead of reservoir release, since the release is actually controlled by using the spillway. The piecewise linear approximation is used to formulate the relationship between the reservoir storage and water release for a spillway, which should be open/closed with a status depicted by a binary variable. The control order and symmetry rules of spillways are described and incorporated into the constraints for meeting the practical demand. Thus, a MILP model is set up to minimize the maximum reservoir storage. The General Algebraic Modeling System (GAMS) and IBM ILOG CPLEX Optimization Studio (CPLEX) software are used to find the optimal solution for the proposed MILP model. The China's Three Gorges Reservoir, whose spillways are of five types with the total number of 80, is selected as the case study. It is shown that the proposed model decreases the flood risk compared with the conventional operation and makes the operation more practical by specifying the spillways status directly.

关键词： SPILLWAYS SCHEDULING FLOOD control GORGES mixed integer linear programming FLOOD risk

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：