in this paper a discrete big bang-big crunch algorithm is applied to optimal design of reinforced concrete planar frames under the gravity and lateral loads. optimization is based on aci 318-08 code. columns are assumed to resist axial loads and bending moments, while beams resist only bending moments. second-order effects are also considered for the compression members, and columns are checked...

this article presents the application of two algorithms: heuristic big bang-big crunch (hbb-bc) and a heuristic particle swarm ant colony optimization (hpsaco) to discrete optimization of reinforced concrete planar frames subject to combinations of gravity and lateral loads based on aci 318-08 code. the objective function is the total cost of the frame which includes the cost of concrete, formw...

the main purpose in this paper, to express strong algorithmic optimization in their ability to detect expression target of sar that use in aircraft, plane and satellites to observe the target on the ground. for this purpose,the sar technology and its applications are introduced. previous algorithms used in this field with poor diagnosis and appropriate speed is low, like means and fuzzy and pso...

sink location is considered as a basic service in geographic routing in wireless sensor networks. obtaining the location of sink node by source node using an efficient method with low complexity has always been a challenging issue in research. in this paper, a sink location algorithm based on fano plane is proposed. the research challenge is how to ensure the intersection of two slq and sla rou...

given a set  of  points in the plane and a constant ,-center problem is to find two closed disks which each covers the whole , the diameter of the bigger one is minimized, and the distance of the two centers is at least . constrained -center problem is the -center problem in which the centers are forced to lie on a given line . in this paper, we first introduce -center problem and its constrain...

In this paper multi objective optimization problem for partitioning process of VLSI circuit optimization is solved using IPO algorithm. The methodology used in this paper is based upon the dynamic of sliding motion along a frictionless inclined plane. In this work, modules and elements of the circuit are divided into two smaller parts (components) in order to minimize the cutsize and area imbal...