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

Permutation flowshops with transportation times: mathematical models and solution methods

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY 2010年第5-8期46卷 631-647页

作者： Naderi, B. Javid, A. Ahmadi Jolai, F. Amir Kabir Univ Technol Dept Ind Engn Tehran Iran Univ Tehran Fac Engn Dept Ind Engn Tehran Iran

This paper deals with permutation flowshops with considering transportation times of carrying semi-finished jobs from a machine to another one. The transportation between machines can be done using two types of transportation systems: multi-transporter and single-transporter systems. We formulate the problem with both systems as six different mixed integer linear programs. We also provide solution methods including heuristics and metaheuristics in order to solve large-sized problems. The heuristics are the adaptations of well-known heuristics and the proposed metaheuristics are based on artificial immune systems incorporating an effective local search heuristic and simulated annealing. A comprehensive experiment is conducted to compare and evaluate the performance of the models as well as the algorithms. All the results show the effectiveness of the proposed models and algorithms.

关键词： Scheduling Permutation flowshop Transportation time Mathematical model mixed integer linear programming Heuristic Artificial immune algorithm

来源：评论

学校读者我要写书评

暂无评论

Optimal Power Flow Computations With a Limited Number of Controls Allowed to Move

引用

IEEE TRANSACTIONS ON POWER SYSTEMS 2010年第1期25卷 586-587页

作者： Capitanescu, Florin Wehenkel, Louis Univ Liege Dept Elect Engn & Comp Sci B-4000 Liege Belgium

This letter focuses on optimal power flow (OPF) computations in which no more than a pre-specified number of controls are allowed to move. To determine an efficient subset of controls satisfying this constraint, we rely on the solution of a mixed integer linear programming (MILP) problem fed with sensitivity information of controls' impact on the objective and constraints. We illustrate this approach on a 60-bus system and for the OPF problem of minimum load curtailment cost to remove thermal congestion.

关键词： mixed integer linear programming nonlinear programming optimal power flow

来源：评论

学校读者我要写书评

暂无评论

Genome-scale metabolic reconstruction and in silico analysis of methylotrophic yeast Pichia pastoris for strain improvement

引用

MICROBIAL CELL FACTORIES 2010年第1期9卷 1-15页

作者： Chung, Bevan K. S. Selvarasu, Suresh Andrea, Camattari Ryu, Jimyoung Lee, Hyeokweon Ahn, Jungoh Lee, Hongweon Lee, Dong-Yup Natl Univ Singapore NUS Grad Sch Integrat Sci & Engn Singapore 117456 Singapore ASTAR Bioproc Technol Inst Centros 138668 Singapore KRIBB Biotechnol Proc Engn Ctr Taejon 305806 South Korea Natl Univ Singapore Dept Chem & Biomol Engn Singapore 117576 Singapore

Background: Pichia pastoris has been recognized as an effective host for recombinant protein production. A number of studies have been reported for improving this expression system. However, its physiology and cellular metabolism still remained largely uncharacterized. Thus, it is highly desirable to establish a systems biotechnological framework, in which a comprehensive in silico model of P. pastoris can be employed together with high throughput experimental data analysis, for better understanding of the methylotrophic yeast's metabolism. Results: A fully compartmentalized metabolic model of P. pastoris (iPP668), composed of 1,361 reactions and 1,177 metabolites, was reconstructed based on its genome annotation and biochemical information. The constraints-based flux analysis was then used to predict achievable growth rate which is consistent with the cellular phenotype of P. pastoris observed during chemostat experiments. Subsequent in silico analysis further explored the effect of various carbon sources on cell growth, revealing sorbitol as a promising candidate for culturing recombinant P. pastoris strains producing heterologous proteins. Interestingly, methanol consumption yields a high regeneration rate of reducing equivalents which is substantial for the synthesis of valuable pharmaceutical precursors. Hence, as a case study, we examined the applicability of P. pastoris system to whole-cell biotransformation and also identified relevant metabolic engineering targets that have been experimentally verified. Conclusion: The genome-scale metabolic model characterizes the cellular physiology of P. pastoris, thus allowing us to gain valuable insights into the metabolism of methylotrophic yeast and devise possible strategies for strain improvement through in silico simulations. This computational approach, combined with synthetic biology techniques, potentially forms a basis for rational analysis and design of P. pastoris metabolic network to enhance humanized glyco

关键词： mixed integer linear programming Acetoin Recombinant Protein Production Chemostat Culture Methylotrophic Yeast

来源：评论

学校读者我要写书评

暂无评论

A new mixed integer linear model for a rich vehicle routing problem with docking constraints

引用

ANNALS OF OPERATIONS RESEARCH 2010年第1期181卷 337-358页

