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

Application of nonlinear integer programming for vibration reduction optimum design of ship structure

JOURNAL OF MECHANICAL SCIENCE AND TECHNOLOGY 2009年第8期23卷 2085-2096页

作者： Kong, Yong-Mo Choi, Su-Hyun Song, Jin-Dae Yang, Bo-Suk Choi, ByeongKeun Pukyong Natl Univ Sch Mech Engn Pusan 608739 South Korea Daewoo Shipbldg & Marine Engn Ltd Res Ctr Geoje 656714 Gyeongnam South Korea Gyeongsang Natl Univ Dept Precis Mech Engn Inst Marine Sci Tongyoung 650160 Gyeongnam South Korea

This paper presents a hybrid optimization algorithm which combines an external call type optimization method and a general stochastic iterative algorithm for the nonlinear integer programming with genetic algorithm (GA). GA can rapidly search the approximate global optimum under a complicated design environment such as a ship structure. Meanwhile it can handle optimization problems involving discrete design variables. In addition, there are many parameters that have to be set for GA which greatly affect the accuracy and calculation time of the optimum solution. However, the setting process is difficult for users, and there are no rules to decide these parameters. Therefore, to overcome these difficulties, the optimization of these parameters has been also conducted by using GA itself. It is proven using the trial function that the parameters are optimal. Finally, the verification of validity and usefulness of nonlinear integer programming is performed by applying this method to the compass deck of a ship where the vibration problem is frequently occurs.

关键词： Combinatorial optimization Genetic algorithm nonlinear integer programming OPTSHIP Ship structure Vibration reduction

来源：评论

学校读者我要写书评

暂无评论

AN APPROXIMATE ALGORITHM FOR nonlinear integer programming

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 1994年第1期74卷 170-178页

作者： VASSILEV, V GENOVA, K INST INFORMAT ACAD G BONCHEV STRBL 29ABU-1113 SOFIABULGARIA

This paper suggests an approximate algorithm, designed to solve nonlinear integer problems. This algorithm belongs to the class of component algorithms of feasible integer directions. The search for a feasible integer direction is done on the basis of a linear approximation of the objective function and the constraints at the integer points under consideration. Theoretical analysis is presented, as well as experimental investigation, using the algorithm for test examples taken from the literature.

关键词： OPTIMIZATION nonlinear integer programming APPROXIMATE ALGORITHM HEURISTICS COMPUTATIONAL ANALYSIS

来源：评论

学校读者我要写书评

暂无评论

A NEW BRANCHING RULE FOR THE BRANCH AND BOUND ALGORITHM FOR SOLVING nonlinear integer programming-PROBLEMS

引用

BIT 1988年第3期28卷 701-708页

作者： KORNER, F 1.Stolpener Str. 9 8512 Gro?r?hrsdorf GDR

We examine a branch and bound algorithm for solving nonlinear (convex) integer programming problems. In this note we generalize previous results for the quadratic case. The variables are branched in such a way that th... 详细信息

关键词： primary: 90C09 secondary: 65K 10 nonlinear integer programming real imbedding branch and bound

来源：评论

学校读者我要写书评

暂无评论

PARAMETRIC nonlinear integer programming - THE RIGHT-HAND SIDE CASE

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 1991年第2期54卷 237-255页

作者： CHERN, MS JAN, RH CHERN, RJ NATL CHIAO TUNG UNIV DEPT COMP & INFORMAT SCIHSINCHUTAIWAN

In this paper, we present algorithms for solving families of nonlinear integer programming problems in which the problems are related by having identical objective coefficients and constraint matrix coefficients. We consider two types of right-hand sides which have the forms b(l) and b(i) + theta-i(d)i where {b(l)}l = 1,...,L is a given set of vectors, b(i) + theta-i(d)i is a parametric function and the parameter theta-i varies from zero to one. The approach consists primarily of solving the most relaxed problem using branch and search method and then finding the optimal solutions of the proposed parametric programming problems. The application of this methodology to a parametric chance-constrained problem is illustrated with applications in system reliability optimization problems.

关键词： PARAMETRIC programming nonlinear integer programming RELIABILITY OPTIMIZATIONS

来源：评论

学校读者我要写书评

暂无评论

An approximate algorithm for nonlinear integer programming

引用

APPLIED MATHEMATICS AND COMPUTATION 1998年第2-3期93卷 183-193页

作者： Zhu, WX Fuzhou Univ Dept Comp Sci Fuzhou 350002 Peoples R China

This paper presents an approximate algorithm, which is modified from the Filled Function method for continuous global optimization, to solve nonlinear integer programming problems. Unlike the other approximate methods, the algorithm tries to improve a discrete local minimal solution by minimizing a filled function. It is a direct method. Numerical experiments show that this algorithm is efficient. (C) 1998 Elsevier Science Inc. All rights reserved.

