The swarm intelligence and evolutionary methods are commonly utilized by researchers in solving the difficult combinatorial and Non-Deterministic Polynomial (NP) problems. The N-Queen problem can be defined as a combinatorial problem that became intractable for the large ‘n’ values and, thereby, it is placed in the NP class of problems. In the present study, a solution is suggested for the N-Queen problem, on the basis of the Meerkat Clan Algorithm (MCA). The problem of n-Queen can be mainly defined as one of the generalized 8-Queen problem forms, for which the aim is placing 8 queens in a way that none of the queens has the ability of killing the others with the use of the standard moves of the chess queen. The Meerkat Clan environm

Simulated annealing (SA) has been an effective means that can address difficulties related to optimization problems. is now a common discipline for research with several productive applications such as production planning. Due to the fact that aggregate production planning (APP) is one of the most considerable problems in production planning, in this paper, we present multi-objective linear programming model for APP and optimized by . During the course of optimizing for the APP problem, it uncovered that the capability of was inadequate and its performance was substandard, particularly for a sizable controlled problem with many decision variables and plenty of constraints. Since this algorithm works sequentially then the current state wi

This research is concerned with the re-analysis of optical data (the imaginary part of the dielectric function as a function of photon energy E) of a-Si:H films prepared by Jackson et al. and Ferlauto et al. through using nonlinear regression fitting we estimated the optical energy gap and the deviation from the Tauc model by considering the parameter of energy photon-dependence of the momentum matrix element of the p as a free parameter by assuming that density of states distribution to be a square root function. It is observed for films prepared by Jackson et al. that the value of the parameter p for the photon energy range is is close to the value assumed by the Cody model and the optical gap energy is which is also close to the value

    In this work, we introduce Fibonacci– Halpern iterative scheme ( FH scheme) in partial ordered Banach space (POB space) for monotone total asymptotically non-expansive mapping (, MTAN mapping) that defined on weakly compact convex subset.  We also  discuss the results of weak and strong convergence for this scheme.

 Throughout  this work, compactness condition of m-th iterate  of the mapping for some natural m is necessary to ensure strong convergence, while Opial's condition has been employed to show weak convergence. Stability of FH scheme is also  studied. A numerical comparison is provided by an example to show that FH scheme is faster than Mann and Halpern iterative

There are many different methods for analysis of two-way reinforced concrete slabs. The most efficient methods depend on using certain factors given in different codes of reinforced concrete design. The other ways of analysis of two-way slabs are the direct design method and the equivalent frame method. But these methods usually need a long time for analysis of the slabs.

In this paper, a new simple method has been developed to analyze the two-way slabs by using simple empirical formulae, and the results of final analysis of some examples have been compared with other different methods given in different codes of practice.

The comparison proof that this simple proposed method gives good results and it can be used in analy

            In this paper, several conditions are put in order to compose the sequence of partial sums ,  and  of the fractional operators of analytic univalent functions ,  and   of bounded turning which are bounded turning too.

     The focus of this article is to add a new class of rank one of  modified Quasi-Newton techniques to solve the problem of unconstrained optimization by updating the inverse Hessian matrix with an update of rank 1, where a diagonal matrix is the first component of the next inverse Hessian approximation, The inverse Hessian matrix is  generated by the method proposed which is symmetric and it satisfies the condition of modified quasi-Newton, so the global convergence is retained. In addition, it is positive definite that  guarantees the existence of the minimizer at every iteration of the objective function. We use  the program MATLAB to solve an algorithm function to introduce the feasibility of