作者： Rieck, Julia Zimmermann, Juergen Tech Univ Clausthal Dept Operat Res D-38678 Clausthal Zellerfeld Germany

In this paper we address a rich vehicle routing problem that arises in real-life applications. Among other aspects we consider time windows, simultaneous delivery and pick-up at customer locations and multiple use of vehicles. To guarantee a coordinated material flow at the depot, we include the timed allocation of vehicles to loading bays at which the loading and unloading activities can occur. The resulting vehicle routing problem is formulated as a two-index vehicle-flow model which integrates the routing under real-life conditions and the assignment of vehicles to loading bays at the depot. We use CPLEX 11.0 to solve medium-sized instances that are derived from the extended Solomon test set. The selective implementation of preprocessing techniques and cutting planes improves the solver performance significantly.

关键词： Vehicle routing Simultaneous delivery and pick-up Docking constraints mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Computing sparse and dense realizations of reaction kinetic systems

引用

JOURNAL OF MATHEMATICAL CHEMISTRY 2010年第2期47卷 551-568页

作者： Szederkenyi, Gabor Hungarian Acad Sci Comp & Automat Res Inst Syst & Control Lab Proc Control Res Grp H-1518 Budapest Hungary

A numerical procedure for finding the sparsest and densest realization of a given reaction network is proposed in this paper. The problem is formulated and solved in the framework of mixed integer linear programming (MILP) where the continuous optimization variables are the nonnegative reaction rate coefficients, and the corresponding integer variables ensure the finding of the realization with the minimal or maximal number of reactions. The mass-action kinetics is expressed in the form of linear constraints adjoining the optimization problem. More complex realization problems can also be solved using the proposed framework by modifying the objective function and/or the constraints appropriately.

关键词： Reaction kinetic systems Mass action kinetics mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Operating room planning and scheduling: solving a surgical case sequencing problem

引用

4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH 2010年第1期8卷 101-104页

作者： Cardoen, Brecht Vlerick Leuven Gent Management Sch Operat & Technol Management Ctr B-9000 Ghent Belgium Katholieke Univ Leuven Dept Decis Sci & Informat Management Fac Business & Econ B-3000 Louvain Belgium

This text summarizes the PhD dissertation that was defended by the author in January 2009 under the supervision of Erik Demeulemeester at the Katholieke Universiteit Leuven (Belgium). The text is written in English and is available from the author upon request. The PhD dissertation is situated within the health care services domain and studies the impact of planning and scheduling procedures in the operating room. It incorporates an extensive review of both scientific contributions and the current operating room planning and scheduling practices of hospitals in Flanders (Belgium). The emphasis of the research, though, is directed towards the development, the testing and the application of surgery sequencing algorithms in a day-care environment.

关键词： Operating room planning and scheduling Combinatorial optimization mixed integer linear programming Case study Decision support system

来源：评论

学校读者我要写书评

暂无评论

Optimization of Back Pressure and Throughput for Latency Insensitive Systems

Optimization of Back Pressure and Throughput for Latency Ins...

引用

IEEE International Conference on Computer Design

作者： Xue, Bin Shukla, Sandeep K. Virginia Tech FERMAT Lab Blacksburg VA 24060 USA

ISBN: (纸本)9781424489350

Latency insensitive protocols (LIP) were originally based on valid/stall handshakes between components and relays stations. However, for designs whose connection graph is a single strongly connected component(SCC), it was shown that static scheduling of computation achieves better throughput. Unfortunately, for a system composed of multiple SCCs such global static scheduling is not possible. Recent work has shown how to minimize back pressure (stall) based flow control for such systems. However, that solution does not necessarily achieve optimal throughput because it only minimizes back-pressure without attempting to optimize throughput. Throughput optimizing solutions for latency insensitive systems also exists, which require a mixed integer linear programming (MILP) solution that inevitably does not scale for large systems. Moreover, that throughput optimizing solution uses back pressure for every connection leading to area overhead and further interconnect routing issues. In this paper, we consider an optimization technique for the synthesis of latency insensitive systems. In particular, we consider a synchronous hardware system which is composed of multiple SCCs. We provide algorithm for synthesizing a latency insensitive implementation which minimizes back-pressure while maximizing throughput. Our approach scales because we formulate MILP whose size is significantly smaller than that of the previous throughput optimizing MILP formulation. To the best of our knowledge, this is the first optimization technique considering both back pressure and throughput of latency insensitive system in the literature.

关键词： IP module IP networks LIP MILP solution SCC back pressure based flow control back pressure optimization computation static scheduling integer programming latency insensitive protocols latency insensitive systems linear programming mixed integer linear programming optimal throughput pressure measurement relay stations strongly connected component synchronous hardware system throughput optimizing solutions

来源：评论

学校读者我要写书评

