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

International Conference on Information Engineering for Mechanics and Materials (ICIMM 2011)

作者： He, Junliang Mi, Weijian Chang, Daofang Bian, Zhicheng Shanghai Maritime Univ Logist Engn Sch Shanghai 201306 Peoples R China

ISBN: (纸本)9783037852125

In this paper, a dynamic yard allocation strategy of export containers is proposed based on a hybrid stack mode. Firstly, a 0-1 programming model is developed for the problem. Accordingly, the model's objective function is subject to the minimization of the total re-shuffle containers which are buried beneath other containers but heavier. To resolve the NP-hard problem regarding the dynamic yard allocation model, a hybrid algorithm, which applies heuristic rules and genetic algorithm, is then employed. Subsequently, a case study is used for system illustration. Consequently, it could be found from computational results that this approach paves a venue for resolving the dynamic yard allocation problem of export containers.

关键词： container terminal hybrid stack mode dynamic yard allocation 0-1 programming heuristic algorithm genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

On the Maximization of a Pseudo-Boolean Function

引用

Journal of the ACM (JACM) 1972年第2期19卷 265-282页

作者： Hammer, Peter L. Peled, Uri N. University of Montreal Montreal Canada Israel Defense Forces Doar Zvai 2770 Israel Faculty of Industrial and Management Engineering Technion-Israel Insitutue of Technology Haifa Israel

A branch-and-bound method is proposed for the maximization of real valued functions with variables assuming only the values 0 and 1. The importance of the problem consists-as has been shown by Hammer and Rudeanu-in the fact that numerous problems in operations research, graph theory, combinatorial mathematics, etc., can be brought to this form. The method has been successfully tested on an IBM 360/50 computer. © 1972, ACM. All rights reserved.

关键词： 0-1 programming Boolean equations branch-and-bound computational results implicit enumeration integer nonlinear programming pseudo-Boolean functions

来源：评论

学校读者我要写书评

暂无评论

Two-stage Optimization of Load Restoration Considering Integration of Wind Power 13

Two-stage Optimization of Load Restoration Considering Integ...

引用

13th IEEE Conference on Industrial Electronics and Applications (ICIEA)

作者： Qiu, Chenguang Cheng, Jinmin Liu, Zhihang Gao, Yunbo Zang, Haixiang State Grid Jiangsu Elect Power Co Ltd Dispatching & Control Ctr Nanjing 210024 Jiangsu Peoples R China Hohai Univ Coll Energy & Elect Engn Nanjing 211100 Jiangsu Peoples R China

ISBN: (纸本)9781538637586

Large scale wind power integration will bring a certain impact on the orderly recovery of power grid and adopting an appropriate recovery strategy could be contributed to restore power supply safely and quickly. Load restoration is a complex multi-time-step mixed-integer nonlinear optimization (MINLP) problem, so it's usually difficult to solve directly. In order to reduce the difficulty of solving problem, a two-stage optimization model of load restoration considering integration of wind power is proposed. The load restoration problem is decoupled in stages, a 0-1 programming of load restoration is established with weighted wind power and maximum load restoration as the goal to obtain wind power and load input schemes. Based on this, we construct a nonlinear programming model based on AC power flow and use primal-dual interior point method (PDIPM) to obtain the optimal outputs of unit and the shortest recovery time, to a certain extent, the cross boundary of the system will be eliminated at the same time. Validity of the model is verified with simulation of modified IEEE 30-bus system and the model proposed in this paper can obtain an effective restoration scheme and reduce the difficulty of direct solution. Moreover, the impact of load restoration considering integration of wind power is analyzed in detail.

关键词： load restoration wind farm two-stage optimization 0-1 programming optimal power flow primal-dual interior point method

来源：评论

学校读者我要写书评

暂无评论

Developing and Promoting OKP Production System: A JIT Production Planning Approach

Developing and Promoting OKP Production System: A JIT Produc...

引用

International Conference on Graphic and Image Processing (ICGIP)

作者： Samavati, Mehran Tabriz Univ Fac Mech Dept Ind Engn Tabriz Iran

ISBN: (纸本)9780819489326

The role of production in competitive system of market on one hand and the changing conditions of market on the other hand has caused the need for more developed planning in such environments. The general purpose of the present research is to realize One-of-a Kind- Product model (OKP) that is developed in two stages. In OKP model presented in 1994(1) only one sample of each product is produuced and only one production more production methods, thhe following developments were made in this research: 1-First Development: Considering various methods for producing each product. 2-Second Development: Producing more than one sample of each product, while considering various production methods for each product. These models promoted OKP model of 1994. They can be used in more diversified production methods in order to promote them. In present model, while describing the main OKP model new models are provided as well. The significance of OKP has been described in Introduction.

关键词： One-of-a-kind-product (OKP) Just-in-time (JIT) 0-1 programming Earliness/tardiness production planning Linear programming

来源：评论

学校读者我要写书评

暂无评论

Sherali-Adams Relaxations of the Matching Polytope

Sherali-Adams Relaxations of the Matching Polytope

引用

41st Annual ACM Symposium on Theory of Computing

作者： Mathieu, Claire Sinclair, Alistair Brown Univ Dept Comp Sci Providence RI 02912 USA

ISBN: (纸本)9781605586137

