Simulated annealing (SA) has been an effective means that can address difficulties related to optimization problems. is now a common discipline for research with several productive applications such as production planning. Due to the fact that aggregate production planning (APP) is one of the most considerable problems in production planning, in this paper, we present multi-objective linear programming model for APP and optimized by . During the course of optimizing for the APP problem, it uncovered that the capability of was inadequate and its performance was substandard, particularly for a sizable controlled problem with many decision variables and plenty of constraints. Since this algorithm works sequentially then the current state will generate only one in next state that will make the search slower and the drawback is that the search may fall in local minimum which represents the best solution in only part of the solution space. In order to enhance its performance and alleviate the deficiencies in the problem solving, a modified (MD) is proposed. We attempt to augment the search space by starting with solutions, instead of one solution. To analyses and investigate the operations of the MSA with the standard and harmony search (HS), the real performance of an industrial company and simulation are made for evaluation. The results show that, compared to and , offers better quality solutions with regard to convergence and accuracy.
Enhancing quality image fusion was proposed using new algorithms in auto-focus image fusion. The first algorithm is based on determining the standard deviation to combine two images. The second algorithm concentrates on the contrast at edge points and correlation method as the criteria parameter for the resulted image quality. This algorithm considers three blocks with different sizes at the homogenous region and moves it 10 pixels within the same homogenous region. These blocks examine the statistical properties of the block and decide automatically the next step. The resulted combined image is better in the contras
... Show MoreHerein, an efficient inorganic/organic hybrid photocatalyst composed of zeolitic imidazolate framework (ZIF-67) decorated with Cd0.5Zn0.5S solid solution semiconductor was constructed. The properties of prepared ZIF- [email protected] nanocomposite and its components (ZIF-67 and Cd0.5Zn0.5S) were investigated using XRD, FESEM, EDX, TEM, DRS and BET methods. The photocatalytic activity of fabricated [email protected] nanocomposite were measured toward removal of methyl violet (MV) dye as a simulated organic contaminant. Under visible-light and specific conditions (photocatalyst dose 1 g/l, MV dye 10 mg/l, unmodified solution pH 6.7 and reaction time 60 min.), the acquired [email protected] photocatalyst showed advanced photocatalytic activity
... Show MoreThe Research aims to investigate into reality in terms of planning and scheduling management process for sake the implementation and maintenance of irrigation and drainage projects in the Republic of Iraq, with an indication of the most important obstacles that impede the planning and scheduling management process for these projects and ways of addressing them and minimizing their effects. For the purpose of achieving the goal of the research, a sci
... Show MoreIn our article, three iterative methods are performed to solve the nonlinear differential equations that represent the straight and radial fins affected by thermal conductivity. The iterative methods are the Daftardar-Jafari method namely (DJM), Temimi-Ansari method namely (TAM) and Banach contraction method namely (BCM) to get the approximate solutions. For comparison purposes, the numerical solutions were further achieved by using the fourth Runge-Kutta (RK4) method, Euler method and previous analytical methods that available in the literature. Moreover, the convergence of the proposed methods was discussed and proved. In addition, the maximum error remainder values are also evaluated which indicates that the propo
... Show MoreIn 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.
Markov chains are an application of stochastic models in operation research, helping the analysis and optimization of processes with random events and transitions. The method that will be deployed to obtain the transient solution to a Markov chain problem is an important part of this process. The present paper introduces a novel Ordinary Differential Equation (ODE) approach to solve the Markov chain problem. The probability distribution of a continuous-time Markov chain with an infinitesimal generator at a given time is considered, which is a resulting solution of the Chapman-Kolmogorov differential equation. This study presents a one-step second-derivative method with better accuracy in solving the first-order Initial Value Problem
... Show More