Development of an efficient algorithm for global optimization by simplex elimination

Cited 3 time in webofscience Cited 0 time in scopus
  • Hit : 300
  • Download : 0
An efficient multi-start algorithm for global optimization is developed by introducing multi-dimensional simplexes as new expression units of attraction regions. The region elimination method generally consists of making a set of eliminated regions called attraction regions, checking adjacency between the current design point and the attraction region, and quitting local optimization for the attracted design points. The efficiency of the elimination method is considerably enhanced by supplementing general simplexes and their neighborhoods to conventional units of attraction regions of points and lines. To show the effectiveness of the proposed algorithm, mathematical problems from the literature are solved and the results are compared with several well-known multi-start algorithms. The present algorithm produces the global optimum in all problems more efficiently than the variants of the multi-start method. Several types of truss, frame, and composite material structures are optimized as engineering applications. Many local optima are found and the differences among the local optima are not negligibly small. These results suggest that an efficient and reliable global optimizer is strongly required in some fields of engineering optimization.
Publisher
TAYLOR & FRANCIS LTD
Issue Date
2003-12
Language
English
Article Type
Article
Keywords

MINIMIZATION

Citation

ENGINEERING OPTIMIZATION, v.35, no.6, pp.607 - 625

ISSN
0305-215X
URI
http://hdl.handle.net/10203/83827
Appears in Collection
ME-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 3 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0