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...

In this paper we study bidirectional state space search with consistent heuristics, with a focus on obtaining sufficient conditions for node expansion, i.e., conditions characterizing nodes that must be expanded by any admissible bidirectional search algorithm. We provide such conditions for front-to-front and front-to-end bidirectional search. The sufficient conditions are used to prove that t...

In the GA approach the parameters that influence its performance include population size, crossover rate and mutation rate. Genetic algorithms are suitable for traversing large search spaces since they can do this relatively fast and because the mutation operator diverts the method away from local optima, which will tend to become more common as the search space increases in size. GA’s are base...

The shape optimization of gravity dam is posed as an optimization problem with goals of minimum value of concrete, stresses and maximum safety against overturning and sliding need to be achieved. Optimally designed structure generally saves large investments especially for a large structure. The size of hydraulic structures is usually huge and thus requires a huge investment. If the optimizatio...

casimir forces of massive ferrnionic dirac fields are calculated for parallel plates geometry in spatial space with dimension d and imposing bag model boundary conditions. it is shown that in the range of ma>>l where m is mass of fields quanta and a is the separation distance of the plates, it is equal to massive bosonic fields casimir force for each degree of freedom. we argue this equality ex...

Different methods are available for simultaneous optimization of cross-section, topology and geometry of truss structures. Since the search space for this problem is very large, the probability of falling in local optimum is considerably high. On the other hand, different types of design variables (continuous and discrete) lead to some difficulties in the process of optimization. In this articl...

This paper investigates the use of evolutionary algorithms for the search of hypothesis space in machine learning tasks. As opposed to the common scalar evaluation function imposing a complete order onto the hypothesis space, we propose genetic search incorporating pairwise comparison of hypotheses. Particularly, we allow incomparability of hypotheses, what implies a partial order in the hypoth...

While searching for suboptimal solutions for large-scale problems, it is critical to force search algorithms on promising regions. This paper presents genetic algorithms with search space reductions (RGAs) and their application to solving large-scale permutation flowshop problems. The reduced search spaces are defined by adding precedence constraints generated by heuristic rules. To balance bet...