نتایج جستجو برای: but approximate solution could be found by heuristic algorithm
تعداد نتایج: 9392687 فیلتر نتایج به سال:
the aim of conducting this study was to investigate the foreign language learning needs of undergraduate economics students and business management students in faculties of social sciences of alzahra and azad naragh university. in the study, which was designed on the basis of a qualitative-quantitative basis using interviews and questionnaires, 146 female undergraduate business management as we...
abstract al- muntazam by ibn al -jawzi is one of the greatest the book ancient book of texts on history of islam in the 6th century.it is very important one;because of including rare reports which are not found any where.in addition to historical reports,his outlook , in which embodies information on mythologies, milal wa nihal (sects and creeds), geography, and political, social and religiou...
assigning premium to the insurance contract in iran mostly has based on some old rules have been authorized by government, in such a situation predicting premium by analyzing database and it’s characteristics will be definitely such a big mistake. therefore the most beneficial information one can gathered from these data is the amount of loss happens during one contract to predicting insurance ...
In this paper, we study the Generalized Bin Covering problem. For this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. To nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. By computational experiments, the eciency of the heuristic algorithm is assessed.
Dynamic lot sizing problem is one of the significant problem in industrial units and it has been considered by many researchers. Considering the quantity discount in purchasing cost is one of the important and practical assumptions in the field of inventory control models and it has been less focused in terms of stochastic version of dynamic lot sizing problem. In this paper, stochastic dyn...
the present paper investigates how far ideologies can be tease out in discourse by examining the employed schemata by two ideologically opposed news media, the bbc and press tv, to report syria crisis during a period of nine months in 2011. by assuming that news is not a valuefree construction of facts and drawing on micro structural approach of schema theory, for the first time in discours...
We present a hybrid heuristic computing method for the numerical solution of nonlinear singular boundary value problems arising in physiology. The approximate solution is deduced as a linear combination of some log sigmoid basis functions. A fitness function representing the sum of the mean square error of the given nonlinear ordinary differential equation (ODE) and its boundary conditions is f...
one of the most important extensions of the capacitated vehicle routing problem (cvrp) is the vehicle routing problem with simultaneous pickup and delivery (vrpspd) where customers require simultaneous delivery and pick-up service. in this paper, we propose an effective ant colony optimization (eaco) which includes insert, swap and 2-opt moves for solving vrpspd that is different with common an...
This paper proposes three algorithms for multiple-choice hardware-software partitioning with the objectives: minimizing execution time and power consumption, while meeting the area constraint. A heuristic algorithm is proposed to rapidly generate an approximate solution. A tabu search algorithm is customized to refine the heuristic solution. Also, a dynamic programming algorithm is proposed to ...
The problem of the distribution of dairy products, which is classified as a combinatorial optimization problem, cannot be solved in polynomial time. In this paper, an algorithm based on Ant Colony Hybrid meta-heuristic system and Geographic Information System (GIS) was used to find a near-optimal solution to this problem. Using the former method, the nearest neighbor heuristic algorithm was use...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید