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

The goal of this paper is to expose a new numerical method for solving initial value time-lag of delay differential equations by employing a high order improving formula of Euler method known as third order Euler method. Stability condition is discussed in detail for the proposed technique. Finally some examples are illustrated to verify the validity, efficiency and accuracy of the method.

In this paper, the asymptotic behavior of all solutions of impulsive neutral differential equations with positive and negative coefficients and with impulsive integral term was investigated. Some sufficient conditions were obtained to ensure that all nonoscillatory solutions converge to zero. Illustrative examples were given for the main results.

     In this paper we investigate the stability and asymptotic stability of the zero solution for the first order delay differential equation

     where the delay is variable and by using Banach fixed point theorem. We give new conditions to ensure the stability and asymptotic stability of the zero solution of this equation.

     Game theory problems (GTP) frequently occur in Economy, Business Studies, Sociology, Political Science, Military Activities, and so on are some of the subjects covered. To tackle the uncertainty in Games, the analysis of games in which the payoffs are represented by fuzzy numbers (FN) will benefit from fuzzy set theory (FST).

The purpose of this paper is to develop an efficient technique for solving constraint matrix games (MG) with payoff trapezoidal fuzzy numbers (TFN). The description of the new ranking method is introduced for a constrained matrix with TFN and values. Stock market forecasting has been one of the most important research areas for decades. Stock market values are volatile, non-linear, complicated and ch

     In this paper, the Adomian decomposition method (ADM) is successfully applied to find the approximate solutions for the system of fuzzy Fredholm integral equations (SFFIEs) and we also study the convergence of the technique. A consistent way to reduce the size of the computation is given to reach the exact solution. One of the best methods adopted to determine the behavior of the approximate solutions. Finally, the problems that have been addressed confirm the validity of the method  applied in this research using a comparison by combining numerical methods such as the Trapezoidal rule and Simpson rule with ADM.

In this paper, the series solutions of a non-linear delay integral equations are considered by a modified approach of homotopy analysis method (MAHAM). We split the function   into infinite sums. The outcomes of the illustrated examples are included to confirm the accuracy and efficiency of the MAHAM. The exact solution can be obtained using special values of the convergence parameter.

This article proposes a new strategy based on a hybrid method that combines the gravitational search algorithm (GSA) with the bat algorithm (BAT) to solve a single-objective optimization problem. It first runs GSA, followed by BAT as the second step. The proposed approach relies on a parameter between 0 and 1 to address the problem of falling into local research because the lack of a local search mechanism increases intensity search, whereas diversity remains high and easily falls into the local optimum. The improvement is equivalent to the speed of the original BAT. Access speed is increased for the best solution. All solutions in the population are updated before the end of the operation of the proposed algorithm. The diversification f

Aggregate production planning (APP) is one of the most significant and complicated problems in production planning and aim to set overall production levels for each product category to meet fluctuating or uncertain demand in future. and to set decision concerning hiring, firing, overtime, subcontract, carrying inventory level. In this paper, we present a simulated annealing (SA) for multi-objective linear programming to solve APP. SA is considered to be a good tool for imprecise optimization problems. The proposed model minimizes total production and workforce costs. In this study, the proposed SA is compared with particle swarm optimization (PSO). The results show that the proposed SA is effective in reducing total production costs and req

It is known that life is as series of variety of difficult problems that individual looks
forward to overcome so as to achieve adaptation and to reach the desired aims .The transition
of the students from the school stage to the stage of the university is actually regarded a
dramatic change where students face when they enter university life that differs from what
they lived in secondary school.
The executive functions are considered the main element that participate in solving the
problems of high orders , because it involves the mental abilities that assist individual to
think and initiative as well as solving problems .
These functions include operational planning and the activated memory and inhibition of
q