2001
DOI: 10.1111/0885-9507.00234
|View full text |Cite
|
Sign up to set email alerts
|

Bilevel Parallel Genetic Algorithms for Optimization of Large Steel Structures

Abstract: This article is concerned with optimization of very large steel structures subjected to the actual constraints of the American Institute of Steel Construction ASD and LRFD specifications on high-performance multiprocessor machines using biologically inspired genetic algorithms. First, parallel fuzzy genetic algorithms (GAs) are presented for optimization of steel structures using a distributed memory Message Passing Interface (MPI) with two different schemes: the processor farming scheme and the migration sche… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
102
0

Year Published

2006
2006
2023
2023

Publication Types

Select...
7
2

Relationship

1
8

Authors

Journals

citations
Cited by 158 publications
(104 citation statements)
references
References 13 publications
0
102
0
Order By: Relevance
“…Interactive design with reference to steel structure design is achieved by integrating fuzzy logic into the constraint handling in [58,57]. In order to handle large steel structures the algorithm proposed in [59] expands the previous the two studies above in a parallel fashion. This paper proposes a novel progressive preference articulation mechanism for multi-objective optimisation problems.…”
Section: Progressive Preference Articulation: a Brief Reviewmentioning
confidence: 99%
“…Interactive design with reference to steel structure design is achieved by integrating fuzzy logic into the constraint handling in [58,57]. In order to handle large steel structures the algorithm proposed in [59] expands the previous the two studies above in a parallel fashion. This paper proposes a novel progressive preference articulation mechanism for multi-objective optimisation problems.…”
Section: Progressive Preference Articulation: a Brief Reviewmentioning
confidence: 99%
“…The algorithm implemented based on MapReduce framework can be expanded to large-scale clusters, without changing any code. This is highly beneficial for the solution to problems of variable scale, especially in the case of processing mass data [10,11,12].…”
Section: Rowing Acceleration Of Lsa-sam Evaluation Model Based On Mapmentioning
confidence: 99%
“…So, we have: (10) It is assumed that in MR-LSA-GCC there is (are) m virtual machine (s) to conduct LSA-GCC algorithm as slave nodes, hence there is Ts=m*Tmap. Accordingly, there is: It can be observed from the formula that the acceleration rate of MR-LSA-GCC depends on the time of conducting LSA-GCC algorithm.…”
Section: Analysis Of Acceleration Rate Based On Mapreduce Frameworkmentioning
confidence: 99%
“…al., 2001). In this study, only direct cost is considered as a substantial cost and GAs have been used productively in a number of studies in order to optimize costs Adeli 2001, Sarma andAdeli 2002).…”
Section: Optimization Using Genetic Algorithmsmentioning
confidence: 99%