关键词： nonlinear integer programming filled function method discrete local minimal solution

来源：评论

学校读者我要写书评

暂无评论

An efficient algorithm for nonlinear integer programming problems arising in series-parallel reliability systems

引用

OPTIMIZATION METHODS & SOFTWARE 2006年第4期21卷 617-633页

作者： Sun, XL Ruan, N Li, D Shanghai Univ Dept Math Shanghai 200444 Peoples R China Chinese Univ Hong Kong Dept Syst Engn & Engn Management Shatin Hong Kong Peoples R China

We consider two related nonlinear integer programming problems arising in series-parallel reliability systems: the constrained redundancy problem and the cost minimization problem. We propose in this paper an efficient method for solving these two types of nonlinear integer programming problems. The proposed convergent Lagrangian method combines Lagrangian relaxation with a duality reduction technique. An outer approximation method is used to search for the optimal dual solution and to generate Lagrangian bounds of the primal problem. To reduce the duality gap, we derive a special partition scheme by exploiting the inherent monotonicity and separability of the problem. Furthermore, a special optimality criterion is adopted to improve feasible solutions and to fathom integer subboxes. Computational results show that the algorithm is capable of solving large-scale optimization problems in series-parallel reliability systems. Comparison numerical results with other existing methods are also reported.

关键词： nonlinear integer programming reliability optimization Lagrangian relaxation and dual search duality gap elimination partition scheme

来源：评论

学校读者我要写书评

暂无评论

An efficient algorithm for nonlinear integer programming problems arising in series-parallel reliability systems

An efficient algorithm for nonlinear integer programming pro...

引用

6th International Conference on Optimization Technques and Applications (ICOTA)

作者： Sun, XL Ruan, N Li, D Shanghai Univ Dept Math Shanghai 200444 Peoples R China Chinese Univ Hong Kong Dept Syst Engn & Engn Management Shatin Hong Kong Peoples R China

关键词： nonlinear integer programming reliability optimization Lagrangian relaxation and dual search duality gap elimination partition scheme

来源：评论

学校读者我要写书评

暂无评论

A direct search approach to nonlinear integer programming

引用

Optimization Methods and Software 1994年第3期4卷 171-189页

作者： Murtagh, Bruce A. Sugden, Stephen J. Graduate School of Management Macquarie University Sydney Australia School of Information Technology Bond University Gold Coast Australia

An approach lo the solution of large-scale nonlinear programming problems with integer restrictions on some of the variables is described. The method is based on the MINOS large-scale optimization algorithm and involves adjustment of the superbasic variables in integer steps. The direct-search procedure commences from a continuous (relaxed) optimal solution and seeks the nearest integer-feasible solution in terms of objective function value. Computational experience on a wide variety of nonlinear problems is reported. © 1994, Taylor & Francis Group, LLC. All rights reserved.

关键词： Direct search Large-scale optimization nonlinear integer programming Optimization software

来源：评论

学校读者我要写书评

暂无评论

Modified Filled Function Method for Resolving nonlinear integer programming Problem 4th

Modified Filled Function Method for Resolving Nonlinear Inte...

引用

4th International Conference on Intelligent Computing

作者： Liu, Yong Shang, You-lin Henan Univ Sci & Technol Dept Comp Sci Luoyang 471003 Peoples R China Henan Univ Sci & Technol Dept Math Luoyang 471003 Peoples R China

ISBN: (纸本)9783540859291

Filled function method is an approach to find the global minimum of nonlinear functions. Many Problems, such as computing, communication control, and management, in real applications naturally result in global optimization formulations in a form of nonlinear global integer programming. This paper gives a modified filled function method to solve the nonlinear global integer programming problem. The properties of the proposed modified filled function are also discussed in this paper. The results of preliminary numerical experiments are also reported.

关键词： Filled function global optimization local minimizer communication control nonlinear integer programming

来源：评论

学校读者我要写书评

暂无评论

A nonlinear integer programming model for expanding the transportation system of an underdeveloped country or region.

A nonlinear integer programming model for expanding the tran...

引用

作者： Martin, Bernard Michael Naval Postgraduate School

学位级别：硕士

A nonlinear integer programming model for expanding the trans- portation system of an underdeveloped country is presented. The model uses integer 0-1 decision variables. The basic model has linear con- straints and a nonlinear objective function. Seme special situations and extensions to the model are presented. The benefits being maximized in the objective function are discussed, as are the problems of param- eterization and suboptimization. A solution procedure for the model is suggested, but an efficient algorithm is not available for solving the model. Seme areas for future research are also suggested.

关键词： Benefit Analysis Development Program integer 0-1 Decision Variables nonlinear integer programming Resource Allocation Suboptimization Transportation Network Transportation System Underdeveloped Country

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：