Constrained Globalized Nelder—Mead Method for Simultaneous Structural and Manufacturing Optimization of a Composite Bracket

Ghiasi, Hossein; Pasini, Damiano; Lessard, Larry

doi:10.1177/0021998307088592

Cited by 35 publications

(25 citation statements)

References 26 publications

(39 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In [26], Ghiasi et al proposed a new probability evaluation method, called variable variance probability (VVP). The new probability evaluation method is based on the least space to the points previously tested and is represented as:…”

Section: Constrained Globalized Nelder-mead (Cgnm) Algorithmmentioning

confidence: 99%

See 1 more Smart Citation

An efficient global technique for solving the network constrained static and dynamic economic dispatch problem

Nawaz¹,

Saleem²,

Mustafa³

et al. 2017

Turk J Elec Eng & Comp Sci

View full text Add to dashboard Cite

This paper presents a new approach for solving the economic load dispatch (ELD) problem with generator constraints and transmission losses. The constrained globalized Nelder-Mead algorithm is a newly proposed algorithm for solving economic dispatch problems with and without valve-point effects. Convex and nonconvex cost functions with equality and inequality constraints are difficult to optimize. To circumvent these problems, a robust global technique is desirable. In this paper, the constrained globalized Nelder-Mead algorithm is proposed to optimize the ELD problem globally using variance variable probability. To validate the proficiency of the proposed approach, statistical studies have been accomplished for different test systems of static economic dispatch including 3-unit convex and nonconvex systems without losses, a 6-unit convex system with losses, 13-unit nonconvex systems without losses, and a 20-unit nonconvex system without losses. The proposed model proficiency is verified by applying it to dynamic economic dispatch for test systems including a 3-unit convex system with no losses and a 5-unit nonconvex system with losses. Comparison of the proposed algorithm with other optimization algorithms reported in the literature shows that the proposed algorithm is quite robust. The proposed algorithm has improved results from 0.0001% to 4.44% in different case studies.

show abstract

Section: Constrained Globalized Nelder-mead (Cgnm) Algorithmmentioning

confidence: 99%

“…This paper presents a new algorithm that has just been evaluated with mathematical test functions in MATLAB by Ghiasi et al [26]. It has not been implemented in any area of power systems except short-term load forecasting [19] and other potential research areas.…”

Section: Introductionmentioning

confidence: 99%

An efficient global technique for solving the network constrained static and dynamic economic dispatch problem

Nawaz¹,

Saleem²,

Mustafa³

et al. 2017

Turk J Elec Eng & Comp Sci

View full text Add to dashboard Cite

show abstract

“…The method is called Globalized Bounded Nelder-Mead method (GBNM) [30,31] and uses a probability function that repeatedly restarts the N-M local search. The probabilistic restart permits the local search to initiate a new search from points different from those already explored.…”

Section: Optimization Algorithmmentioning

confidence: 99%

Optimum Structural and Manufacturing Design of a Braided Hollow Composite Part

et al. 2009

Self Cite

View full text Add to dashboard Cite

Simultaneous material consolidation and shaping, as performed in manufacturing of composite materials, causes a strong interconnection between structural and manufacturing parameters which makes the design process complicated. In this paper, the design of a carbon fiber bicycle stem is examined through the application of a multi-objective optimization method to illustrate the interconnection between structural and manufacturing objectives. To demonstrate the proposed method, a test case dealing with the design of composite part with complex geometry, small size and hollow structure is described. Bladder-assisted Resin Transfer Molding is chosen as the manufacturing method. A finite element model of the stem is created to evaluate the objectives of the structural design, while a simplified 2D model is used to simulate the flow inside the preform during the injection process. Both models are formulated to take into account the variation of fiber orientation, thickness and fiber volume fraction as a function of braid diameters, injection pressure and bladder pressure. Finally, a multiobjective optimization method, called Normalized Normal Constraint Method, is used to find a set of solutions that simultaneously optimizes weight, filling time and strength. The solution to the problem is a set of optimum designs which represent the Pareto frontier of the problem. Pareto frontier helps to gain insight into the trade-off among objectives, whose presence and importance is confirmed by the numerical results presented in this paper.

show abstract

“…However, the major limitation of all these ways of handling constraints is the necessity for the initial simplex to lie in the feasible region. Ghiasi et al (2008) presented a backtracking (projection) procedure for handling nonlinear constraints. In this method, when a new point generated during the usual simplex iteration violates one of the constraints, the point is moved towards the original feasible point by a factor such that the distance between them reduces.…”

Section: Introductionmentioning

confidence: 99%

A constrained optimization algorithm based on the simplex search method

Mehta

DasGupta

2012

Engineering Optimization

View full text Add to dashboard Cite

In this article, a robust method is presented for handling constraints with the Nelder and Mead simplex search method, which is a direct search algorithm for multidimensional unconstrained optimization. The proposed method is free from the limitations of previous attempts that demand the initial simplex to be feasible or a projection of infeasible points to the nonlinear constraint boundaries. The method is tested on several benchmark problems and the results are compared with various evolutionary algorithms available in the literature. The proposed method is found to be competitive with respect to the existing algorithms in terms of effectiveness and efficiency.

show abstract

Constrained Globalized Nelder—Mead Method for Simultaneous Structural and Manufacturing Optimization of a Composite Bracket

Cited by 35 publications

References 26 publications

An efficient global technique for solving the network constrained static and dynamic economic dispatch problem

An efficient global technique for solving the network constrained static and dynamic economic dispatch problem

Optimum Structural and Manufacturing Design of a Braided Hollow Composite Part

A constrained optimization algorithm based on the simplex search method

Contact Info

Product

Resources

About