A systematic search method for obtaining multiple local optimal solutions of nonlinear programming problems

1996 ◽  
Vol 43 (2) ◽  
pp. 99-109 ◽  
Author(s):  
Hsiao-Dong Chiang ◽  
Chia-Chi Chu
Keyword(s):  
Nonlinear Programming ◽  
Search Method ◽  
Systematic Search ◽  
Optimal Solutions

Iterative Fixture Layout and Clamping Force Optimization Using the Genetic Algorithm

2001 ◽  
Vol 124 (1) ◽  
pp. 119-125 ◽  
Author(s):  
Krishnakumar Kulankara ◽  
Srinath Satyanarayana ◽  
Shreyes N. Melkote
Keyword(s):  
Genetic Algorithm ◽  
Nonlinear Programming ◽  
Primary Objective ◽  
Fixture Design ◽  
Clamping Force ◽  
Optimal Solutions ◽  
Fixture Layout ◽  
Force Optimization ◽  
Nonlinear Programming Methods ◽  
Objective Being

Fixture design is a critical step in machining. An important aspect of fixture design is the optimization of the fixture, the primary objective being the minimization of workpiece deflection by suitably varying the layout of fixture elements and the clamping forces. Previous methods for fixture design optimization have treated fixture layout and clamping force optimization independently and/or used nonlinear programming methods that yield sub-optimal solutions. This paper deals with application of the genetic algorithm (GA) for fixture layout and clamping force optimization for a compliant workpiece. An iterative algorithm that minimizes the workpiece elastic deformation for the entire cutting process by alternatively varying the fixture layout and clamping force is proposed. It is shown via an example of milling fixture design that this algorithm yields a design that is superior to the result obtained from either fixture layout or clamping force optimization alone.

scholarly journals Formulation Pre-screening of Inhalation Powders Using Computational Atom–Atom Systematic Search Method

2014 ◽  
Vol 12 (1) ◽  
pp. 18-33 ◽  
Author(s):  
Vasuki Ramachandran ◽  
Darragh Murnane ◽  
Robert B. Hammond ◽  
Jonathan Pickering ◽  
Kevin J. Roberts ◽  
...  
Keyword(s):  
Search Method ◽  
Systematic Search ◽  
Inhalation Powders

An improved formulation for optimizing rocker-bogie suspension rover for climbing steps

2019 ◽  
Vol 233 (18) ◽  
pp. 6538-6558 ◽  
Author(s):  
Sam Noble ◽  
K Kurien Issac
Keyword(s):  
Nonlinear Programming ◽  
Optimal Design ◽  
Local Minimum ◽  
Single Step ◽  
Optimal Solutions ◽  
Performance Parameters ◽  
Smooth Functions ◽  
Gradient Based ◽  
Wheel Radius ◽  
Better Than

We address the problem of improving mobility of rovers with rocker-bogie suspension. Friction and torque requirements for climbing a single step were considered as performance parameters. The main contribution of the paper is an improved formulation for rover optimization using smooth functions, which enables use of powerful gradient based nonlinear programming (NLP) solvers for finding solutions. Our formulation does not have certain shortcomings present in some earlier formulations. We first formulate the problem of determining optimal torques to be applied to the wheels to minimize (a) friction requirement, and (b) torque requirement, and obtain demonstrably optimal solutions. We then formulate the problem of optimal design of the rover itself. Our solution for climbing a step of height two times the wheel radius is 13% better than that of the nominal rover. This solution is verified to be a local minimum by checking Karush–Kuhn–Tucker conditions. Optimal solutions were obtained for both forward and backward climbing. We show that some earlier formulations cannot obtain optimal solutions in certain situations. We also obtained optimal design for climbing steps of three different heights, with a friction requirement which is 15% lower than that of the nominal rover.

Designing a geodetic network through the search method based on the use of an undistorted model

2021 ◽  
Vol 966 (12) ◽  
pp. 2-10
Author(s):  
M.J. Bryn ◽  
G.G. Shevshenko
Keyword(s):  
Nonlinear Programming ◽  
Parametric Method ◽  
Geodetic Network ◽  
Visual Basic ◽  
Search Method ◽  
General Idea ◽  
Design Algorithm ◽  
Triangulation Network ◽  
The One ◽  
Network Project

General idea of the search method is provided. An information flowchart explaining themethod is presented. Formulas for evaluating the project of a geodetic network using the search method based on the undistorted model are given. The sequence of the mentioned design algorithm based on the undistorted model is developed. A computer program for evaluating the project in Visual Basic was compiled. The design and evaluation of the project of two networks, a triangulation geodetic and the one built according to the free stationing scheme was made. Both networks were constructed using the search method of nonlinear programming based on the undistorted model. The results of the evaluation of the triangulation network project coincided with those performed by the classical parametric method, which confirmed the correctness of the proposed algorithm for designing a geodetic network using the search method. The full weight matrix of coordinates of the defined points was obtained, and the average square error of the position of the weakest point in the network calculated.

Sign in / Sign up

Export Citation Format

Share Document