In this paper, we introduce and consider a new system of extended general variational inclusions involving eight different operators. Using the resolvent operator techniques, we show that the new system of extended general variational inclusions is equivalent to the fixed point problem. We prove the strong convergence of some new explicit iterative parallel algorithms using resolvent methods un...

In this paper, we prove some strong convergence results for a family of three generalized strongly Φ-pseudocontractive (accretive) mappings in Banach spaces. Our results are generalizations and improvements of convergence results obtained by several authors in literature. In particular, they generalize and improve the results of Olaleru and Mogbademu [17], Xue and Fan [22] which is in turn a co...

In this paper, we introduce a modified variational iteration method for second order initial value problems by transforming the integral of iteration process. The main advantages of this modification are that it can overcome the restriction of the form of nonlinearity term in differential equations and improve the iterative speed of conventional variational iteration method. The method is appli...

In this paper, a Van der Pol oscillator containing a periodic oscillator is considered. A simple and effective iteration procedure to search the solution of the modified Van der Pol oscillator equation is proposed. This procedure is a powerful tool for determination of periodic solution of a non-linear equation of motion. The solutions obtained using the present iteration procedure are in good ...

Analyzing the nonlinear vibration of beams is one of the important issues in structural engineering. According to this, an impressive analytical method which is called Modified Iteration Perturbation Method (MIPM) is used to obtain the behavior and frequency of a cantilever beam with geometric nonlinear. This new method is combined by the Mickens and Iteration methods. Moreover, this method don...

This article may be used for research, teaching, and private study purposes. Any substantial or systematic reproduction, redistribution, reselling, loan, sub-licensing, systematic supply, or distribution in any form to anyone is expressly forbidden. The publisher does not give any warranty express or implied or make any representation that the contents will be complete or accurate or up to date...

the multiple traveling salesman problem (mtsp) involves scheduling m > 1 salesmen to visit a set of n > m nodes so that each node is visited exactly once. the objective is to minimize the total distance traveled by all the salesmen. the mtsp is an example of combinatorial optimization problems, and has a multiplicity of applications, mostly in the areas of routing and scheduling. in this paper,...