نتایج جستجو برای: genetic algorithm and simulated annealing algorithm

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

In the GA approach the parameters that influence its performance include population size, crossover rate and mutation rate. Genetic algorithms are suitable for traversing large search spaces since they can do this relatively fast and because the mutation operator diverts the method away from local optima, which will tend to become more common as the search space increases in size. GA’s are base...

This paper proposes a mixed integer programming model to solve a non-identical parallel machine (NIPM) scheduling with sequence-dependent set-up times and human resiliency engineering. The presented mathematical model is formulated to consider human factors including Learning, Teamwork and Awareness. Moreover, processing time of jobs are assumed to be non-deterministic and dependent to their st...

Delivering perishable products to customers as soon as possible and with the minimum cost has been always a challenge for producers and has been emphasized over recent years due to the global market becoming more competitive. In this paper a multi-objective mix integer non-linear programming model is proposed to maximize both profits of a distributer and the total freshness of the several produ...

This paper investigates the network location problem for single-server facilities that are subject to congestion. In each network edge, customers are uniformly distributed along the edge and their requests for service are assumed to be generated according to a Poisson process. A number of facilities are to be selected from a number of candidate sites and a single server is located at each facil...

1998
Edmund Burke Graham Kendall

In this paper we consider a simplified version of the stock cutting (two-dimensional bin packing) problem. We compare three meta-heuristic algorithms (genetic algorithm (GA), tabu search (TS) and simulated annealing (SA)) when applied to this problem. The results show that tabu search and simulated annealing produce good quality results. This is not the case with the genetic algorithm. The prob...

The present paper extends the idea of job shop scheduling problem with resting constraints to the train scheduling problem with the Muslim praying considerations. For this purpose, after proposing the new mathematical model, a heuristic algorithm based on the Electromagnetism-Like algorithm (EM) which is well adjusted to scheduling problems is employed to solve the large-size practical cases. T...

Journal: :journal of computer and robotics 0
seyed mahmood hashemi school of computer engineering, darolfonoon high educational institute, qazvin, iran

fuzzy clustering methods are conveniently employed in constructing a fuzzy model of a system, but they need to tune some parameters. in this research, fcm is chosen for fuzzy clustering. parameters such as the number of clusters and the value of fuzzifier significantly influence the extent of generalization of the fuzzy model. these two parameters require tuning to reduce the overfitting in the...

2012
M S Soyjaudah

Cryptology is a thriving research area of great practical importance. It is a fundamental building block of communications security. Cryptographic techniques currently being utilized in the field of communication. This paper presents an approach for the heuristic search procedures for cryptanalysis and development of enhanced cryptographic techniques. To implement the proposed Tabu search, Gene...

2007
Z. G. Wang M. Rahman Y. S. Wong K. S. Neo

In this paper, a new hybrid of genetic algorithm (GA) and simulated annealing (SA), referred to as GSA, is presented. In this algorithm, SA is incorporated into GA to escape from local optima. The concept of hierarchical parallel GA is employed to parallelize GSA for the optimization of multimodal functions. In addition, multi-niche crowding is used to maintain the diversity in the population o...

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

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