Kriging, a geostatistical technique, has been used for many years to evaluate groundwater quality. The best estimation data for unsampled points were determined by using this method depending on measured variables for an area. The groundwater contaminants assessment worldwide was found through many kriging methods. The present paper shows a review of the most known methods of kriging that were used in estimating and mapping the groundwater quality. Indicator kriging, simple kriging, cokriging, ordinary kriging, disjunctive kriging and lognormal kriging are the most used techniques. In addition, the concept of the disjunctive kriging method was explained in this work to be easily understood.

Congestion management features operate to control congestion once it occurs. One way that network elements handle an overflow of arriving traffic is to use a queuing algorithm to sort the traffic, and then determine some methods of prioritizing it onto an output link. Each queuing algorithm was designed to solve a specific network traffic problem and has a particular effect on the network performance. The work presented in this thesis deals with important issue that is the quality of service (QoS) techniques, which can be integrated to enhance the operation of the network. The quality of service is the collective effect on service performance, which determines the degree of satisfaction of a user of the service. In this thesis, packet sched

The paper aims to propose Teaching Learning based Optimization (TLBO) algorithm to solve 3-D packing problem in containers. The objective which can be presented in a mathematical model is optimizing the space usage in a container. Besides the interaction effect between students and teacher, this algorithm also observes the learning process between students in the classroom which does not need any control parameters. Thus, TLBO provides the teachers phase and students phase as its main updating process to find the best solution. More precisely, to validate the algorithm effectiveness, it was implemented in three sample cases. There was small data which had 5 size-types of items with 12 units, medium data which had 10 size-types of items w

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

Efficient and cost-effective drilling of directional wells necessitates the implementation of best drilling practices and advanced techniques to optimize drilling operations. Failure to adequately consider drilling risks can result in inefficient drilling operations and non-productive time (NPT). Although advanced drilling techniques may be expensive, they offer promising technical solutions for mitigating drilling risks. This paper aims to demonstrate the effectiveness of advanced drilling techniques in mitigating risks and improving drilling operations when compared to conventional drilling techniques. Specifically, the advanced drilling techniques employed in Buzurgan Oil Field, including vertical drilling with mud motor, managed pres

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