The application of the test case prioritization method is a key part of system testing intended to think it through and sort out the issues early in the development stage. Traditional prioritization techniques frequently fail to take into account the complexities of big-scale test suites, growing systems and time constraints, therefore cannot fully fix this problem. The proposed study here will deal with a meta-heuristic hybrid method that focuses on addressing the challenges of the modern time. The strategy utilizes genetic algorithms alongside a black hole as a means to create a smooth tradeoff between exploring numerous possibilities and exploiting the best one. The proposed hybrid algorithm of genetic black hole (HGBH) uses the capabilities of considering the imperatives such as code coverage, fault finding rate and execution time from search algorithms in our hybrid approach to refine test cases considerations repetitively. The strategy accomplished this by putting experiments on a large-scale project of industrial software developed. The hybrid meta-heuristic technique ends up being better than the routine techniques. It helps in higher code coverage, which, in turn, enables to detect crucial defects at an early stage and also to allocate the testing resources in a better way. In particular, the best APFD value was 0.9321, which was achieved in 6 generations with 4.879 seconds the value to which the computer was run. Besides these, , the approach resulted in the mean value of APFD as 0.9247 and 0.9302 seconds which took from 10.509 seconds to 30.372 seconds. The carried out experiment proves the feasibility of this approach in implementing complex systems and consistently detecting the changes, enabling it to adapt to rapidly changing systems. In the end, this research provides us with a new hybrid meta-heuristic way of test case prioritization and optimization, which, in turn, helps to tackle the obstacles caused by large-scale test cases and constantly changing systems.
The paper aims is to solve the problem of choosing the appropriate project from several service projects for the Iraqi Martyrs Foundation or arrange them according to the preference within the targeted criteria. this is done by using Multi-Criteria Decision Method (MCDM), which is the method of Multi-Objective Optimization by Ratios Analysis (MOORA) to measure the composite score of performance that each alternative gets and the maximum benefit accruing to the beneficiary and according to the criteria and weights that are calculated by the Analytic Hierarchy Process (AHP). The most important findings of the research and relying on expert opinion are to choose the second project as the best alternative and make an arrangement acco
... Show More This paper describes the application of consensus optimization for Wireless Sensor Network (WSN) system. Consensus algorithm is usually conducted within a certain number of iterations for a given graph topology. Nevertheless, the best Number of Iterations (NOI) to reach consensus is varied in accordance with any change in number of nodes or other parameters of . graph topology. As a result, a time consuming trial and error procedure will necessary be applied
to obtain best NOI. The implementation of an intellig ent optimization can effectively help to get the optimal NOI. The performance of the consensus algorithm has considerably been improved by the inclusion of Particle Swarm Optimization (PSO). As a case s
Abstract
Much attention has been paid for the use of robot arm in various applications. Therefore, the optimal path finding has a significant role to upgrade and guide the arm movement. The essential function of path planning is to create a path that satisfies the aims of motion including, averting obstacles collision, reducing time interval, decreasing the path traveling cost and satisfying the kinematics constraints. In this paper, the free Cartesian space map of 2-DOF arm is constructed to attain the joints variable at each point without collision. The D*algorithm and Euclidean distance are applied to obtain the exact and estimated distances to the goal respectively. The modified Particle Swarm Optimization al
... Show MoreCommunity detection is an important and interesting topic for better understanding and analyzing complex network structures. Detecting hidden partitions in complex networks is proven to be an NP-hard problem that may not be accurately resolved using traditional methods. So it is solved using evolutionary computation methods and modeled in the literature as an optimization problem. In recent years, many researchers have directed their research efforts toward addressing the problem of community structure detection by developing different algorithms and making use of single-objective optimization methods. In this study, we have continued that research line by improving the Particle Swarm Optimization (PSO) algorithm using a
... Show MoreThe preparation of activated carbon (AC) from date stones by using microwave assisted K2CO3 activation was investigated in this paper. The influence of radiation time, radiation power, and impregnation ratio on the yield and methylene blue (MB) uptake of such carbon were studied. Based on Box-Wilson central composite design, two second order polynomial models were developed to correlate the process variables to the two responses. From the analysis of variance the significant variables on each response were identified. Optimum coditions of 8 min radiation time, 660 W radiation power and 1.5 g/g impregnation ratio gave 460.123 mg/g MB uptake and 19.99 % yield. The characteristics of the AC were examined by pore structure analysis, and scan
... Show MoreThis paper presents an improved technique on Ant Colony Optimization (ACO) algorithm. The procedure is applied on Single Machine with Infinite Bus (SMIB) system with power system stabilizer (PSS) at three different loading regimes. The simulations are made by using MATLAB software. The results show that by using Improved Ant Colony Optimization (IACO) the system will give better performance with less number of iterations as it compared with a previous modification on ACO. In addition, the probability of selecting the arc depends on the best ant performance and the evaporation rate.
We investigated at the optical properties, structural makeup, and morphology of thin films of cadmium telluride (CdTe) with a thickness of 150 nm produced by thermal evaporation over glass. The X-ray diffraction study showed that the films had a crystalline composition, a cubic structure, and a preference for grain formation along the (111) crystallographic direction. The outcomes of the inquiry were used to determine these traits. With the use of thin films of CdTe that were doped with Ag at a concentration of 0.5%, the crystallization orientations of pure CdTe (23.58, 39.02, and 46.22) and CdTe:Ag were both determined by X-ray diffraction. orientations (23.72, 39.21, 46.40) For samples that were pure and those that were doped with
... Show MoreCommunity detection is an important and interesting topic for better understanding and analyzing complex network structures. Detecting hidden partitions in complex networks is proven to be an NP-hard problem that may not be accurately resolved using traditional methods. So it is solved using evolutionary computation methods and modeled in the literature as an optimization problem. In recent years, many researchers have directed their research efforts toward addressing the problem of community structure detection by developing different algorithms and making use of single-objective optimization methods. In this study, we have continued that research line by improving the Particle Swarm Optimization (PSO) algorithm using a local
... Show MoreThe linear segment with parabolic blend (LSPB) trajectory deviates from the specified waypoints. It is restricted to that the acceleration must be sufficiently high. In this work, it is proposed to engage modified LSPB trajectory with particle swarm optimization (PSO) so as to create through points on the trajectory. The assumption of normal LSPB method that parabolic part is centered in time around waypoints is replaced by proposed coefficients for calculating the time duration of the linear part. These coefficients are functions of velocities between through points. The velocities are obtained by PSO so as to force the LSPB trajectory passing exactly through the specified path points. Also, relations for velocity correction and exact v
... Show More This paper concerns with openness concept in contemporary learning environment, which ranges from physical characters to its relation with learning efficiency and its output. Previous literatures differ to clear the effect of openness on the engagement between learner within themselves, and with this kind of spaces. Engagement means: active participation, the ability of making dialogue, self-reflection and the ability to explore and communicate with them and
within learning space. Research roblem was: The lack of knowledge about the effect of Openness on learner engagement with learning spaces. The two concepts were applied on three types of learning spaces in the Department of the Architectu