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

     In this research, an unknown space-dependent force function in the wave equation is studied. This is a natural continuation of [1] and chapter 2 of [2] and [3], where the finite difference method (FDM)/boundary element method (BEM), with the separation of variables method, were considered. Additional data are given by the one end displacement measurement. Moreover, it is a continuation of [3], with exchanging the boundary condition, where  are extra data, by the initial condition. This is an ill-posed inverse force problem for linear hyperbolic equation. Therefore, in order to stabilize the solution, a zeroth-order Tikhonov regularization method is provided. To assess the accuracy, the minimum error between

The purpose of this research paper is to present the second-order homogeneous complex differential equation   , where   , which is defined on the certain complex domain depends on solution behavior. In order to demonstrate  the relationship between the solution of the second-order of the complex differential equation and its coefficient of function, by studying the solution in certain cases: a meromorphic function, a coefficient of function, and if the solution is considered to be a transformation with another complex solution. In addition, the solution has been provided as a power series with some  applications.

     The problem of reconstruction of a timewise dependent coefficient and free boundary at once in a nonlocal diffusion equation under Stefan and heat Flux as nonlocal overdetermination conditions have been considered. A Crank–Nicolson finite difference method (FDM) combined with the trapezoidal rule quadrature is used for the direct problem. While the inverse problem is reformulated as a nonlinear regularized least-square optimization problem with simple bound and solved efficiently by MATLAB subroutine lsqnonlin from the optimization toolbox. Since the problem under investigation is generally ill-posed, a small error in the input data leads to a huge error in the output, then Tikhonov’s regularization technique is app

The Boltzmann equation has been solved using (EEDF) package for a pure sulfur hexafluoride (SF6) gas and its mixtures with buffer Helium (He) gas to study the electron energy distribution function EEDF and then the corresponding transport coefficients for various ratios of SF6 and the mixtures. The calculations are graphically represented and discussed for the sake of comparison between the various mixtures. It is found that the various SF6 – He content mixtures have a considerable effect on EEDF and the transport coefficients of the mixtures

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