1999
DOI: 10.1016/s0045-7949(98)00287-9
|View full text |Cite
|
Sign up to set email alerts
|

A comparison of search mechanisms for structural optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
14
0
1

Year Published

2001
2001
2012
2012

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 45 publications
(15 citation statements)
references
References 10 publications
0
14
0
1
Order By: Relevance
“…Augugliaro et al (1999) compare SA, GA, and TS in problems involving the reconfiguration of radial distribution electric power networks and find that TS performs best in this class of problems. Finally, Fu & Su (2000), Fudo et al (2000), Ganley & Heath (1998), Manoharan & Shanmuganathan (1999), Sinclair (1993), and Youssef et al (2001) compare SA, GA, and TS in problems involving the minimization of assembly time in printed wiring assembly, service restoration in electricity distribution systems, graph partitioning, structural engineering optimization, balancing hydraulic turbine runners, and the floor-planning of very large scale integrated (VLSI) circuits, respectively, in many cases without identifying any clear winners.…”
Section: Discussionmentioning
confidence: 99%
“…Augugliaro et al (1999) compare SA, GA, and TS in problems involving the reconfiguration of radial distribution electric power networks and find that TS performs best in this class of problems. Finally, Fu & Su (2000), Fudo et al (2000), Ganley & Heath (1998), Manoharan & Shanmuganathan (1999), Sinclair (1993), and Youssef et al (2001) compare SA, GA, and TS in problems involving the minimization of assembly time in printed wiring assembly, service restoration in electricity distribution systems, graph partitioning, structural engineering optimization, balancing hydraulic turbine runners, and the floor-planning of very large scale integrated (VLSI) circuits, respectively, in many cases without identifying any clear winners.…”
Section: Discussionmentioning
confidence: 99%
“…In this study, TS algorithm is selected because of its efficiency in solving combinatorial optimization problems [52][53][54]. TS algorithm has been applied to various structural optimization problems and has been found very effective in identifying the optimal solutions [28,55,56].…”
Section: Evaluation Of Tabu Search Algorithmmentioning
confidence: 99%
“…Sequential Quadratic Programming (SQP) [40] was used for this purpose via matlab function fmincon. The SQP method is relatively efficient for high dimensional problems (genetic algorithms, and simulated annealing by contrast, appear to be rather less efficient [41,42]). In addition to imposed parameter constraints, the need for an implicit penalty constraint was mentioned in Section 5 to allow calibration.…”
Section: Physical Model Calibrationmentioning
confidence: 99%