Today’s academics have a major hurdle in solving combinatorial problems in the actual world. It is nevertheless possible to use optimization techniques to find, design, and solve a genuine optimal solution to a particular problem, despite the limitations of the applied approach. A surge in interest in population-based optimization methodologies has spawned a plethora of new and improved approaches to a wide range of engineering problems. Optimizing test suites is a combinatorial testing challenge that has been demonstrated to be an extremely difficult combinatorial optimization limitation of the research. The authors have proposed an almost infallible method for selecting combinatorial test cases. It uses a hybrid whale–gray wolf optimization algorithm in conjunction with harmony search techniques. Test suite size was significantly reduced using the proposed approach, as shown by the analysis of the results. In order to assess the quality, speed, and scalability of TWGH, experiments were carried out on a set of well-known benchmarks. It was shown in tests that the proposed strategy has a good overall strong reputation test reduction size and could be used to improve performance. Compared with well-known optimization-based strategies, TWGH gives competitive results and supports high combinations (2 ≤ t ≤ 12).
This paper investigates some exact and local search methods to solve the traveling salesman problem. The Branch and Bound technique (BABT) is proposed, as an exact method, with two models. In addition, the classical Genetic Algorithm (GA) and Simulated Annealing (SA) are discussed and applied as local search methods. To improve the performance of GA we propose two kinds of improvements for GA; the first is called improved GA (IGA) and the second is Hybrid GA (HGA).
The IGA gives best results than GA and SA, while the HGA is the best local search method for all within a reasonable time for 5 ≤ n ≤ 2000, where n is the number of visited cities. An effective method of reducing the size of the TSP matrix was proposed with
... Show MoreIn this paper, a least squares group finite element method for solving coupled Burgers' problem in 2-D is presented. A fully discrete formulation of least squares finite element method is analyzed, the backward-Euler scheme for the time variable is considered, the discretization with respect to space variable is applied as biquadratic quadrangular elements with nine nodes for each element. The continuity, ellipticity, stability condition and error estimate of least squares group finite element method are proved. The theoretical results show that the error estimate of this method is . The numerical results are compared with the exact solution and other available literature when the convection-dominated case to illustrate the effic
... Show MorePraise be to God, who created people from one soul, and made her husband, and prayers and peace be upon His Messenger, Mercy given and the grace given, and on a machine and companions pure. Divorce cases have increased in recent years in a worrying manner, especially since divorce has unforeseen consequences at the individual and social levels. The source of concern stems from the fact that the cohesion and integrity of society starts from a family as it is the cornerstone of the social structure, which is the foundation upon which the large society is based. Marital life may suffer from problems and obstacles that are difficult to solve, so the man presents the divorce of his wife and that the phenomenon of divorce is not a result of it, b
... Show MoreThe method binery logistic regression and linear discrimint function of the most important statistical methods used in the classification and prediction when the data of the kind of binery (0,1) you can not use the normal regression therefore resort to binary logistic regression and linear discriminant function in the case of two group in the case of a Multicollinearity problem between the data (the data containing high correlation) It became not possible to use binary logistic regression and linear discriminant function, to solve this problem, we resort to Partial least square regression.
In this, search the comparison between binary lo
... Show MoreThe process of granting loans by banks is the confidence they give to their customers, but this trust should not be a cornerstone in granting loans even if granted these loans on the basis of sound banking should involve risks that may be exposed to the bank because of the failure of the client to meet The bank's financial obligations to the bank due to the unexpected economic conditions affecting the customers, which makes them in a state of faltering, which weaken the ability of banks to provide loans, which are the most important sources of revenue and profits, so the problem of non-performing loans is one of the main problems facing most of the banks Which impede the functioning of its work and the reasons that led to the agg
... Show MoreThe paper is concerned with the state and proof of the solvability theorem of unique state vector solution (SVS) of triple nonlinear hyperbolic boundary value problem (TNLHBVP), via utilizing the Galerkin method (GAM) with the Aubin theorem (AUTH), when the boundary control vector (BCV) is known. Solvability theorem of a boundary optimal control vector (BOCV) with equality and inequality state vector constraints (EINESVC) is proved. We studied the solvability theorem of a unique solution for the adjoint triple boundary value problem (ATHBVP) associated with TNLHBVP. The directional derivation (DRD) of the "Hamiltonian"(DRDH) is deduced. Finally, the necessary theorem (necessary conditions "NCOs") and the sufficient theorem (sufficient co
... Show MoreThis paper has the interest of finding the approximate solution (APPS) of a nonlinear variable coefficients hyperbolic boundary value problem (NOLVCHBVP). The given boundary value problem is written in its discrete weak form (WEFM) and proved have a unique solution, which is obtained via the mixed Galerkin finite element with implicit method that reduces the problem to solve the Galerkin nonlinear algebraic system (GNAS). In this part, the predictor and the corrector techniques (PT and CT, respectively) are proved at first convergence and then are used to transform the obtained GNAS to a linear GLAS . Then the GLAS is solved using the Cholesky method (ChMe). The stability and the convergence of the method are stud
... Show MoreIn this paper, we will present proposed enhance process of image compression by using RLE algorithm. This proposed yield to decrease the size of compressing image, but the original method used primarily for compressing a binary images [1].Which will yield increasing the size of an original image mostly when used for color images. The test of an enhanced algorithm is performed on sample consists of ten BMP 24-bit true color images, building an application by using visual basic 6.0 to show the size after and before compression process and computing the compression ratio for RLE and for the enhanced RLE algorithm.