Optimal Design of a Mechanism Used for Opening and Shutting a Ship’s Hatch Cover

1984 ◽  
Vol 106 (4) ◽  
pp. 503-509
Author(s):  
Koichi Ito ◽  
Tadashi Kuroiwa ◽  
Shinsuke Akagi
Keyword(s):  
Optimal Design ◽  
Nonlinear Optimization ◽  
Optimization Problem ◽  
Numerical Study ◽  
Optimal Solution ◽  
Optimization Method ◽  
Gradient Algorithm ◽  
Linkage Mechanism ◽  
Reduced Gradient ◽  
Generalized Reduced Gradient

A nonlinear optimization method is proposed to design a linkage mechanism used for opening and shutting a ship’s hatch cover. Considering the maximum force of the oil cylinder necessary to move the hatch cover as the objective function to be minimized, the design problem to determine the optimal configuration of linkage mechanism is formulated as a nonlinear optimization problem of minimax type. It it shown that the optimal solution can be derived by adopting the generalized reduced gradient algorithm together with a linkage statical simulation model, and the effectiveness of the algorithm is ascertained through a numerical study.

Optimal Design of Semisubmersible’s Form Based on Systems Analysis

1984 ◽  
Vol 106 (4) ◽  
pp. 524-530 ◽  
Author(s):  
S. Akagi ◽  
R. Yokoyama ◽  
K. Ito
Keyword(s):  
Optimal Design ◽  
Computer Aided Design ◽  
Optimization Problem ◽  
Design Method ◽  
Gradient Algorithm ◽  
Interpretive Structural Modeling ◽  
Reduced Gradient ◽  
Optimal Design Method ◽  
Generalized Reduced Gradient ◽  
Aided Design

With the objective of developing a computer-aided design method to seek the optimal semisubmersible’s form, hierarchical relationships among many design objectives and conditions are investigated first based on the interpretive structural modeling method. Then, an optimal design method is formulated as a nonlinear multiobjective optimization problem by adopting three mutually conflicting design objectives. A set of Pareto optimal solutions is derived numerically by adopting the generalized reduced gradient algorithm, and it is ascertained that the designer can determine the optimal form more rationally by investigating the trade-off relationships among design objectives.

Nonlinear Optimization Using Generalized Hopfield Networks

1989 ◽  
Vol 1 (4) ◽  
pp. 511-521 ◽  
Author(s):  
Athanasios G. Tsirukis ◽  
Gintaras V. Reklaitis ◽  
Manoel F. Tenorio
Keyword(s):  
Nonlinear Optimization ◽  
Optimization Problem ◽  
Hopfield Network ◽  
Systems Of Nonlinear Equations ◽  
Hopfield Networks ◽  
Dynamic View ◽  
Study Results ◽  
Content Addressable Memories ◽  
Reduced Gradient ◽  
Generalized Reduced Gradient

A nonlinear neural framework, called the generalized Hopfield network (GHN), is proposed, which is able to solve in a parallel distributed manner systems of nonlinear equations. The method is applied to the general nonlinear optimization problem. We demonstrate GHNs implementing the three most important optimization algorithms, namely the augmented Lagrangian, generalized reduced gradient, and successive quadratic programming methods. The study results in a dynamic view of the optimization problem and offers a straightforward model for the parallelization of the optimization computations, thus significantly extending the practical limits of problems that can be formulated as an optimization problem and that can gain from the introduction of nonlinearities in their structure (e.g., pattern recognition, supervised learning, and design of content-addressable memories).

A New Method to Solve the Kinematic Problems of Parallel Robots Using Generalized Reduced Gradient Algorithm

2016 ◽  
Vol 28 (3) ◽  
pp. 404-417 ◽  
Author(s):  
Thanh Trung Trang ◽  
◽  
Wei Guang Li ◽  
Thanh Long Pham ◽  
Keyword(s):  
Nonlinear Optimization ◽  
Optimization Problems ◽  
Computing Time ◽  
Parallel Manipulators ◽  
Parallel Robots ◽  
New Method ◽  
Gradient Algorithm ◽  
Reduced Gradient ◽  
Generalized Reduced Gradient ◽  
Reduced Gradient Algorithm

