نتایج جستجو برای: modified genetic algorithms

تعداد نتایج: 1144618  

Journal: :Indonesian Journal of Electrical Engineering and Computer Science 2023

Shortest path problem has emerged to be one of the significant areas research and there are various algorithms involved in it. One successful optimization techniques is genetic algorithm (GA). This paper proposes an efficient hybrid where initially we use a map reduction technique graph then find shortest using conventional with improved crossover operator. On comparing this other algorithms, i...

In this paper, we present some efficient numerical algorithm for solving system of fuzzy polynomial equations based on Newton's method. The modified Adomian decomposition method is applied to construct the numerical algorithms. Some numerical illustrations are given to show the efficiency of algorithms.

2017
Jiansong Li Hui Zhang Shaoyong Zhang Ji Zhang Anliang Chen Jidong Wang Wensheng Xiang

Two new 5-oxomilbemycins, 27-aldehyde-5-oxomilbemycin β12 (1) and 2-hydroxymilbemycin K (2), were isolated from a genetically engineered strain Streptomyces bingchenggensis BCJ60. Their structures were determined by comprehensive analyses of its 1 H and 13 C NMR, COSY, HMQC, and HMBC spectroscopic, HRESI-MS mass spectrometric and comparison with data from the literature. Preliminary studies sho...

Journal: :journal of advances in computer research 2016
arash mazidi mostafa fakhrahmad mohammadhadi sadreddini

the capacitated vehicle routing problem (cvrp) is a well-known combinatorial optimization problem that holds a central place in logistics management. the vehicle routing is an applied task in the industrial transportation for which an optimal solution will lead us to better services, save more time and ultimately increase in customer satisfaction. this problem is classified into np-hard problem...

Journal: :international journal of industrial engineering and productional research- 0
seyed mojtaba jafari henjani department of system analysis and control, faculty of computer science and control, national technical university “kharkov polytechnical institute”, kharkov, ukraine valeriy severin department of system analysis and control, faculty of computer science and control, national technical university “kharkov polytechnical institute”, kharkov, ukraine

the paper is devoted to solution of some problems in nuclear power station generating unit intellectual control systems using genetic algorithms on the basis of control system model development, optimizations methods of their direct quality indices and improved integral quadratic estimates. some mathematical vector models were obtained for control system multicriterion quality indices with due ...

Journal: :journal of optimization in industrial engineering 2012
esmaeil mehdizadeh fariborz afrabandpei

logistic network design is one of the most important strategic decisions in supply chain management that has recently attracted the attention of many researchers. transportation network design is then one of the most important fields of logistic network. this study is concerned with designing a multi-stage and multi-product logistic network. at first, a mixed integer nonlinear programming model...

Journal: :journal of advances in computer research 0
firozeh razavi department of management and economics, science and research branch, islamic azad university, tehran, iran faramarz zabihi department of computer engineering, sari branch, islamic azad university, sari, iran mirsaeid hosseini shirvani department of computer engineering, sari branch, islamic azad university, sari, iran

neural network is one of the most widely used algorithms in the field of machine learning, on the other hand, neural network training is a complicated and important process. supervised learning needs to be organized to reach the goal as soon as possible. a supervised learning algorithm analyzes the training data and produces an inferred function, which can be used for mapping new examples.  hen...

In this paper we introduce new modified implicit and explicit algorithms and prove strong convergence of the two algorithms to a common fixed point of a family of uniformly asymptotically regular asymptotically nonexpansive mappings in a real reflexive Banach space  with a uniformly G$hat{a}$teaux differentiable norm. Our result is applicable in $L_{p}(ell_{p})$ spaces, $1 < p

2011
Er.Rajiv Kumar

There are numerous approaches have been developed to solve job shop scheduling problems and machines process scheduling problem. Implementation of genetic algorithm for operating system process scheduling is a new idea . Genetic Algorithm is a robust technique for solve process scheduling and optimization problem. There are many type of genetic algorithms have been developed from simple genetic...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید