The neighbourhood unit is a small local community in a city dwelled by certain number of dwellers who are characterized by common features, mostly economic. They daily deal with each other & unified with the feeling of neighbourhood. The daily primary services are available in this small community (like education, shopping & entertainment). This community is separated from other communities by physical boundaries like streets, gardens… etc. The neighbourhood is not an exotic notion on human community but it is as ancient as history itself since it was there in ancient communities that dwelled on earth. Complications of urban life needs, caused by cities’ expansion, and the weakness of social relationships, imposed phy

        Throughput accounting is concerned with a throughput measurement process to determine the efficiency of the company, to know the problems and obstacles it suffers from, to determine their causes and ways to address them.The research problem is represented by the following question: does the application of a throughput accounting lead to maximizing the company's profits? The aim of the research is to demonstrate the importance of throughput accounting, which is one of the tools of management accounting in providing an efficient information system that provides the company’s management with the information it needs to improve its production processes, increase a throughput, and thus maxi

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

A new human-based heuristic optimization method, named the Snooker-Based Optimization Algorithm (SBOA), is introduced in this study. The inspiration for this method is drawn from the traits of sales elites—those qualities every salesperson aspires to possess. Typically, salespersons strive to enhance their skills through autonomous learning or by seeking guidance from others. Furthermore, they engage in regular communication with customers to gain approval for their products or services. Building upon this concept, SBOA aims to find the optimal solution within a given search space, traversing all positions to obtain all possible values. To assesses the feasibility and effectiveness of SBOA in comparison to other algorithms, we conducte

The k-out-of-n:G (or k/n:G) system structure is a very popular of redundancy in
fault-tolerant systems, with wide applications in so many fields. This paper presents
two states of multi-state k/n:G systems. The first part, we present the definition that
introduced by Al-Neweihi et al [1], where the values are the same with respect
to all system states and we show that there exists an alternative equivalent definition
to Al-Neweihi's definition. In the second part of this paper we give more general
definition proposed by Huang et al [2], where it allows different values with
respect to different system states and we provide there exists an equivalent definition
to Huang's definition when the values are increasing.

The research is a vision of the future of industry in Iraq, so it is may be outside the ceiling of the capabilities of the Iraqi economy, and therefore it is exaggerated. Therefore, future plans must be applicable through the availability of capabilities. Everyone knows that the financial and administrative corruption and mismanagement of resources are the main cause of the inefficiency of the industrial sector, and the failure to exercise its real role in achieving economic development.; as well as the political situation and the dominance of parties and their insistence on addressing positions that have a strong relationship in managing the economic sector that has a significant impact on drawing the economic map in its current

     In this research, we propose to use two local search methods (LSM's); Particle Swarm Optimization (PSO) and the Bees Algorithm (BA) to solve Multi-Criteria Travelling Salesman Problem (MCTSP) to obtain the best efficient solutions. The generating process of the population of the proposed LSM's may be randomly obtained or by adding some initial solutions obtained from some efficient heuristic methods. The obtained solutions of the PSO and BA are compared with the solutions of the exact methods (complete enumeration and branch and bound methods) and some heuristic methods. The results proved the efficiency of PSO and BA methods for a large number of nodes ( ). The proposed LSM's give the best efficient solutions for the MCTSP for

The region-based association analysis has been proposed to capture the collective behavior of sets of variants by testing the association of each set instead of individual variants with the disease. Such an analysis typically involves a list of unphased multiple-locus genotypes with potentially sparse frequencies in cases and controls. To tackle the problem of the sparse distribution, a two-stage approach was proposed in literature: In the first stage, haplotypes are computationally inferred from genotypes, followed by a haplotype coclassification. In the second stage, the association analysis is performed on the inferred haplotype groups. If a haplotype is unevenly distributed between the case and control samples, this haplotype is labeled