暂无评论

Exact and Performance-Guaranteed Multicast Algorithms for Lifetime Optimization in WANETs

Exact and Performance-Guaranteed Multicast Algorithms for Li...

引用

International Network Optimization Conference

作者： Guo, Song Leung, Victor Univ Aizu Sch Engn & Comp Sci Aizu Wakamatsu Fukushima Japan Univ British Columbia Dept Elect & Comp Engn Vancouver BC V5Z 1M9 Canada

We consider the problem of maximizing the lifetime of a given multicast connection in wireless networks that use directional antennas and have limited energy resources. We provide a globally optimal solution to this problem by developing a general MILP formulation that can apply to many directional antenna models, some of which are not supported by the existing formulations. We also investigate the theoretical performance of a well-known heuristic algorithm for this optimization problem in terms of its approximation ratio. We use a graph theoretic approach, for the first time, to derive an upper bound on its approximation ratio in an analytical expression and discover that it is a constant-factor approximation algorithm. (C) 2009 Wiley Periodicals, Inc. NETWORKS, Vol. 55(3), 287-297 2010

关键词： wireless ad hoc networks lifetime multicast maximization mixed integer linear programming directional antenna

来源：评论

学校读者我要写书评

暂无评论

A Tool for Analyzing and Fixing Infeasible RCTA Instances

A Tool for Analyzing and Fixing Infeasible RCTA Instances

引用

Conference on Privacy in Statistical Databases 2010

作者： Castro, Jordi Gonzalez, Jose A. Univ Politecn Cataluna Dept Stat & Operat Res ES-08034 Barcelona Catalonia Spain

ISBN: (纸本)9783642158377

Minimum-distance controlled tabular adjustment methods (CTA), and its restricted variants (RCTA), is a recent perturbative approach for tabular data protection. Given a table to be protected, the purpose of RCTA is to find the closest table that guarantees protection levels for the sensitive cells. This is achieved by adding slight adjustments to the remaining cells, possibly excluding a subset of them (usually, the total cells) which preserve their original values. If either protection levels are large, or the bounds for cell deviations are tight, or too many cell values have to be preserved, the resulting mixed integer linear problem may be reported as infeasible. This work describes a tool developed for analyzing infeasible instances. The tool is based on a general elastic programming approach, which considers an artificial problem obtained by relaxing constraints and bounds through the addition of extra elastic variables. The tool allows selecting the subset of constraints and bounds to be relaxed, such that an elastic filter method can be applied for isolating a subset of infeasible table relations, protection levels, and cell bounds. Some computational experiments are reported using real-world instances.

关键词： statistical disclosure control controlled tabular adjustment mixed integer linear programming infeasibility in optimization elastic constraints elastic filter

来源：评论

学校读者我要写书评

暂无评论

Survivable Virtual Infrastructure Mapping in a Federated Computing and Networking System under Single Regional Failures

Survivable Virtual Infrastructure Mapping in a Federated Com...

引用

IEEE Global Telecommunications Conference (GLOBECOM 2010)

作者： Yu, Hongfang Qiao, Chunming Anand, Vishal Liu, Xin Di, Hao Sun, Gang Univ Elect Sci & Technol China Sch Commun & Informat Engn Chengdu Peoples R China SUNY Buffalo Dept Comp Sci & Engn Buffalo NY USA SUNY Coll Brockport Dept Comp Sci Brockport NY USA Brookhaven Natl Lab Upton NY USA

ISBN: (纸本)9781424456383

As virtualization becomes more and more popular, how to guarantee survivability of a virtual infrastructure (VI) over a wide-area optical network is increasingly important. In this paper, we approach the problem of survivable VI mapping (SVIM) from a few unique perspectives. One of the most distinguishing perspectives is that a large-scale regional failure could destroy one or more facility nodes to which some VI nodes are mapped. Accordingly, redundant facility nodes at different geographical locations and redundant optical connections have to be provisioned such that the VI can still be mapped after the failure. Another distinguishing perspective is that with failure-dependent protection, the SVIM problem can be decomposed into several instances of the basic non-survivable VI mapping (NSVIM) problem, whose solution permits effective sharing of the redundant resources among all failures. In this paper, we first formulate the minimum-cost SVIM problem using mixed integer linear programming (MILP). We then propose an efficient heuristic solution to NSVIM, based on which two novel heuristic SVIM algorithms called Separate Optimization with Unconstrained Mapping (SOUM) and Incremental Optimization with Constrained Mapping (IOCM). Simulations are performed to study and compare the performance of the MILP and heuristics.

关键词： SVIM distributed processing fault tolerance federated computing incremental optimization with constrained mapping integer programming linear programming mixed integer linear programming networking system redundant facility nodes separate optimization with

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：