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

IEEE International Conference on Communications

作者： Cong Wang Shashank Shanbhag Tilman Wolf Department of Electrical and Computer Engineering University of Massachusetts

ISBN: (纸本)9781457720529

Network virtualization is a core technology in next-generation networks to overcome the ossification problem that is observed in the current Internet. The key idea of network virtualization is to split physical network resources into multiple logical networks, each supporting different network services and functionalities. One of the key challenges for virtual network infrastructure providers is to efficiently allocate network resources based on virtual network requests, which is referred to as the virtual network mapping problem. While several algorithms have been proposed previously to solve this mapping problem, their effectiveness is limited since virtual requests specify the internal topology of the virtual network. In this paper, we argue that such internal topologies lead to unnecessary constraints and less efficient solutions. Instead, we propose an alternate formulation of the problem that represents virtual network requests as traffic matrices. We provide a solutions to solving this traffic-matrix-based mapping problem using a mixed integer programming formulation. Our simulation results show that our approach can map significantly more virtual network requests on a physical network infrastructure than previous mapping algorithms and thus improves the efficient use of networking resources in virtual networks.

关键词： mixed integer programming Network virtualization Traffic matrix Virtual network embedding Virtual networks Web resources Key technology physical network MAPPING(MATHEMATICAL) Next generation networks Problem Formulation

来源：评论

学校读者我要写书评

暂无评论

Integration Schedule of Agile Satellite Based on Improved Ant Colony Algorithm

Integration Schedule of Agile Satellite Based on Improved An...

引用

2012 IEEE 3rd International Conference on Emergency Management and ManagementSciences(ICEMMS 2012)

作者： Zhenzhen Yan and Yingwu Chen College of Information System and Management National University of Defense Technology, Changsha, Hunan Province, China

Integration schedule of agile satellite is a highly complex combinatorial optimization problem. Pointed at the long time-window brought by the three degrees of freedom of agile satellite, combined with the dynamic store capacity in the integration schedule, a mixed integer program model is built. Then an improved ant colony algorithm is proposed to solve this problem. And local search mechanism is introduced to speed up the convergence of ant colony algorithm. Finally, multiple instances are tested. The result shows that the proposed improved ant colony algorithm is effective in solving the integration schedule of agility satellite.

关键词： mixed integer programming local search statistic analysis

来源：评论

学校读者我要写书评

暂无评论

Resource Transition Model under MISO MIP Based Look Ahead Commitment

Resource Transition Model under MISO MIP Based Look Ahead Co...

引用

IEEE Power and Energy Society General Meeting

作者： Yonghong Chen Vijaya Ganugula John Williams Jie Wan Ying Xiao MISO Carmel IN Alstom Grid

ISBN: (纸本)9781467327275

MISO is in the process of implementing Look Ahead Commitment (LAC) to bridge the gap between Reliability Assessment Commitment (RAC) and Real Time Security Constrained Economic Dispatch (RT-SCED) timeframes. This paper introduces two models in LAC pre-processing logic. The first one is anticipatory startup and shutdown model to account for resource megawatt output during resource startup and shutdown. The second one is an infeasibility identification model to identify data conflicts between state estimation, unit commitment plan and offered parameters. The goal of these two modules is to properly estimate non-dispatchable resource outputs and resolve infeasibility from input data so that LAC can achieve good mixed integer programming (MIP) solutions.

关键词： Ancillary services Co-optimization Dispatch and scheduling Reserve Unit commitment 1 mixed integer programming multiple-input single-output shellac lookahead Commitment MIP gene

来源：评论

学校读者我要写书评

暂无评论

Short-term Resource Scheduling for Power systems with Energy Storage Systems

Short-term Resource Scheduling for Power systems with Energy...

引用

IEEE Power and Energy Society General Meeting

作者： Se-Hwan Jang Jong-Bae Park Jae Hyung Roh Sung-Yong Son Kwang Y. Lee the Department of Electrical Engineering Konkuk University Seoul 143-701 Korea the Department of Energy IT Kyungwon University Seoul Korea the Department of Electrical and Computer Engineering Baylor University Waco TX 76798 USA

ISBN: (纸本)9781467327299

Energy Storage Systems (ESS) could be widely available in power systems, in which case the short-term scheduling is one of the essential problems that need to be addressed. This paper presents a resources scheduling method for the optimal operation plan with the energy storage systems, which utilizes the mixed integer programming (MIP) based on the branch and bound method. The proposed method is evaluated on two case studies. One study examines a daily optimal operational plan for power supply resources and energy storage systems in an isolated micro-grid system. Another examines the optimal operational plan in a conventional power system with a large-scale energy storage system.

