In this paper we will investigate some Heuristic methods to solve travelling salesman problem. The discussed methods are Minimizing Distance Method (MDM), Branch and Bound Method (BABM), Tree Type Heuristic Method (TTHM) and Greedy Method (GRM).

The weak points of MDM are manipulated in this paper. The Improved MDM (IMDM) gives better results than classical MDM, and other discussed methods, while the GRM gives best time for 5≤ n ≤500, where n is the number of visited cities.

The focus of this research lies in the definition of an important aspect of financial development, which is reflected on the alleviation of poverty in Iraq, namely financial inclusion and then taking the path of achieving a sustainable economy, certainly after reviewing one of the important international experiences in this regard and finally measuring the level of financial inclusion in Iraq and its impact on poverty reduction through the absolute poverty line indicator.

The Internet image retrieval is an interesting task that needs efforts from image processing and relationship structure analysis. In this paper, has been proposed compressed method when you need to send more than a photo via the internet based on image retrieval. First, face detection is implemented based on local binary patterns. The background is notice based on matching global self-similarities and compared it with the rest of the image backgrounds. The propose algorithm are link the gap between the present image indexing technology, developed in the pixel domain, and the fact that an increasing number of images stored on the computer are previously compressed by JPEG at the source. The similar images are found and send a few images inst

The reaction of 2-amino-benzothiazole with bis [O,O-2,3,O,O – 5,6 – (chloro(carboxylic) methiylidene) ] – L – ascorbic acid (L-AsCl2) gave new product 3-(Benzo[d]Thaizole-2-Yl) – 9-Oxo-6,7,7a,9-Tertrahydro-2H-2,10:4,7-Diepoxyfuro [3,2-f][1,5,3] Dioxazonine – 2,4 (3H) – Dicarboxylic Acid, Hydro-chloride (L-as-am)), which has been insulated and identified by (C, H, N) elemental microanalysis (Ft-IR),(U.v–vis), mass spectroscopy and H-NMR techniques. The (L-as am) ligand complexes were obtained by the reaction of (L-as-am) with [M(II) = Co,Ni,Cu, and Zn] metal ions. The synthesized complexes are characterized by Uv–Visible (Ft –IR), mass spectroscopy molar ratio, molar conductivity, and Magnetic susceptibility techniques. (

The ground state proton, neutron and matter densities and
corresponding root mean square radii of unstable proton-rich 17Ne
and 27P exotic nuclei are studied via the framework of the twofrequency
shell model. The single particle harmonic oscillator wave
functions are used in this model with two different oscillator size
parameters core b and halo , b the former for the core (inner) orbits
whereas the latter for the halo (outer) orbits. Shell model calculations
for core nucleons and for outer (halo) nucleons in exotic nuclei are
performed individually via the computer code OXBASH. Halo
structure of 17Ne and 27P nuclei is confirmed. It is found that the
structure of 17Ne and 27P nuclei have 2
5 / 2 (1d ) an

The theory of general topology view for continuous mappings is general version and is applied for topological graph theory. Separation axioms can be regard as tools for distinguishing objects in information systems. Rough theory is one of map the topology to uncertainty. The aim of this work is to presented graph, continuity, separation properties and rough set to put a new approaches for uncertainty. For the introduce of various levels of approximations, we introduce several levels of continuity and separation axioms on graphs in Gm-closure approximation spaces.

      The concept of semi-essential semimodule has been studied by many researchers.

     In this paper, we will develop these results by setting appropriate conditions, and defining new properties, relating to our concept, for example (fully prime semimodule, fully essential semimodule and semi-complement subsemimodule) such that: if for each subsemimodule of -semimodule  is prime, then  is fully prime. If every semi-essential subsemimodule of -semimodule  is essential then  is fully essential. Finally, a prime subsemimodule  of  is called semi-relative intersection complement (briefly, semi-complement) of subsemimodule  in , if , and whenever  with  is a prime subsemimodule in , , then .  Furthermore, some res

The concept of a 2-Absorbing submodule is considered as an essential feature in the field of module theory and has many generalizations. This articale discusses the concept of the Extend Nearly Pseudo Quasi-2-Absorbing submodules and their relationship to the 2-Absorbing submodule, Quasi-2-Absorbing submodule, Nearly-2-Absorbing submodule, Pseudo-2-Absorbing submodule, and the rest of the other concepts previously studied. The relationship between them has been studied, explaining that the opposite is not true and that under certain conditions the opposite becomes true. This article aims to study this concept and gives the most important propositions, characterizations, remarks, examples, lemmas, and observations related to it. In the en

Agent technology has a widespread usage in most of computerized systems. In this paper agent technology has been applied to monitor wear test for an aluminium silicon alloy which is used in automotive parts and gears of light loads. In addition to wear test monitoring، porosity effect on
wear resistance has been investigated. To get a controlled amount of porosity, the specimens have
been made by powder metallurgy process with various pressures (100, 200 and 600) MPa. The aim of
this investigation is a proactive step to avoid the failure occurrence by the porosity.
A dry wear tests have been achieved by subjecting three reciprocated loads (1000, 1500 and 2000)g
for three periods (10, 45 and 90)min. The weight difference a

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