تناول البحث حل مشكلة النقل باستخدام مدخل بحوث العملٌات فً مرحلة التحلٌل والتصمٌم لنموذج المشكلة , وتم مقارنة النتائج التً حصلنا علٌها من الحلول لصٌاؼة التحلٌل وبرهنة صحة النموذج المتجه صوب الموضوع, وتم اجراء المقارنة بٌن الحلول المختلفة الختٌار اقل قٌمة لدالة الهدؾ لكً ٌتمكن المستفٌد من صنع القرار, باستخدام الطرق االربعة )طرٌقة الزاوٌة الشمالٌة الؽربٌة, طرٌقة اقل التكالٌؾ, طرٌقة فوجل التقرٌبٌة, الطرٌقة المعدلة )المجموع االقل للتكالٌؾ( ( للحصول على افضل النتائج وقد توصل البحث الى ان الطرٌقة المعدلة المعتمدة من قبل الباحث اعطت افضل نتائج للحل االمثل , وتم اختبار امثلٌة الحل باستخدام طرٌقة التوزٌع المعدلة(Modi (والتً اعطت نتائج افضل بتخفٌض الكلفة الكلٌة
The multiple linear regression model is an important regression model that has attracted many researchers in different fields including applied mathematics, business, medicine, and social sciences , Linear regression models involving a large number of independent variables are poorly performing due to large variation and lead to inaccurate conclusions , One of the most important problems in the regression analysis is the multicollinearity Problem, which is considered one of the most important problems that has become known to many researchers , As well as their effects on the multiple linear regression model, In addition to multicollinearity, the problem of outliers in data is one of the difficulties in constructing the reg
... Show MoreArtificial fish swarm algorithm (AFSA) is one of the critical swarm intelligent algorithms. In this
paper, the authors decide to enhance AFSA via diversity operators (AFSA-DO). The diversity operators will
be producing more diverse solutions for AFSA to obtain reasonable resolutions. AFSA-DO has been used to
solve flexible job shop scheduling problems (FJSSP). However, the FJSSP is a significant problem in the
domain of optimization and operation research. Several research papers dealt with methods of solving this
issue, including forms of intelligence of the swarms. In this paper, a set of FJSSP target samples are tested
employing the improved algorithm to confirm its effectiveness and evaluate its ex
Abstract
This research aim to overcome the problem of dimensionality by using the methods of non-linear regression, which reduces the root of the average square error (RMSE), and is called the method of projection pursuit regression (PPR), which is one of the methods for reducing dimensions that work to overcome the problem of dimensionality (curse of dimensionality), The (PPR) method is a statistical technique that deals with finding the most important projections in multi-dimensional data , and With each finding projection , the data is reduced by linear compounds overall the projection. The process repeated to produce good projections until the best projections are obtained. The main idea of the PPR is to model
... Show MoreAn efficient modification and a novel technique combining the homotopy concept with Adomian decomposition method (ADM) to obtain an accurate analytical solution for Riccati matrix delay differential equation (RMDDE) is introduced in this paper . Both methods are very efficient and effective. The whole integral part of ADM is used instead of the integral part of homotopy technique. The major feature in current technique gives us a large convergence region of iterative approximate solutions .The results acquired by this technique give better approximations for a larger region as well as previously. Finally, the results conducted via suggesting an efficient and easy technique, and may be addressed to other non-linear problems.
In this paper, the proposed phase fitted and amplification fitted of the Runge-Kutta-Fehlberg method were derived on the basis of existing method of 4(5) order to solve ordinary differential equations with oscillatory solutions. The recent method has null phase-lag and zero dissipation properties. The phase-lag or dispersion error is the angle between the real solution and the approximate solution. While the dissipation is the distance of the numerical solution from the basic periodic solution. Many of problems are tested over a long interval, and the numerical results have shown that the present method is more precise than the 4(5) Runge-Kutta-Fehlberg method.
This paper includes the application of Queuing theory with of Particle swarm algorithm or is called (Intelligence swarm) to solve the problem of The queues and developed for General commission for taxes /branch Karkh center in the service stage of the Department of calculators composed of six employees , and it was chosen queuing model is a single-service channel M / M / 1 according to the nature of the circuit work mentioned above and it will be divided according to the letters system for each employee, and it was composed of data collection times (arrival time , service time, departure time)
... Show More
تعد البرمجة الخطية عاملاً مؤثراً وفعالاً في عملية صنع و إتخاذ القرار عندما تكون الموارد متاحة أو متوفرة لكي تعطي أهدافاً معينة ، وتكمن البرمجة الخطية في حل وتقييم الانشطة أو الفعاليات عند تطبيق إحدى أدواتها وهي الطريقة المبسطة العامة ، التي يكون فيها الحل مقبولاً (ممكناً) ويجب التوصل الى الحل الامثل عندها تسمى بالطريقة المبسطة الاولية أو يكون الحل فيها أمثلاً ويجب التوصل الى الحل الم
... Show MoreIn this paper, game theory was used and applied to the transport sector in Iraq, as this sector includes two axes, the public transport axis and the second axis the private transport axis, as each of these axes includes several types of transport, namely (sea transport, air transport, land transport, transport by rail, port transport) and the travel and tourism sector, as public transport lacks this sector, as the competitive advantage matrix for the transport sector was formed and after applying the MinMax-MaxMin principle to the matrix in all its stages, it was found that there was an equilibrium point except for the last stage where the equilibrium point was not available Therefore, the use of the linear programming method was
... Show MoreThe problem of Bi-level programming is to reduce or maximize the function of the target by having another target function within the constraints. This problem has received a great deal of attention in the programming community due to the proliferation of applications and the use of evolutionary algorithms in addressing this kind of problem. Two non-linear bi-level programming methods are used in this paper. The goal is to achieve the optimal solution through the simulation method using the Monte Carlo method using different small and large sample sizes. The research reached the Branch Bound algorithm was preferred in solving the problem of non-linear two-level programming this is because the results were better.