the accuracy of stereolithography (sl) product is very essential for meeting the intended functional applications. the parameters like layer thickness, hatch spacing, hatch overcure contribute significantly to the accuracy of the sl parts. in this paper an attempt has been made to identify the process parameters that influences on the accuracy of the parts made with ciba tool 5530 and optimize ...

Many real-world search and optimization problems involve inequality and/or equality constraints and are thus posed as constrained optimization problems. In trying to solve constrained optimization problems using classical optimization methods, this paper presents a Multi-Objective Bees Algorithm (MOBA) for solving the multi-objective optimal of mechanical engineering problems design. In the pre...

the objective of this research is geometrical optimization of half toroidal continuously variable transmission (cvt) in order to achieve high power transmission efficiency and low weight. after dynamic analysis of the system, the contact between the disk and the roller is modeled according to elasto-hydrodynamic lubrication principles. accordingly, a computer model is created with geometric, th...

Geometric programming is efficient tool for solving a variety of nonlinear optimizationproblems. Geometric programming is generalized for solving engineering design. However,Now Geometric programming is powerful tool for optimization problems where decisionvariables have exponential form.The geometric programming method has been applied with known parameters. However,the observed values of the ...

This contribution deals with an optimal design of a brushless DC motor, using optimization algorithms, based on collective intelligence. For this purpose, the case study motor is perfectly explained and its significant specifications are obtained as functions of the motor geometric parameters. In fact, the geometric parameters of the motor are considered as optimization variables. Then, the obj...

Linear Programming 15 contain such a constraint), which implies that after kd iterations (H) (B) 2k. Hence, after kd successful rounds, 2k (H) nek=3. This implies that the above algorithm terminates in at most 3d lnn successful rounds. Since each round takes O(dd) time to compute xR and O(dn) time to compute V , the expected running time of the algorithm is O((d2n+dd+1) log n). By combining thi...