Preferred Language
Articles
/
ijs-2980
Using Multi-Objective Bat Algorithm for Solving Multi-Objective Non-linear Programming Problem

Human beings are greatly inspired by nature. Nature has the ability to solve very complex problems in its own distinctive way. The problems around us are becoming more and more complex in the real time and at the same instance our mother nature is guiding us to solve these natural problems. Nature gives some of the logical and effective ways to find solutions to these problems. Nature acts as an optimized source for solving the complex problems.  Decomposition is a basic strategy in traditional multi-objective optimization. However, it has not yet been widely used in multi-objective evolutionary optimization.   

Although computational strategies for taking care of Multi-objective Optimization Problems (MOPs) have been accessible for a long time, the ongoing utilization of Evolutionary Algorithm (EAs) to such issues gives a vehicle to tackle extremely enormous scope MOPs.

MOBATD is a multi-objective bat algorithm that incorporates the dominance concept with the decomposition approach. Whilst decomposition simplifies the MOP by rewriting it as a set of Tchebycheff Approach, solving these problems simultaneously, within the BAT framework, might lead to premature convergence because of the leader selection process which uses the Tchebycheff Approach as a criterion. Dominance plays a major role in building the leaders archive, allowing the selected leaders to cover less dense regions while avoiding local optima and resulting in a more diverse approximated Pareto front. The results from 5 standard MOPs show that the MOBATD outperforms some developmental methods based on decomposition. All the results were achieved by MATLAB (R2017b).

Scopus Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Sat May 01 2021
Journal Name
Journal Of Physics: Conference Series
Publication Date
Tue Nov 30 2021
Journal Name
Iraqi Journal Of Science
The Galerkin-Implicit Method for Solving Nonlinear Variable Coefficients Hyperbolic Boundary Value Problem

This paper has the interest of finding the approximate solution (APPS) of a nonlinear variable coefficients hyperbolic boundary value problem (NOLVCHBVP).  The given boundary value problem is written in its discrete weak form (WEFM) and proved  have a unique solution, which is obtained via the mixed Galerkin finite element with implicit method that reduces the problem to solve the Galerkin nonlinear algebraic system  (GNAS). In this part, the predictor and the corrector techniques (PT and CT, respectively) are proved at first convergence and then are used to transform  the obtained GNAS to a linear GLAS . Then the GLAS is solved using the Cholesky method (ChMe). The stability and the convergence of the method are stud

... Show More
Scopus (1)
Scopus Crossref
View Publication Preview PDF
Publication Date
Tue Sep 08 2020
Journal Name
Baghdad Science Journal
A Proposed Analytical Method for Solving Fuzzy Linear Initial Value Problems

     In this article, we aim to define a universal set consisting of the subscripts of the fuzzy differential equation (5) except the two elements  and , subsets of that universal set are defined according to certain conditions. Then, we use the constructed universal set with its subsets for suggesting an analytical method which facilitates solving fuzzy initial value problems of any order by using the strongly generalized H-differentiability. Also, valid sets with graphs for solutions of fuzzy initial value problems of higher orders are found.

Scopus Clarivate Crossref
View Publication Preview PDF
Publication Date
Tue Mar 01 2011
Journal Name
Journal Of Economics And Administrative Sciences
Laplace Distribution And Probabilistic (bi) In Linear Programming Model

The theory of probabilistic programming  may be conceived in several different ways. As a method of programming it analyses the implications of probabilistic variations in the parameter space of linear or nonlinear programming model. The generating mechanism of such probabilistic variations in the economic models may be due to incomplete information about changes in demand, pro­duction and technology, specification errors about the econometric relations presumed for different economic agents, uncertainty of various sorts and the consequences of imperfect aggregation or disaggregating of economic variables. In this Research we discuss the probabilistic programming problem when the coefficient bi is random variable

... Show More
Crossref
View Publication Preview PDF
Publication Date
Thu Nov 30 2023
Journal Name
Iraqi Journal Of Science
Efficient Algorithm for Solving Fuzzy Singularly Perturbed Volterra Integro-Differential Equation

     In this paper, we design a fuzzy neural network to solve fuzzy singularly perturbed Volterra integro-differential equation by using a High Performance Training Algorithm such as the Levenberge-Marqaurdt (TrianLM) and the sigmoid function of the hidden units which is the hyperbolic tangent activation function. A fuzzy trial solution to fuzzy singularly perturbed Volterra integro-differential equation is written as a sum of two components. The first component meets the fuzzy requirements, however, it does not have any fuzzy adjustable parameters. The second component is a feed-forward fuzzy neural network with fuzzy adjustable parameters. The proposed method is compared with the analytical solutions. We find that the proposed meth

... Show More
Scopus Crossref
View Publication Preview PDF
Publication Date
Sat May 01 2021
Journal Name
Journal Of Physics: Conference Series
Three Weighted Residuals Methods for Solving the Nonlinear Thin Film Flow Problem
Abstract<p>In this paper, the methods of weighted residuals: Collocation Method (CM), Least Squares Method (LSM) and Galerkin Method (GM) are used to solve the thin film flow (TFF) equation. The weighted residual methods were implemented to get an approximate solution to the TFF equation. The accuracy of the obtained results is checked by calculating the maximum error remainder functions (MER). Moreover, the outcomes were examined in comparison with the 4<sup>th</sup>-order Runge-Kutta method (RK4) and good agreements have been achieved. All the evaluations have been successfully implemented by using the computer system Mathematica®10.</p>
Crossref (1)
Crossref
View Publication
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
Tue Jun 30 2015
Journal Name
College Of Islamic Sciences
The Logic of Freezers and Animals in the Holy Quran: (Objective study

The Logic of Freezers and Animals in the Holy Quran

View Publication Preview PDF
Publication Date
Tue May 30 2023
Journal Name
Iraqi Journal Of Science
Fast 128-bit Multi-Pass Stream Ciphering Method

      Information is an essential and valuable object in all systems. The more information you have about your issue, the better you can conform to the world around you. Moreover, information recognizes companies and provides influence that helps one company be more effective than another. So, protecting this information using better security controls and providing a high level of access to authorized parties becomes an urgent need. As a result, many algorithms and encryption techniques have been developed to provide a high level of protection for system information. Therefore, this paper presents an enhancement to the Blowfish algorithm as one of the cryptography techniques. Then it proposes an enhancement for increasing efficiency

... Show More
Scopus (1)
Scopus Crossref
View Publication Preview PDF
Publication Date
Sat Jun 01 2013
Journal Name
Engineering And Technology Journal
Performance Improvement of Multi-UserMC-CDMA system Using Discrete Hartly Transform Mapper

Future wireless communication systems must be able to accommodate a large number of users and simultaneously to provide the high data rates at the required quality of service. In this paper a method is proposed to perform the N-Discrete Hartley Transform (N-DHT) mapper, which are equivalent to 4-Quadrature Amplitude Modulation (QAM), 16-QAM, 64-QAM, 256-QAM, … etc. in spectral efficiency. The N-DHT mapper is chosen in the Multi Carrier Code Division Multiple Access (MC-CDMA) structure to serve as a data mapper instead of the conventional data mapping techniques like QPSK and QAM schemes. The proposed system is simulated using MATLAB and compared with conventional MC-CDMA for Additive White Gaussian Noise, flat, and multi-path selective fa

... Show More
Crossref
View Publication Preview PDF