Today’s academics have a major hurdle in solving combinatorial problems in the actual world. It is nevertheless possible to use optimization techniques to find, design, and solve a genuine optimal solution to a particular problem, despite the limitations of the applied approach. A surge in interest in population-based optimization methodologies has spawned a plethora of new and improved approaches to a wide range of engineering problems. Optimizing test suites is a combinatorial testing challenge that has been demonstrated to be an extremely difficult combinatorial optimization limitation of the research. The authors have proposed an almost infallible method for selecting combinatorial test cases. It uses a hybrid whale–gray wol

<p>In combinatorial testing development, the fabrication of covering arrays is the key challenge by the multiple aspects that influence it. A wide range of combinatorial problems can be solved using metaheuristic and greedy techniques. Combining the greedy technique utilizing a metaheuristic search technique like hill climbing (HC), can produce feasible results for combinatorial tests. Methods based on metaheuristics are used to deal with tuples that may be left after redundancy using greedy strategies; then the result utilization is assured to be near-optimal using a metaheuristic algorithm. As a result, the use of both greedy and HC algorithms in a single test generation system is a good candidate if constructed correctly. T

Traffic management at road intersections is a complex requirement that has been an important topic of research and discussion. Solutions have been primarily focused on using vehicular ad hoc networks (VANETs). Key issues in VANETs are high mobility, restriction of road setup, frequent topology variations, failed network links, and timely communication of data, which make the routing of packets to a particular destination problematic. To address these issues, a new dependable routing algorithm is proposed, which utilizes a wireless communication system between vehicles in urban vehicular networks. This routing is position-based, known as the maximum distance on-demand routing algorithm (MDORA). It aims to find an optimal route on a hop-by-ho

The distribution of the intensity of the comet Ison C/2013 is studied by taking its histogram. This distribution reveals four distinct regions that related to the background, tail, coma and nucleus. One dimensional temperature distribution fitting is achieved by using two mathematical equations that related to the coordinate of the center of the comet. The quiver plot of the gradient of the comet shows very clearly that arrows headed towards the maximum intensity of the comet.

This work was conducted to study the extraction of eucalyptus oil from natural plants (Eucalyptus camadulensis leaves) by organic solvents. the effects of the main operating parameters were studied; type of solvent (n-hexane and ethanol), time to reach equilibrium, the temperature (45°C to 65°C) for n-hexane and (45°C to 75°C) for ethanol, solvent to solid ratio (5:1 to 8:1 (v/w)), agitation speed (0 to 900 rpm) and the particle size (0.5 to 2.5 cm) of fresh leaves to find the best processing conditions for the achieving maximum oil yield. The concentration of eucalyptus oil in solvent was measured by using UV-spectrophotometer. The results (for n-hexane) showed that the agitation speed of 900 rpm, temperature 65°C with solvent to soli

The present study examines the extraction of lead (Pb), cadmium (Cd) and nickel (Ni) from   a contaminated soil by washing process. Ethylenediaminetetraacetic acid disodium salt (Na₂EDTA) and hydrochloric acid (HCl) solution were used as extractants.  Soil washing is one of the most suitable in-situ/ ex-situ remediation method in removing heavy metals. Soil was artificially contaminated with 500 mg/kg (Pb , Cd and Ni ).  A set of batch experiments were carried out at different conditions of  extractant concentration , contact time, pH and agitation speed. The results  showed  that the  maximum removal efficiencies  of (Cd, Pb  and Ni ) were (97, 88 and 24 )&nbs

The problem of Bi-level programming is to reduce or maximize the function of the target by having another target function within the constraints. This problem has received a great deal of attention in the programming community due to the proliferation of applications and the use of evolutionary algorithms in addressing this kind of problem. Two non-linear bi-level programming methods are used in this paper. The goal is to achieve the optimal solution through the simulation method using the Monte Carlo method using different small and large sample sizes. The research reached the Branch Bound algorithm was preferred in solving the problem of non-linear two-level programming this is because the results were better.

Table tennis is considered one of the fast base sports that the player needs to have the speed of performance and awareness, especially in straight forward and back strikes, which is an important offensive skills, and the player success depends on his perception speed to the point of the fall of the ball in the arena of his competitor. But there is no way to measure cognitive processing speed. Therefore, the researchers sought to design a test that measures this ability to ensure its scientific evaluation, and then establish standard scores for this test for the players of the specialized school of table tennis, to help evaluate them objectively and move away from subjective estimates when evaluating and developing measuring instruments in