Islamic Azad University, Rasht BranchIranian Journal of Optimization2588-572302120090401WELL- POSEDNESS OF THE ROTHE DIFFERENCE SCHEME FOR REVERSE PARABOLIC EQUATIONS107131513242ENAllaberen AshyralyevDepartment of Mathematics, Fatih University, Istanbul,34500, TurkeyAyfer DuralGaziosman Paşa Lisesi Istanbul, TurkeyYaşar SözenDepartment of Mathematics, Fatih University, Istanbul,34500, TurkeyJournal Article20150807Islamic Azad University, Rasht BranchIranian Journal of Optimization2588-572302120090701A NOTE ON THE AVERAGING METHOD FOR DIFFERENTIAL EQUATIONS WITH MAXIMA132140513243ENVictor A.PlotnikovDepartment of Optimal Control and Economic Cybernetics Odessa National I.I. Mechnikov University Dvoryanskaya str., 2, Odessa, 65026, UkraineOlga D.KichmarenkoDepartment of Optimal Control and Economic Cybernetics Odessa National I.I. Mechnikov University Dvoryanskaya str., 2, Odessa, 65026, UkraineJournal Article20090507<span>Substantiation of the averaging method for differential equations with maxima is presented. Two theorems on substantiates for differential equations with maxima are established.</span>Islamic Azad University, Rasht BranchIranian Journal of Optimization2588-572302120090701COMPARING NUMERICAL METHODS FOR THE SOLUTION OF THE DAMPED FORCED OSCILLATOR PROBLEM141150513244ENA. R. VahidiDepartment of Mathematics, Shahr-e-Rey Branch, Islamic Azad UniversityGH. Asadi CordshooliDepartment of Physics, Shahr-e-Rey Branch, Islamic Azad UniversityZ. AzimzadehDepartment of Mathematics, Science and Research Branch, Islamic Azad UniversityJournal Article20090403<span>In this paper, we present a comparative study between the Adomian decomposition method and two classical well-known Runge-Kutta and central difference methods for the solution of damped forced oscillator problem. We show that the Adomian decomposition method for this problem gives more accurate approximations relative to other numerical methods and is easier to apply. </span>Islamic Azad University, Rasht BranchIranian Journal of Optimization2588-572302120090701INTEGRATING CASE-BASED REASONING, KNOWLEDGE-BASED APPROACH AND TSP ALGORITHM FOR MINIMUM TOUR FINDING151161513245ENHossein ErfaniDepartment of computer Lahijan I.A.U.Journal Article20090507<span>Imagine you have traveled to an unfamiliar city. Before you start your daily tour around the city, you need to know a good route. In Network Theory (NT), this is the traveling salesman problem (TSP). A dynamic programming algorithm is often used for solving this problem. However, when the road network of the city is very complicated and dense, which is usually the case, it will take too long for the algorithm to find the shortest path. Furthermore, in reality, things are not as simple as those stated in AT. For instance, the cost of travel for the same part of the city at different times may not be the same. In this project, we have integrated TSP algorithm with AI knowledge-based approach and case-based reasoning in solving the problem. With this integration, knowledge about the geographical information and past cases are used to help TSP algorithm in finding a solution. This approach dramatically reduces the computation time required for minimum tour finding.</span>