نتایج جستجو برای: priority based genetic algorithm

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

Journal: :International Journal of Multimedia and Ubiquitous Engineering 2013

Journal: :journal of advances in computer research 0
touraj mohammadpour department of computer engineering, ayatollah amoli branch, islamic azad university, amol, iran mehdi yadollahi department of computer engineering, ayatollah amoli branch, islamic azad university, amol, iran amir massoud bidgoli assistant professor, b.sc., m.sc., ph.d. (manchester university), mieee, tehran north branch, islamic azad university, tehran, iran habib esmaeelzadeh rostam department of computer engineering, ghaemshahr branch, islamic azad university, ghaemshahr, iran

multiple traveling salesman problem (mtsp) is one of the most popular operation research problem and is known as combinatorial optimization problems. mtsp is an extension version of the famous and widely used problem named traveling salesman problem (tsp). because of its benefices in various domains, many researchers have tried to solve that, and many methods have proposed so far. mtsp is a np-...

2009
Jeong-Eun Lee Mitsuo Gen Kyong-Gu Rhee

We formulate a mathematical model of remanufacturing system as multi-stage reverse Logistics Network Problem (mrLNP) with minimizing the total costs for reverse logistics shipping cost and inventory holding cost at disassembly centers and processing centers over finite planning horizons. For solving this problem, in the 1st and the 2nd stages, we propose a Genetic Algorithm (GA) with priority-b...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه اصفهان 1389

implicit and unobserved errors and vulnerabilities issues usually arise in cryptographic protocols and especially in authentication protocols. this may enable an attacker to make serious damages to the desired system, such as having the access to or changing secret documents, interfering in bank transactions, having access to users’ accounts, or may be having the control all over the syste...

2012
Ekain Azketa Juan P. Uribe Javier Gutiérrez Marga Marcos

The mapping of tasks and messages and the assignment of fixed priorities in distributed real-time systems are known to be NP-hard problems, and thus there are no optimal methods to accomplish them in polynomial time. This fact makes them suitable problems to be approached with generic search and optimization algorithms. In this paper we propose a genetic algorithm with a permutational solution ...

Journal: :journal of advances in computer research 0

clustering is the process of dividing a set of input data into a number of subgroups. the members of each subgroup are similar to each other but different from members of other subgroups. the genetic algorithm has enjoyed many applications in clustering data. one of these applications is the clustering of images. the problem with the earlier methods used in clustering images was in selecting in...

Blind source separation technique separates mixed signals blindly without any information on the mixing system. In this paper, we have used two evolutionary algorithms, namely, genetic algorithm and particle swarm optimization for blind source separation. In these techniques a novel fitness function that is based on the mutual information and high order statistics is proposed. In order to evalu...

Journal: :international journal of finance, accounting and economics studies 0

bankruptcy is an event with strong impacts on management, shareholders, employees, creditors, customers and other stakeholders, so as bankruptcy challenges the country both socially and economically. therefore, correct prediction of bankruptcy is of high importance in the financial world. this research intends to investigate financial crisis prediction power using models based on neural network...

2012
Rachhpal Singh

Task graph scheduling is the important factor which occurs in the multiprocessor system. There is problem solving technique called NP complete which is the optimal scheduling of parallel tasks with some precedence relationship onto parallel machines and can be solved only by using heuristic approach. The execution time requirements of the applications tasks are assumed to be stochastic. Genetic...

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

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