While analytical solutions to Quadratic Assignment Problems (QAP) have indeed been since a long time, the expanding use of Evolutionary Algorithms (EAs) for similar issues gives a framework for dealing with QAP with an extraordinarily broad scope. The study's key contribution is that it normalizes all of the criteria into a single scale, regardless of their measurement systems or the requirements of minimum or maximum, relieving the researchers of the exhaustively quantifying the quality criteria. A tabu search algorithm for quadratic assignment problems (TSQAP) is proposed, which combines the limitations of tabu search with a discrete assignment problem. The effectiveness of the proposed technique has been compared to well-established a

     Solving problems via artificial intelligence techniques has widely prevailed in different aspects. Implementing artificial intelligence optimization algorithms for NP-hard problems is still challenging. In this manuscript, we work on implementing the Naked Mole-Rat Algorithm (NMRA) to solve the n-queens problems and overcome the challenge of applying NMRA to a discrete space set. An improvement of NMRA is applied using the aspect of local search in the Variable Neighborhood Search algorithm (VNS) with 2-opt and 3-opt. Introducing the Naked Mole Rat algorithm based on variable neighborhood search (NMRAVNS) to solve N-queens problems with different sizes. Finding the best solution or set of solutions within a plausible amount of t

In this paper, two new simple, fast and efficient block matching algorithms are introduced, both methods begins blocks matching process from the image center block and moves across the blocks toward image boundaries. With each block, its motion vector is initialized using linear prediction that depending on the motion vectors of its neighbor blocks that are already scanned and their motion vectors are assessed. Also, a hybrid mechanism is introduced, it depends on mixing the proposed two predictive mechanisms with Exhaustive Search (ES) mechanism in order to gain matching accuracy near or similar to ES but with Search Time ST less than 80% of the ES. Also, it offers more control capability to reduce the search errors. The experimental tests

Establishing complete and reliable coverage for a long time-span is a crucial issue in densely surveillance wireless sensor networks (WSNs). Many scheduling algorithms have been proposed to model the problem as a maximum disjoint set covers (DSC) problem. The goal of DSC based algorithms is to schedule sensors into several disjoint subsets. One subset is assigned to be active, whereas, all remaining subsets are set to sleep. An extension to the maximum disjoint set covers problem has also been addressed in literature to allow for more advance sensors to adjust their sensing range. The problem, then, is extended to finding maximum number of overlapped set covers. Unlike all related works which concern with the disc sensing model, the cont

This paper investigates the capacitated vehicle routing problem (CVRP) as it is one of the numerous issues that have no impeccable solutions yet. Numerous scientists in the recent couple of decades have set up various explores and utilized numerous strategies with various methods to deal with it. However, for all researches, finding the least cost is exceptionally complicated. In any case, they have figured out how to think of rough solutions that vary in efficiencies relying upon the search space. Furthermore, tabu search (TS) is utilized to resolve this issue as it is fit for solving numerous complicated issues. The algorithm has been adjusted to resolve the exploration issue, where its methodology is not quite the same as the normal a

One of the most important and common problems in petroleum engineering; reservoir, and production engineering is coning; either water or gas coning. Almost 75% of the drilled wells worldwide contains this problem, and in Iraq water coning problem is much wider than the gas coning problem thus in this paper we try to clarify most of the reasons causing water coning and some of applicable solutions to avoid it using the simulation program (CMG Builder) to build a single well model considering an Iraqi well in north of Iraq black oil field with a bottom water drive, Coning was decreased by 57% by dividing into sub-layers (8) layers rather than (4) layers, also it was decreased (Coning) by 45% when perforation numbers and positions was chang

      During the last few decades, many academic and professional groups gave attention to adopting the multi-criteria decision-making methods in a variety of contexts for decision-making that are given to the diversity and sophistication of their selections. Five different classification methods are tested and assessed in this paper. Each has its own set of five attribute selection approaches. By using the multi-criteria decision-making procedures, these data can be used to rate options. Technique for order of preference by similarity to ideal solution (TOPSIS) is designed utilizing a modified fuzzy analytic hierarchy process (MFAHP) to compute the weight alternatives for TOPSIS in order to obtain the confidence value of each class

    Text categorization refers to the process of grouping text or documents into classes or categories according to their content. Text categorization process consists of three phases which are: preprocessing, feature extraction and classification. In comparison to the English language, just few studies have been done to categorize and classify the Arabic language. For a variety of applications, such as text classification and clustering, Arabic text representation is a difficult task because Arabic language is noted for its richness, diversity, and complicated morphology. This paper presents a comprehensive analysis and a comparison for researchers in the last five years based on the dataset, year, algorithms and the accu

Achieving energy-efficient Wireless Sensor Network (WSN) that monitors all targets at
all times is an essential challenge facing many large-scale surveillance applications.Singleobjective
set cover problem (SCP) is a well-known NP-hard optimization problem used to
set a minimum set of active sensors that efficiently cover all the targeted area. Realizing
that designing energy-efficient WSN and providing reliable coverage are in conflict with
each other, a multi-objective optimization tool is a strong choice for providing a set of
approximate Pareto optimal solutions (i.e., Pareto Front) that come up with tradeoff
between these two objectives. Thus, in the context of WSNs design problem, our main
contribution is to