Preferred Language
Articles
/
jih-3195
Solving Quadratic Assignment Problem by Using Meta-heuristic Search Method

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 alternatives, and its operating principle is illustrated with a numerical example.

After repeating the solution of each issue (8) once and recording the algorithm results, it showed its agreement, once from a total (375) repetition of the experiment while the number of times the Artificial Bee Colony (ABC) arrived (2) as for the Firefly (FA) Algorithm giving (117), also Genetic (GA) and Particle Swarm (PSO) gives (120) and the Tabu Search algorithm (174). The proposed technique (TSQAP) is shown to yield a superior solution with low computing complexity. MATLAB was used to generate all of the findings (R2020b).

Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Fri Jul 19 2019
Journal Name
Iraqi Journal Of Science
A Comparative Study on Meta-Heuristic Algorithms For Solving the RNP Problem

The continuous increases in the size of current telecommunication infrastructures have led to the many challenges that existing algorithms face in underlying optimization. The unrealistic assumptions and low efficiency of the traditional algorithms make them unable to solve large real-life problems at reasonable times.
The use of approximate optimization techniques, such as adaptive metaheuristic algorithms, has become more prevalent in a diverse research area. In this paper, we proposed the use of a self-adaptive differential evolution (jDE) algorithm to solve the radio network planning (RNP) problem in the context of the upcoming generation 5G. The experimental results prove the jDE with best vecto

... Show More
Scopus (2)
Crossref (1)
Scopus Crossref
View Publication Preview PDF
Publication Date
Wed Dec 26 2018
Journal Name
Iraqi Journal Of Science
New Improved Heuristic Method for Solving Travelling Salesman Problem

In this paper we will investigate some Heuristic methods to solve travelling salesman problem. The discussed methods are Minimizing Distance Method (MDM), Branch and Bound Method (BABM), Tree Type Heuristic Method (TTHM) and Greedy Method (GRM).

The weak points of MDM are manipulated in this paper. The Improved MDM (IMDM) gives better results than classical MDM, and other discussed methods, while the GRM gives best time for 5≤ n ≤500, where n is the number of visited cities.

View Publication Preview PDF
Publication Date
Wed Oct 17 2018
Journal Name
Journal Of Economics And Administrative Sciences
Solve the fuzzy Assignment problem by using the Labeling method

The Assignment model is a mathematical model that aims to express a real problem facing factories and companies which is characterized by the guarantee of its activity in order to make the appropriate decision to get the best allocation of machines or jobs or workers on machines in order to increase efficiency or profits to the highest possible level or reduce costs or time To the extent possible, and in this research has been using the method of labeling to solve the problem of the fuzzy assignment of real data has been approved by the tire factory Diwaniya, where the data included two factors are the factors of efficiency and cost, and was solved manually by a number of iterations until reaching the optimization solution,

... Show More
Crossref
View Publication Preview PDF
Publication Date
Wed Sep 12 2018
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Solving Capacitated Vehicle Routing Problem (CVRP) Using Tabu Search Algorithm (TSA)

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

... Show More
Crossref (3)
Crossref
View Publication Preview PDF
Publication Date
Sat Oct 20 2018
Journal Name
Journal Of Economics And Administrative Sciences
Solve the problem of assignment by using multi-Objective programming

he assignment model represents a mathematical model that aims at expressing an important problem facing enterprises and companies in the public and private sectors, which are characterized by ensuring their activities, in order to take the appropriate decision to get the best allocation of tasks for machines or jobs or workers on the machines that he owns in order to increase profits or reduce costs and time As this model is called multi-objective assignment because it takes into account the factors of time and cost together and hence we have two goals for the assignment problem, so it is not possible to solve by the usual methods and has been resorted to the use of multiple programming The objectives were to solve the problem of

... Show More
Crossref
View Publication Preview PDF
Publication Date
Mon Apr 24 2017
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Solving Linear Boundary Value Problem Using Shooting Continuous Explicit Runge-Kutta Method

  In this paper we shall generalize fifth explicit Runge-Kutta Feldberg(ERKF(5)) and Continuous explicit Runge-Kutta (CERK) method using shooting method to solve second order boundary value problem  which can be reduced to order one.These methods we shall call them as shooting Continuous Explicit Runge-Kutta method, the results are computed using matlab program.

View Publication Preview PDF
Publication Date
Wed May 22 2024
Journal Name
Int. J. Operational Research
Pascal’s triangle graded mean defuzzification approach for solving fuzzy assignment models by using pentagonal fuzzy numbers

The fuzzy assignment models (FAMs) have been explored by various literature to access classical values, which are more precise in our real-life accomplishment. The novelty of this paper contributed positively to a unique application of pentagonal fuzzy numbers for the evaluation of FAMs. The new method namely Pascal’s triangle graded mean (PT-GM) has presented a new algorithm in accessing the critical path to solve the assignment problems (AP) based on the fuzzy objective function of minimising total cost. The results obtained have been compared to the existing methods such as, the centroid formula (CF) and centroid formula integration (CFI). It has been demonstrated that operational efficiency of this conducted method is exquisitely deve

... Show More
View Publication Preview PDF
Publication Date
Wed Jan 01 2020
Journal Name
Periodicals Of Engineering And Natural Sciences
Solving multicollinearity problem of gross domestic product using ridge regression method

This study is dedicated to solving multicollinearity problem for the general linear model by using Ridge regression method. The basic formulation of this method and suggested forms for Ridge parameter is applied to the Gross Domestic Product data in Iraq. This data has normal distribution. The best linear regression model is obtained after solving multicollinearity problem with the suggesting of 10 k value.

Scopus (4)
Scopus
Publication Date
Mon Jun 10 2024
Journal Name
Iraqi Journal For Computer Science And Mathematics
Solving tri-criteria: total completion time, total late work, and maximum earliness by using exact, and heuristic methods on single machine scheduling problem

The presented study investigated the scheduling regarding  jobs on a single machine. Each  job will be processed with no interruptions and becomes available for the processing at time 0. The aim is finding a processing order with regard to jobs, minimizing total completion time , total late work , and maximal tardiness  which is an NP-hard problem. In the theoretical part of the present work, the mathematical formula for the examined problem will be presented, and a sub-problem of the original problem of minimizing the multi-objective functions  is introduced. Also, then the importance regarding the dominance rule (DR) that could be applied to the problem to improve good solutions will be shown. While in the practical part, two

... Show More
Scopus Crossref
View Publication
Publication Date
Wed Sep 01 2021
Journal Name
Baghdad Science Journal
Fuzzy-assignment Model by Using Linguistic Variables

      This work addressed the assignment problem (AP) based on fuzzy costs, where the objective, in this study, is to minimize the cost. A triangular, or trapezoidal, fuzzy numbers were assigned for each fuzzy cost. In addition, the assignment models were applied on linguistic variables which were initially converted to quantitative fuzzy data by using the Yager’sorankingi method. The paper results have showed that the quantitative date have a considerable effect when considered in fuzzy-mathematic models.

Scopus (4)
Crossref (1)
Scopus Clarivate Crossref
View Publication Preview PDF