[abstFig src='/00280003/17.jpg' width=""300"" text='Stewart Gough robot and the equivalent substitutional configuration' ] This paper proposes a new method of solving the kinematic problems for parallel robots. The paper content aims to solve nonlinear optimization problems with constraints rather than to directly solve high-order nonlinear systems of equations. The nonlinear optimization problems shall be efficiently solved by applying the Generalized Reduced Gradient algorithm and appropriate downgrade techniques. This new method can be able to find exact kinematic solutions by assigning constraints onto the parameters. The procedure can be done without filtering control results from mathematical solution, from which the control time of manipulators can be reduced. The numerical simulation results in this paper shall prove that the method can be applied to solve kinematic problems for a variety of parallel robots regardless of its structures and degree of freedom (DOF). There are several advantages of the proposed method including its simplicity leading to a shorter computing time as well as achieving high accuracy, high reliability, and quick convergence in final results. Hence, the applicability of this method in solving kinematic problems for parallel manipulators is remarkably high.

Pretension Optimization Method for Complex Cablenet System

2014 ◽  
Vol 574 ◽  
pp. 143-146
Author(s):  
Guo Qiang You ◽  
Ying Bai Xie
Keyword(s):  
Objective Function ◽  
Axial Symmetry ◽  
Mathematic Model ◽  
Optimization Method ◽  
Gradient Algorithm ◽  
Matrix Analysis ◽  
Analysis Method ◽  
Design Variables ◽  
Reduced Gradient ◽  
Generalized Reduced Gradient

Based on balance matrix analysis method and considered the evenness of pretension distribution as objective function, a pretension optimization method is proposed for complex cablenet system of large span structure. In this method, the whole cablenet system is firstly divided into several groups according to its axial symmetry to simplify its balance matrix, and then balance matrix analysis method is used to analyze balance matrix of grouped cablenet system. Next, the corresponding optimum mathematic model for grouped cablenet system can be established with pretension solutions coefficients as design variables and evenness of pretension distribution as objective function. Finally, generalized reduced gradient algorithm is used to solve the optimum mathematic model of an example, and the result is satisfactory.

Optimal Design of a Class of Welded Structures Based on Design for Latitude

1985 ◽  
Vol 107 (4) ◽  
pp. 482-487 ◽  
Author(s):  
E. Sandgren ◽  
G. Gim ◽  
K. M. Ragsdell
Keyword(s):  
Optimal Design ◽  
Objective Function ◽  
Gradient Method ◽  
Low Cost ◽  
Optimal Solution ◽  
Beam Structures ◽  
Welded Structures ◽  
Reduced Gradient Method ◽  
Reduced Gradient ◽  
Generalized Reduced Gradient

The minimization of the sensitivity of a design to variations in uncontrollable parameters is illustrated. The procedure is applied to the design of a class of welded beam structures which results in a low-cost design with minimal sensitivities. Dominant constraints are chosen which contain variations of the uncontrollable parameters. A dual objective function is formed and tradeoff curves are presented from which the optimal solution is selected. The minimization is carried out using the generalized reduced gradient method and other applications are presented.

A model for fi nding the optimal routes for a combined route container train

Innotrans ◽  
2021 ◽  
pp. 15-21
Author(s):  
Chang Hao ◽  
◽  
Daria Ivanovna Kochneva ◽  
Keyword(s):  
Software Implementation ◽  
Gradient Algorithm ◽  
Rolling Stock ◽  
Optimal Route ◽  
Delivery Time ◽  
Container Transportation ◽  
Cargo Handling ◽  
Reduced Gradient ◽  
Generalized Reduced Gradient ◽  
Train Loading

The article is devoted to the development of the model for finding an optimal route for a combined route container train (CRCT), i.e. a train with a designated route and schedule, en route from the initial to the final station without reforming of a rolling stock, but carrying out cargo handling operations for loading/unloading containers at intermediate stops of the route. It is proposed to call the optimal route of a CRCT, which provides the minimum delivery time while ensuring the targeted train loading on each section and with a set value of demand for container transportation at each point of the route. A software implementation of the model in the MS Excel environment is proposed using the built-in generalized reduced gradient algorithm.

Sign in / Sign up

Export Citation Format

Share Document