Improved Greedy Algorithm Based Matrix Satellite Cable Connection Optimal Design
نویسندگان
چکیده
منابع مشابه
IMPROVED BIG BANG-BIG CRUNCH ALGORITHM FOR OPTIMAL DIMENSIONAL DESIGN OF STRUCTURAL WALLS SYSTEM
Among the different lateral force resisting systems, shear walls are of appropriate stiffness and hence are extensively employed in the design of high-rise structures. The architectural concerns regarding the safety of these structures have further widened the application of coupled shear walls. The present study investigated the optimal dimensional design of coupled shear walls based on the im...
متن کاملOptimal Shape Design for a Cooling Pin Fin Connection Profil
A shape optimization problem of cooling fins for computer parts and integrated circuits is modeled and solved in this paper. The main purpose is to determine the shape of a two-dimensional pin fin, which leads to the maximum amount of removed heat. To do this, the shape optimization problem is defined as maximizing the norm of the Nusselt number distribution at the boundary of the pin fin's con...
متن کاملDESIGN OPTIMIZATION OF CABLE-STAYED BRIDGES USING MOMENTUM SEARCH ALGORITHM
Design optimization of cable-stayed bridges is a challenging optimization problem because a large number of variables is usually involved in the optimization process. For these structures the design variables are cross-sectional areas of the cables. In this study, an efficient metaheuristic algorithm namely, momentum search algorithm (MSA) is used to optimize the design of cable-stayed bridges....
متن کاملImproved Greedy Algorithm for Set Covering Problem
This paper proposes a greedy algorithm named as Big step greedy set cover algorithm to compute approximate minimum set cover. The Big step greedy algorithm, in each step selects p sets such that the union of selected p sets contains greatest number of uncovered elements and adds the selected p sets to partial set cover. The process of adding p sets is repeated until all the elements are covered...
متن کاملA Greedy Algorithm for Optimal Recombination
Let Σ be an alphabet and Σ denote the collection of all sequences of length n over Σ. For any s1 = a1a2 · · · ajaj+1 · · · an, s2 = b1b2 · · · bj bj+1 · · · bn ∈ Σ, a recombination of s1 and s2 at position j is defined as an operation that crosses s1 and s2 at position j and generates t1 = a1a2 · · · ajbj+1 · · · bn and t2 = b1b2 · · · bjaj+1 · · · an. DenoteA and S two collections of sequences...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MATEC Web of Conferences
سال: 2017
ISSN: 2261-236X
DOI: 10.1051/matecconf/201713900039