The study investigated the behaviour of asphalt concrete mixes for aggregate gradations, according to the Iraqi specification using the Bailey method designed by an Excel spreadsheet. In mixing aggregates with varying gradations (coarse and fine aggregate), The Bailey method is a systematic methodology that offers aggregate interlocking as the backbone of the framework and a controlled gradation to complete the blends. Six types of gradation are used according to the bailey method considered in this study. Two-course prepared Asphalt Concrete Wearing and Asphalt Concrete binder, the Nominal Maximum Aggregate Sizes (NMAS) of the mixtures are 19 and 12.5 mm, respectively. The total number of specimens was 240 for both layers (15 samp

In the past two decades, maritime transport traffic has increased, especially in the case of container flow. The BAP (Berth Allocation Problem) (BAP) is a main problem to optimize the port terminals. The current manuscript explains the DBAP problems in a typical arrangement that varies from the conventional separate design station, where each berth can simultaneously accommodate several ships when their entire length is less or equal to length. Be a pier, serve. This problem was then solved by crossing the Red Colobuses Monkey Optimization (RCM) with the Genetic Algorithm (GA). In conclusion, the comparison and the computational experiments are approached to demonstrate the effectiveness of the proposed method contrasted with other

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

To ensure that a software/hardware product is of sufficient quality and functionality, it is essential to conduct thorough testing and evaluations of the numerous individual software components that make up the application. Many different approaches exist for testing software, including combinatorial testing and covering arrays. Because of the difficulty of dealing with difficulties like a two-way combinatorial explosion, this brings up yet another problem: time. Using client-server architectures, this research introduces a parallel implementation of the TWGH algorithm. Many studies have been conducted to demonstrate the efficiency of this technique. The findings of this experiment were used to determine the increase in speed and co

Bioavailability is the objective for an optimum formulation. The target of the analysis is to maximize both the fluidity and disintegration profile of class II weakly compounds that are water-soluble. Anti-dyslipidemia drug rosuvastatin calcium (RC) (bioavailability 20%) through formulating as nanofibers (NFs) using electrospinning (ES) technology. Twenty formulas were prepared, and different polymers and polymer combinations with various concentrations were used such as polyethylene oxide (PEO) polyvinyl pyrrolidine (PVPK-30), and hydroxypropyl methylcellulose (HPMC). Three distinct groups of maximum parameters, including polymeric solution, electrospinning method, and ambient parameter, are capable of influencing the creation alon

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).

Accurate and correct price prediction of gold is significant to maintain the stability and fair operation of gold markets as well as the efficiency and proper functioning of financial markets related to gold trading. Gold prices have a long history of non-linear and non-stationary behavior that generates highly complex datasets which are very difficult to forecast with high accuracy and reliability. At the same time Support Vector Regression (SVR) has been utilized as a robust information for prediction not only gold prices but also overall metal price movements. First, the predictive capability of SVR is highly sensitive to hyperparameter selection which needs to be thoroughly tuned and optimized for potentially optimal performance. Theref