د. عادل هاشم نوري الحجار

of them its properties are discussed in this type. Also ,we introduced some theorems and examples of ƁD-algebra . Its properties differ from the rest of the other types of algebras . We tried to connect it with other types of algebras. We have also introduced a new type of ideals this type of algebra. and have tried to relate it to other ideals through the properties and theorems. Also, we have define a new type of BF algebra, namely transitive ideal and we have introduced some theorems and properties that relate to other types of algebras. Also, we define a new type of filters , is called BF filter and tried to study it and linked it to other concepts in BF algebra. Finally, we introduced the pseudo BF -algebra and some concepts and properties that belong to him and then we studied some of the theorems linking the ideals that exist between them

In this paper, we introduced a new type of algebra namely a BA -algebra and some of them its properties are discussed in this type. Also, we introduced some theorems and examples of BA -algebra. Its properties differ from the rest of the other types of algebras. We tried to connect it with other types of algebras. We have also introduced a new type of ideal in this type of algebra and have tried to relate it to other ideals through the properties and theorems.

In this paper, we define a new type of algebras is a pseudo TM-algebra. Some notions of this type are introduced. Also, some properties and theorems are studied and proved

In this paper, we define the notion of a pseudo B-ideal , a pseudo H-ideal and a pseudo Essence of a pseudo BH-algebra. Also, we study some properties and relationship between them. Some properties of a pseudo Essence of a pseudo BH-algebra are studied with respect to pseudo ideal of a pseudo BH-algebra.

In this paper some types of a pseudo BH -algebra are defined. Also the notions of a pseudo completely closed ideal a pseudo strong ideal a pseudo p-ideal and a pseudo q-ideal are investigated. Also some properties and relationship among them are discussed

This research presents a hybrid method that solves the travelling salesman issue by combining genetic algorithm, local algorithm, and simulated annealing. When tested against a number of benchmarks, this method consistently produced excellent results. Full hybrid approaches converged to high-quality solutions more quickly, with most seeing substantial gains within the first 10–15 iterations, according to the data. There was an improvement in solution quality of around 15% to 25% over the original solutions. Also, solution time metrics were improved since the total number of iterations needed was lowered. There was less variance in solution quality and the entire hybrid method performed best across all issue situations