Author(s):  
Ahmad Smaili ◽  
Mazen Hassanieh ◽  
Bachir Chaaya ◽  
Fawzan Al Fares

A modified real coded quantum-inspired evolution algorithm (MRQIEA) is herein presented for optimum synthesis of planar rigid body mechanisms (RBMs). The MRQIEA employs elements of quantum computing such as quantum bits, registers, and quantum gates, neighborhood search engine, and gradient search to form a random search algorithm for solution optimization of a wide class of problems. A brief overview of the quantum computing elements and their adaptation to the optimization algorithm is first presented. The algorithm is then adapted to the synthesis problem of RBMs. Finally, the algorithm is demonstrated and compared to other search methods by way of three examples, including two benchmark examples that have been used in the literature to assess the performance of other optimization schemes.


Author(s):  
Ahmad Smaili ◽  
Naji Atallah

Mechanism synthesis requires the use of optimization methods to obtain approximate solution whenever the desired number of positions the mechanism is required to traverse exceeds a few (five in a 4R linkage). Deterministic gradient-based methods are usually impractical when used alone because they move in the direction of local minima. Random search methods on the other hand have a better chance of converging to a global minimum. This paper presents a tabu-gradient search based method for optimum synthesis of planar mechanisms. Using recency-based short-term memory strategy, tabu-search is initially used to find a solution near global minimum, followed by a gradient search to move the solution ever closer to the global minimum. A brief review of tabu search method is presented. Then, tabu-gradient search algorithm is applied to synthesize a four-bar mechanism for a 10-point path generation with prescribed timing task. As expected, Tabu-gradient base search resulted in a better solution with less number of iterations and shorter run-time.


1974 ◽  
Vol 96 (1) ◽  
pp. 71-76 ◽  
Author(s):  
W. J. Carter ◽  
K. M. Ragsdell

A new numerical search algorithm is presented which is employed to determine optimum shapes for pin-ended columns having elastic behavior. The search algorithm utilizes a gradient search scheme to seek out the optimum solutions. A Lagrange-like solution is given for the Strongest Column Problem of Lagrange.


2006 ◽  
Vol 33 (6Part17) ◽  
pp. 2202-2202 ◽  
Author(s):  
R Popple ◽  
I Brezovich ◽  
J Fiveash ◽  
J Duan ◽  
S Shen ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document