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 Wang-Ball polynomials operational matrices of the derivatives are used in this study to solve singular perturbed second-order differential equations (SPSODEs) with boundary conditions. Using the matrix of Wang-Ball polynomials, the main singular perturbation problem is converted into linear algebraic equation systems. The coefficients of the required approximate solution are obtained from the solution of this system. The residual correction approach was also used to improve an error, and the results were compared to other reported numerical methods. Several examples are used to illustrate both the reliability and usefulness of the Wang-Ball operational matrices. The Wang Ball approach has the ability to improve the outcomes by minimi
... Show MoreNurse scheduling problem is one of combinatorial optimization problems and it is one of NP-Hard problems which is difficult to be solved as optimal solution. In this paper, we had created an proposed algorithm which it is hybrid simulated annealing algorithm to solve nurse scheduling problem, developed the simulated annealing algorithm and Genetic algorithm. We can note that the proposed algorithm (Hybrid simulated Annealing Algorithm(GS-h)) is the best method among other methods which it is used in this paper because it satisfied minimum average of the total cost and maximum number of Solved , Best and Optimal problems. So we can note that the ratios of the optimal solution are 77% for the proposed algorithm(GS-h), 28.75% for Si
... Show MoreThis paper develops a fuzzy multi-objective model for solving aggregate production planning problems that contain multiple products and multiple periods in uncertain environments. We seek to minimize total production cost and total labor cost. We adopted a new method that utilizes a Zimmermans approach to determine the tolerance and aspiration levels. The actual performance of an industrial company was used to prove the feasibility of the proposed model. The proposed model shows that the method is useful, generalizable, and can be applied to APP problems with other parameters.
Professional learning societies (PLS) are a systematic method for improving teaching and learning performance through designing and building professional learning societies. This leads to overcoming a culture of isolation and fragmenting the work of educational supervisors. Many studies show that constructing and developing strong professional learning societies - focused on improving education, curriculum and evaluation will lead to increased cooperation and participation of educational supervisors and teachers, as well as increases the application of effective educational practices in the classroom.
The roles of the educational supervisor to ensure the best and optimal implementation and activation of professional learning soci
... Show MoreIn this paper we find the exact solution of Burger's equation after reducing it to Bernoulli equation. We compare this solution with that given by Kaya where he used Adomian decomposition method, the solution given by chakrone where he used the Variation iteration method (VIM)and the solution given by Eq(5)in the paper of M. Javidi. We notice that our solution is better than their solutions.
Scheduling Timetables for courses in the big departments in the universities is a very hard problem and is often be solved by many previous works although results are partially optimal. This work implements the principle of an evolutionary algorithm by using genetic theories to solve the timetabling problem to get a random and full optimal timetable with the ability to generate a multi-solution timetable for each stage in the collage. The major idea is to generate course timetables automatically while discovering the area of constraints to get an optimal and flexible schedule with no redundancy through the change of a viable course timetable. The main contribution in this work is indicated by increasing the flexibility of generating opti
... Show MoreIn this paper, a new procedure is introduced to estimate the solution for the three-point boundary value problem which is instituted on the use of Morgan-Voyce polynomial. In the beginning, Morgan-Voyce polynomial along with their important properties is introduced. Next, this polynomial with aid of the collocation method utilized to modify the differential equation with boundary conditions to the algebraic system. Finally, the examples approve the validity and accuracy of the proposed method.
The logistic regression model is an important statistical model showing the relationship between the binary variable and the explanatory variables. The large number of explanations that are usually used to illustrate the response led to the emergence of the problem of linear multiplicity between the explanatory variables that make estimating the parameters of the model not accurate.
... Show More