In this paper, two of the local search algorithms are used (genetic algorithm and particle swarm optimization), in scheduling number of products (n jobs) on a single machine to minimize a multi-objective function which is denoted as  (total completion time, total tardiness, total earliness and the total late work). A branch and bound (BAB) method is used for comparing the results for (n) jobs starting from (5-18). The results show that the two algorithms have found the optimal and near optimal solutions in an appropriate times.

B3LYP/6-31G, DFT method was applied to hypothetical study the design of six carbon nanotube materials based on [8]circulene, through the use of cyclic polymerization of two and three molecules of [8]circulene. Optimized structures of [8]circulene have saddle-shaped. Design of six carbon nanotubes reactions were done by thermodynamically calculating (Δ S, Δ G and Δ H) and the stability of these hypothetical nanotubes depending on the value of HOMO energy level. Nanotubes obtained have the most efficient gap energy, making them potentially useful for solar cell applications.

In this paper, wireless network is planned; the network is predicated on the IEEE 802.16e standardization by WIMAX. The targets of this paper are coverage maximizing, service and low operational fees. WIMAX is planning through three approaches. In approach one; the WIMAX network coverage is major for extension of cell coverage, the best sites (with Band Width (BW) of 5MHz, 20MHZ per sector and four sectors per each cell). In approach two, Interference analysis in CNIR mode. In approach three of the planning, Quality of Services (QoS) is tested and evaluated. ATDI ICS software (Interference Cancellation System) using to perform styling. it shows results in planning area covered 90.49% of the Baghdad City and used 1000 mob

In this study, iron was coupled with copper to form a bimetallic compound through a biosynthetic method, which was then used as a catalyst in the Fenton-like processes for removing direct Blue 15 dye (DB15) from aqueous solution. Characterization techniques were applied on the resultant nanoparticles such as SEM, BET, EDAX, FT-IR, XRD, and zeta potential. Specifically, the rounded and shaped as spherical nanoparticles were found for green synthesized iron/copper nanoparticles (G-Fe/Cu NPs) with the size ranging from 32-59 nm, and the surface area was 4.452 m2/g. The effect of different experimental factors was studied in both batch and continuous experiments. These factors were H2O2 concentration, G-Fe/CuNPs amount, pH, initial DB15

This article proposes a new strategy based on a hybrid method that combines the gravitational search algorithm (GSA) with the bat algorithm (BAT) to solve a single-objective optimization problem. It first runs GSA, followed by BAT as the second step. The proposed approach relies on a parameter between 0 and 1 to address the problem of falling into local research because the lack of a local search mechanism increases intensity search, whereas diversity remains high and easily falls into the local optimum. The improvement is equivalent to the speed of the original BAT. Access speed is increased for the best solution. All solutions in the population are updated before the end of the operation of the proposed algorithm. The diversification f

Kurdistan power system is expanded along years ago. The electrical power is transmitted through long transmission lines. The main problem of transmission lines is active and reactive power losses. It is important to solve this issue, unless, the most of electrical energy will lost over transmission system. In this study, High Voltage Direct Current links/bipolar connection were connected in a power system to reduce the power losses. The 132kV, 50 Hz, 36 buses Kurdistan power system is used as a study case. The load flow analysis was implemented by using ETAP.16 program in which Newton-Raphson method for three cases. The results show that the losses are reduced after inserted HVDC links.

Traditionally, path selection within routing is formulated as a shortest path optimization problem. The objective function for optimization could be any one variety of parameters such as number of hops, delay, cost...etc. The problem of least cost delay constraint routing is studied in this paper since delay constraint is very common requirement of many multimedia applications and cost minimization captures the need to
distribute the network. So an iterative algorithm is proposed in this paper to solve this problem. It is appeared from the results of applying this algorithm that it gave the optimal path (optimal solution) from among multiple feasible paths (feasible solutions).