نتایج جستجو برای: backtracking search optimization algorithm

تعداد نتایج: 1182735  

Amin Rastegar Pour, Hassan Barati,

Abstract: One of the equipment that can help improve distribution system status today and reduce the cost of fault time is remote control switches (RCS). Finding the optimal location and number of these switches in the distribution system can be modeled with various objective functions as a nonlinear optimization problem to improve system reliability and cost. In this article, a particle swarm ...

Journal: :iranian journal of mechanical engineering transactions of the isme 0

this paper presents a clear monograph on the optimization of thermal instability resistance of the fg (functionally graded) flat structures. for this aim, two fg flat structures, namely an fg beam and an fg circular plate, are considered. these structures are assumed to obey the first-order shear deformation theory, three-parameters power-law distribution of the constituents, and clamped bounda...

Journal: :journal of advances in computer research 2013
narges mahmoodi darani vahid ahmadi zahra saadati eskandari majid yousefikhoshbakht

the capacitated clustering problem (ccp) is one of the most importantcombinational optimization problems that nowadays has many real applications inindustrial and service problems. in the ccp, a given n nodes with known demandsmust be partitioned into k distinct clusters in which each cluster is detailed by anode acting as a cluster center of this cluster. the objective is to minimize the sumof...

Journal: :international journal of civil engineering 0
a. kaveh iust m. farahani iust n. shojaei sadra

barrel vaults are attractive space structures that cover large area without intermediate supports. in this paper, the charged search system (css) optimization algorithm is employed for optimal design of barrel vaults. this method utilizes the governing laws of coulomb and gauss from electrostatics and the newtonian law of mechanics. the results demonstrate the efficiency of the discrete css alg...

1983
Malik Ghallab Dennis G. Allard

Two drawbacks to A* explain its high complexity. First, A* tends to do much backtracking due to the invariable choice of n' as the node to be expanded next. A* tends to expand many nodes not in the final solution path since h (being a heuristic) fluctuates in quality and hence various near optimal paths take random turns appearing to be optimal. Such paths effectively "race" with one another to...

Mohammad Reza Meybodi Mojtaba Gholamian,

So far various methods for optimization presented and one of most popular of them are optimization algorithms based on swarm intelligence and also one of most successful of them is Particle Swarm Optimization (PSO). Prior some efforts by applying fuzzy logic for improving defects of PSO such as trapping in local optimums and early convergence has been done. Moreover to overcome the problem of i...

2016
Mathieu Brévilliers Omar Abdelkafi Julien Lepagnot Lhassane Idoumghar

This paper introduces a hybridization of Backtracking Search Optimization Algorithm (BSA) with Differential Evolution (DE) and Simulated Annealing (SA) in order to improve the convergence speed of BSA. An experimental study, conducted on 20 benchmark problems, shows that this approach outperforms BSA and two other hybridizations [4, 18], in terms of solution quality and convergence speed. We al...

This paper proposes a novel hybrid algorithm namely APSO-BFO which combines merits of Bacterial Foraging Optimization (BFO) algorithm and Adaptive Particle Swarm Optimization (APSO) algorithm to determine the optimal PID parameters for control of nonlinear systems. To balance between exploration and exploitation, the proposed hybrid algorithm accomplishes global search over the whole search spa...

2001
Xinguang Chen Peter van Beek

In recent years, many improvements to backtracking algorithms for solving constraint satisfaction problems have been proposed. The techniques for improving backtracking algorithms can be conveniently classi ed as look-ahead schemes and look-back schemes. Unfortunately, look-ahead and look-back schemes are not entirely orthogonal as it has been observed empirically that the enhancement of look-a...

Journal: :مهندسی سازه 0
احسان کریمی

optimization of structures for minimum weight has become important in the recent designs. in this study, a genetic optimization algorithm for weight minimization of steel frames has been used. the genetic algorithm is an optimization and search technique based on the principles of genetics and natural selection. constraints regarding material strength and serviceability are taken from “aisc cod...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید