eng
Islamic Azad University, Rasht Branch
Iranian Journal of Optimization
2588-5723
2008-5427
2009-04-01
02
1
107
131
513242
مقاله پژوهشی
WELL- POSEDNESS OF THE ROTHE DIFFERENCE SCHEME FOR REVERSE PARABOLIC EQUATIONS
Allaberen Ashyralyev
aashyralyev@fatih.edu.tr
1
Ayfer Dural
2
Yaşar Sözen
ysozen@fatih.edu.tr
3
Department of Mathematics, Fatih University, Istanbul,34500, Turkey
Gaziosman Paşa Lisesi Istanbul, Turkey
Department of Mathematics, Fatih University, Istanbul,34500, Turkey
http://ijo.iaurasht.ac.ir/article_513242_b696c46c223d5893189894ebd386e2a2.pdf
eng
Islamic Azad University, Rasht Branch
Iranian Journal of Optimization
2588-5723
2008-5427
2009-07-01
02
1
132
140
513243
یادداشت تکنیکی
A NOTE ON THE AVERAGING METHOD FOR DIFFERENTIAL EQUATIONS WITH MAXIMA
Victor Plotnikov
1
Olga Kichmarenko
olga.kichmarenko@gmail.com
2
Department of Optimal Control and Economic Cybernetics Odessa National I.I. Mechnikov University Dvoryanskaya str., 2, Odessa, 65026, Ukraine
Department of Optimal Control and Economic Cybernetics Odessa National I.I. Mechnikov University Dvoryanskaya str., 2, Odessa, 65026, Ukraine
<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>
http://ijo.iaurasht.ac.ir/article_513243_5f3c8ae8ea9dc142b1dc6d4d96b4a7fb.pdf
averaging method
DIFFERENTIAL EQUATIONS WITH DELAY
DIFFERENTIAL EQUATIONS WITH MAXIMA
AUTOMATIC REGULATION
eng
Islamic Azad University, Rasht Branch
Iranian Journal of Optimization
2588-5723
2008-5427
2009-07-01
02
1
141
150
513244
مقاله پژوهشی
COMPARING NUMERICAL METHODS FOR THE SOLUTION OF THE DAMPED FORCED OSCILLATOR PROBLEM
A. R. Vahidi
alrevahidi@yahoo.com
1
GH. Asadi Cordshooli
2
Z. Azimzadeh
3
Department of Mathematics, Shahr-e-Rey Branch, Islamic Azad University
Department of Physics, Shahr-e-Rey Branch, Islamic Azad University
Department of Mathematics, Science and Research Branch, Islamic Azad University
<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>
http://ijo.iaurasht.ac.ir/article_513244_30c8e012f97a5925f518417591ecc74f.pdf
Adomian decomposition method
Differential equation
damped forced oscillator
eng
Islamic Azad University, Rasht Branch
Iranian Journal of Optimization
2588-5723
2008-5427
2009-07-01
02
1
151
161
513245
مقاله پژوهشی
INTEGRATING CASE-BASED REASONING, KNOWLEDGE-BASED APPROACH AND TSP ALGORITHM FOR MINIMUM TOUR FINDING
Hossein Erfani
herfani@gmail.com
1
Department of computer Lahijan I.A.U.
<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>
http://ijo.iaurasht.ac.ir/article_513245_3c4d2bff5986f79d2b7094d0cd0a9317.pdf
CASE-BASED REASONING
KNOWLEDGE-BASED APPROACH
Traveling salesman problem
CASE-BASED TOUR FINDER
KNOWLEDGE-BASED ROUTE FINDER
Geographical Information