The aim of this research is to construct a three-dimensional maritime transport model to transport nonhomogeneous goods (k) and different transport modes (v) from their sources (i) to their destinations (j), while limiting the optimum quantities v ijk x to be transported at the lowest possible cost v ijk c and time v ijk t using the heuristic algorithm, Transport problems have been widely studied in computer science and process research and are one of the main problems of transport problems that are usually used to reduce the cost or times of transport of goods with a number of sources and a number of destinations and by means of transport to meet the conditions of supply and demand. Transport models are a key tool in logistics an

     The concept of a small f- subm was presented in a previous study. This work introduced a concept of a hollow f- module, where a module is said to be hollow fuzzy when every subm of it is a small f- subm. Some new types of hollow modules are provided namely, Loc- hollow f- modules as a strength of the hollow module, where every Loc- hollow f- module is a hollow module, but the converse is not true. Many properties and characterizations of these concepts are proved, also the relationship between all these types is researched. Many important results that explain this relationship are demonstrated also several characterizations and properties related to these concepts are given.

In this research for each positive integer integer and is accompanied by connecting that number with the number of Bashz Attabq result any two functions midwives to derive a positive integer so that there is a point

The aim of this paper is to introduce and study the notion type of fibrewise topological spaces, namely fibrewise fuzzy j-topological spaces, Also, we introduce the concepts of fibrewise j-closed fuzzy topological spaces, fibrewise j-open fuzzy topological spaces, fibrewise locally sliceable fuzzy j-topological spaces and fibrewise locally sectionable fuzzy j-topological spaces. Furthermore, we state and prove several Theorems concerning these concepts, where j = {δ, θ, α, p, s, b, β}.

   The main focus of this research is to examine the Travelling Salesman Problem (TSP) and the methods used to solve this problem where this problem is considered as one of the combinatorial optimization problems which met wide publicity and attention from the researches for to it's simple formulation and important applications and engagement to the rest of combinatorial problems , which is based on finding the optimal path through known number of cities where the salesman visits each city only once before returning to the city of departure n this research , the benefits  of( FMOLP)   algorithm is employed as one of the best methods to solve the (TSP) problem and the application of the algorithm in conjun

Let f and g be a self – maps of a rational exterior space . A natural number m is called a minimal coincidence period of maps f and g if f^m and g^m have a coincidence point which is not coincidence by any earlier iterates. This paper presents a complete description of the set of algebraic coincidence periods for self - maps of a rational exterior space which has rank 2 .

The current research aims to identify the effect of the program to develop the skill of friendship among kindergarten children, as well as the scope of the impact of the program on the sample. To achieve the objectives of the research, the researcher hypothesizes there is no significant difference between the average scores of the sample members on the friendship skill scale for the dimensional scale according to the experimental and control group. The research sample consisted of (60) girl and boy with age ranges (4-6) who were randomly selected from the Kindergarten Unity at Baghdad city/ Rusafa 1. The children were distributed into an experimental and control group, each group consists of (30) girl and boy. The two groups were chosen