The traveling salesman problem (TSP) is a well-known and important combinatorial optimization problem. The goal is to find the shortest tour that visits each city in a given list exactly once and then returns to the starting city. In this paper we exploit the TSP to evaluate the minimum total cost (distance or time) for Iraqi cities. So two main methods are investigated to solve this problem; these methods are; Dynamic Programming (DP) and Branch and Bound Technique (BABT). For the BABT, more than one lower and upper bounds are be derived to gain the best one. The results of BABT are completely identical to DP, with less time for number of cities (n), 5 ≤ n ≤ 25. These results proof the efficiency of BABT compared with so

The efficiency evaluation of the railway lines performance is done through a set of indicators and criteria, the most important are transport density, the productivity of enrollee, passenger vehicle production, the productivity of freight wagon, and the productivity of locomotives. This study includes an attempt to calculate the most important of these indicators which transport density index from productivity during the four indicators, using artificial neural network technology. Two neural networks software are used in this study, (Simulnet) and (Neuframe), the results of second program has been adopted. Training results and test to the neural network data used in the study, which are obtained from the international in

This research was designed to investigate the factors affecting the frequency of use of ride-hailing in a fast-growing metropolitan region in Southeast Asia, Kuala Lumpur. An intercept survey was used to conduct this study in three potential locations that were acknowledged by one of the most famous ride-hailing companies in Kuala Lumpur. This study used non-parametric and machine learning techniques to analyze the data, including the Pearson chi-square test and Bayesian Network. From 38 statements (input variables), the Pearson chi-square test identified 14 variables as the most important. These variables were used as predictors in developing a BN model that predicts the probability of weekly usage frequency of ride-hai

Delays occur commonly in construction projects. Assessing the impact of delay is sometimes a contentious
issue. Several delay analysis methods are available but no one method can be universally used over another in
all situations. The selection of the proper analysis method depends upon a variety of factors including
information available, time of analysis, capabilities of the methodology, and time, funds and effort allocated to the analysis. This paper presents computerized schedule analysis programmed that use daily windows analysis method as it recognized one of the most credible methods, and it is one of the few techniques much more likely to be accepted by courts than any other method. A simple case study has been implement

   In this paper,we construct complete (kn,n)-arcs in the projective plane PG(2,11),  n = 2,3,…,10,11  by geometric method, with the related blocking sets and projective codes.
 

A (k,n)-arc is a set of k points of PG(2,q) for some n, but not n + 1 of them, are collinear. A (k,n)-arc is complete if it is not contained in a (k + 1,n)-arc. In this paper we construct complete (kn,n)-arcs in PG(2,5), n = 2,3,4,5, by geometric method, with the related blocking sets and projective codes.

The techniques of fractional calculus are applied successfully in many branches of science and engineering, one of the techniques is the Elzaki Adomian decomposition method (EADM), which researchers did not study with the fractional derivative of Caputo Fabrizio. This work aims to study the Elzaki Adomian decomposition method (EADM) to solve fractional differential equations with the Caputo-Fabrizio derivative. We presented the algorithm of this method with the CF operator and discussed its convergence by using the method of the Cauchy series then, the method has applied to solve Burger, heat-like, and, couped Burger equations with the Caputo -Fabrizio operator. To conclude the method was convergent and effective for solving this type of