关键词： Index Terms-Short-term scheduling Energy Storage Systems Renewable Energy System mixed integer programming

来源：评论

学校读者我要写书评

暂无评论

Setting sites for faster results: Optimizing locations and capacities of new tuberculosis testing laboratories

引用

IIE Transactions on Healthcare Systems Engineering 2012年第4期2卷 248-258页

作者： Saveh-Shemshaki, Fatemeh Shechter, Steven Tang, Patrick Isaac-Renton, Judith Centre for Operations Excellence Robert H. Lee Graduate School Sauder School of Business University of British Columbia Vancouver BC V6T 1Z2 2033 Main Mall Canada British Columbia Centre for Disease Control (BCCDC) Public Health and Microbiology Reference Laboratory (PHMRL) Provincial Health Services Authority Vancouver BC V5Z 4R4 655 West 12th Avenue Canada Department of Pathology and Laboratory Medicine Faculty of Medicine University of British Columbia Vancouver BC Canada

A reduced turnaround time to obtain initial test results for detecting the bacterial agent that causes tuberculosis (TB) can significantly improve the management of this communicable disease. We propose a new facility location modeling approach for designing a network of TB testing laboratories so as to reduce transportation times and thereby decrease overall test turnaround time. Our mathematical formulation chooses new laboratory facility locations, the capacities of those laboratories, as well as the assignment of TB samples to regional laboratories so as to minimize total sample transportation time, while considering constraints on the laboratory capacities, budget, and maximum transportation times between any origin and the testing laboratory. We ran the model using the TB testing demand and laboratory data for the TB reference laboratory in the Canadian province of British Columbia (BC), and demonstrate its potential to improve patient care and population health by optimizing the locations of additional testing laboratories. Furthermore, we explored data limitations and assumptions through several sensitivity analyses. © 2012 Copyright Taylor and Francis Group, LLC.

关键词： Facility location model mixed integer programming tuberculosis testing

来源：评论

学校读者我要写书评

暂无评论

Grammar-Based integer programming Models for Multiactivity Shift Scheduling

引用

MANAGEMENT SCIENCE 2011年第1期57卷 151-163页

作者： Cote, Marie-Claude Gendron, Bernard Rousseau, Louis-Martin Ecole Polytech CIRRELT Montreal PQ H3C 3A7 Canada Ecole Polytech Dept Math & Genie Ind Montreal PQ H3C 3A7 Canada Univ Montreal CIRRELT Montreal PQ H3C 3J7 Canada Univ Montreal Dept Informat & Rech Operat Montreal PQ H3C 3J7 Canada

This paper presents a new implicit formulation for shift scheduling problems, using context-free grammars to model the rules for the composition of shifts. From the grammar, we generate an integer programming (IP) model having a linear programming relaxation equivalent to that of the classical set covering model. When solved by a state-of-the-art IP solver on problem instances with a small number of shifts, our model, the set covering formulation, and a typical implicit model from the literature yield comparable solution times. On instances with a large number of shifts, our formulation shows superior performance and can model a wider variety of constraints. In particular, multiactivity cases, which cannot be modeled by existing implicit formulations, can easily be handled with grammars. We present comparative experimental results on a large set of instances involving one work activity, as well as on problems dealing with up to 10 work activities.

关键词： shift scheduling implicit models mixed integer programming context-free grammars

来源：评论

学校读者我要写书评

暂无评论

Scheduling wafer slicing by multi-wire saw manufacturing in photovoltaic industry: a case study

引用

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY 2011年第9-12期53卷 1129-1139页

作者： Guimaraes, Luis Santos, Rui Almada-Lobo, Bernardo Univ Porto Fac Engn P-4100 Oporto Portugal

Wafer slicing in photovoltaic industry is mainly done using multi-wire saw machines. The selection of set of bricks (parallelepiped block of crystalline silicon) to be sawn together poses difficult production scheduling decisions. The objective is to maximize the utilization of the available cutting length to improve the process throughput. We address the problem presenting a mathematical formulation and an algorithm that aims to solve it in very short running times while delivering superior solutions. The algorithm employs a reactive greedy randomized adaptive search procedure with some enhancements. Computational experiments proved its effectiveness and efficiency to solve real-world based problems and randomly generated instances. Implementation of an on-line decision system based on this algorithm can help photovoltaic industry to reduce slicing costs making a contribution for its competitiveness against other sources of energy.