We study the Sherali-Adams lift-and-project hierarchy of linear programming relaxations of the matching polytope. Our main result is an asymptotically tight expression 1 + 1/k for the integrality gap after k rounds., of this hierarchy. The result is derived by a detailed analysis of the LP after k round applied to the complete graph K2d+1. We give an explicit recurrence for the value of this LP, and hence show that it's gap exhibits a "phase transition," dropping front close to its maximum value 1 + 1/2d to close to 1 around the threshold k = 2d - Theta(root d). we also show that the rank of the matching polytope (i.e., the number of Sherali-Adams rounds until the integer polytope is reached) is exactly 2d - 1.

关键词： 0-1 programming linear programming relaxation integrality gap lift-and-project matching polytope maximum matching

来源：评论

学校读者我要写书评

暂无评论

Design of Service Network of Huachuan Denso Co.

Design of Service Network of Huachuan Denso Co.

引用

2nd International Conference on Engineering Design and Optimization (ICEDO 2011)

作者： Li, Qingsong Qin, Lizhi Yang, Wei Wang, Yonghui Xihua Univ Sch Transportat & Automot Engn Chengdu 610039 Sichuan Provinc Peoples R China

ISBN: (纸本)9783037852590

Location decision of Service Networks is important for an enterprise to dominate market and to improve service level. Characteristics and the decentralized control strategies of service network were discussed for the enterprise of Denso class. A 0-1 mixed integer programming model was established for location problem of spare parts centers and solved by ILOG along with sensitivity analysis. Furthermore, a dynamic programming model was established for location problem of sales model shop and calculated by a numerical listing method.

关键词： Service Network Location Problem 0-1 programming dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Modeling the Geometry of the Endoplasmic Reticulum Network

Modeling the Geometry of the Endoplasmic Reticulum Network

引用

1st International Conference on Algorithms for Computational Biology (AlCoB)

作者： Lemarchand, Laurent Euler, Reinhardt Lin, Congping Sparkes, Imogen Univ Europeenne Bretagne UBO Lab STICC UMR 6285 Brest France Univ Exeter Math Exeter EX4 4QJ Devon England Univ Exeter Biosci Exeter EX4 4QJ Devon England

ISBN: (纸本)9783319079530;9783319079523

We have studied the network geometry of the endoplasmic reticulum by means of graph theoretical and integer programming models. The purpose is to represent this structure as close as possible by a class of finite, undirected and connected graphs the nodes of which have to be either of degree three or at most of degree three. We determine plane graphs of minimal total edge length satisfying degree and angle constraints, and we show that the optimal graphs are close to the ER network geometry. Basically, two procedures are formulated to solve the optimization problem: a binary linear program, that iteratively constructs an optimal solution, and a linear program, that iteratively exploits additional cutting planes from different families to accelerate the solution process. All formulations have been implemented and tested on a series of real-life and randomly generated cases. The cutting plane approach turns out to be particularly efficient for the real-life testcases, since it outperforms the pure integer programming approach by a factor of at least 10.

关键词： endoplasmic reticulum plane graph 0-1 programming separation procedure

来源：评论

学校读者我要写书评

暂无评论

The Collapsing 0-1 Knapsack Problem

引用

Mathematical programming 1978年第1期15卷 155-161页

作者： Posner, Marc E. Guignard, Monique RCA/David Sarnoff Research Center Princeton NJ United States University of Pennsylvania Philadelphia PA United States

The "Collapsing 0-1 Knapsack Problem" is a type of non-linear knapsack problem in which the knapsack size is a non-increasing function of the number of items included. An algorithm is developed and computati... 详细信息

关键词： 0-1 programming Nonlinear Knapsack

来源：评论

学校读者我要写书评

暂无评论

THERMOSTATISTICAL PERSISTENCY - A POWERFUL IMPROVING CONCEPT FOR SIMULATED ANNEALING ALGORITHMS

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 1995年第3期86卷 565-579页

作者： CHARDAIRE, P LUTTON, JL SUTTER, A FRANCE TELECOM CTR NATL ETUD TELECOMMUNDEPT PAA ATR ORIF-92131 ISSY MOULINEAUXFRANCE

We propose a new heuristic method to solve 0-1 optimisation problems. Basically, the method is an extension of the simulated annealing algorithm. At a given temperature, approximations of the variable value expectations are computed. This information allows to fix the variables as the temperature decreases, so that the size of the problem is progressively reduced. It follows a significant improvement compared with pure simulated annealing: we obtain better solutions in less CPU time. Variable value expectations can be estimated by simulation procedures. In the special case of unconstrained 0-1 optimisation problems, estimates can be obtained by solving an analytic system. Two problems are examined: the travelling salesman problem and the minimisation of an unconstrained 0-1 quadratic function.

关键词： OPTIMIZATION 0-1 programming SIMULATED ANNEALING QUADRATIC programming TRAVELING SALESMAN

来源：评论

学校读者我要写书评

暂无评论

A Two-Phase New Product Introduction Model

A Two-Phase New Product Introduction Model

引用

7th International Conference on e-Engineering and Digital Enterprise Technology

作者： Xu, Hongxue Wan, Fucai Guo, Xiuying Liu, Yongxian Shenyang Univ Sch Informat Engn Shenyang 110044 Liaoning Peoples R China North Eastern Univ Sch Mech Engn & Automat Shenyang 110044 Liaoning Peoples R China

ISBN: (纸本)9780878492992

A new approach that combines neural network and 0-1 programming was proposed. Based on the lifecycle analysis, the characteristics of new products can be divided into four categories with different benefit curves and parameters. A neural network is used to classify the new product and the 0-1 programming model is then developed and used to determine what products to be introduced into marketplace. Numerical example is given finally to show that this model is effective for firms.

关键词： Optimization Neural network New product introduction 0-1 programming Profit curves Product life cycle

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：