关键词： Multi-wire saw wafer slicing Operational research Production scheduling mixed integer programming Metaheuristics

来源：评论

学校读者我要写书评

暂无评论

Single and parallel machine capacitated lotsizing and scheduling: New iterative MIP-based neighborhood search heuristics

引用

COMPUTERS & OPERATIONS RESEARCH 2011年第12期38卷 1816-1825页

作者： James, Ross J. W. Almada-Lobo, Bernardo Univ Canterbury Dept Management Christchurch 8140 New Zealand Univ Porto Fac Engn P-4100 Oporto Portugal

We propose a general-purpose heuristic approach combining metaheuristics and mixed integer programming to find high quality solutions to the challenging single- and parallel-machine capacitated lotsizing and scheduling problem with sequence-dependent setup times and costs. Commercial solvers fail to solve even medium-sized instances of this NP-hard problem;therefore, heuristics are required to find competitive solutions. We develop construction, improvement and search heuristics all based on MIP formulations. We then compare the performance of these heuristics with those of two metaheuristics and other MIP-based heuristics that have been proposed in the literature, and to a state-of-the-art commercial solver. A comprehensive set of computational experiments shows the effectiveness and efficiency of the main approach, a stochastic MIP-based local search heuristic, in solving medium to large size problems. Our solution procedures are quite flexible and may easily be adapted to cope with model extensions or to address different optimization problems that arise in practice. (C) 2011 Elsevier Ltd. All rights reserved.

关键词： CLSD-PM Sequence-dependent setup mixed integer programming Relax-and-fix Local search Metaheuristic Parallel machine

来源：评论

学校读者我要写书评

暂无评论

An iterative deadlock prevention approach for automated manufacturing systems

引用

TRANSACTIONS OF THE INSTITUTE OF MEASUREMENT AND CONTROL 2011年第1期33卷 59-76页

作者： Hu, H. S. Xidian Univ Sch Electromech Engn Xian Shaanxi Peoples R China

This paper considers an iterative deadlock prevention policy in the context of the automated manufacturing systems (AMS) that constitute one of the major production technologies in modern industry. Owing to the specialty of an AMS, the reachability graph (RG) of its given Petri net model shows powerful analysis and control capability to crack such a hard nut. However, the fact that the number of nodes involved in an RG grows exponentially with the size of a Petri net model makes all the RG-based policies infeasible. The approach conducted in this paper illustrates that the bad nodes in an RG can be extracted iteratively by a set of mixed integer programming formulations so that the explicit enumeration of all nodes of the RG is avoided. The proposed approach promises a computationally efficient policy that guarantees a nearly optimal liveness-enforcing supervisor.

关键词： automated manufacturing system deadlock prevention mixed integer programming Petri net reachability graph

来源：评论

学校读者我要写书评

暂无评论

Design of progressively censored group sampling plans for Weibull distributions: An optimization problem

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2011年第3期211卷 525-532页

作者： Fernandez, Arturo J. Perez-Gonzalez, Carlos J. Aslam, Muhammad Jun, Chi-Hyuck Univ La Laguna Dept Estadist & Invest Operat Tenerife 38271 Spain Forman Christian Coll Univ Dept Stat Lahore 54000 Pakistan POSTECH Dept Ind & Management Engn Pohang 790784 South Korea

Optimization algorithms provides efficient solutions to many statistical problems. Essentially, the design of sampling plans for lot acceptance purposes is an optimization problem with several constraints, usually related to the quality levels required by the producer and the consumer. An optimal acceptance sampling plan is developed in this paper for the Weibull distribution with unknown scale parameter. The proposed plan combines grouping of items, sudden death testing in each group and progressive group removals, and its decision criterion is based on the uniformly most powerful life test. A mixed integer programming problem is first solved for determining the minimum number of failures required and the corresponding acceptance constant. The optimal number of groups is then obtained by minimizing a balanced estimation of the expected test cost. Excellent approximately optimal solutions are also provided in closed-forms. The sampling plan is considerably flexible and allows to save experimental time and cost. In general, our methodology achieves solutions that are quite robust to small variations in the Weibull shape parameter. A numerical example about a manufacturing process of gyroscopes is included for illustration. (C) 2010 Elsevier B.V. All rights reserved.

关键词： Constrained optimization Minimal expected cost mixed integer programming Operating characteristic function Producers and consumers risks Quality control

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：