Entropic and Real-Time Analysis of the Search with Panmictic, Structured, and Parallel Distributed Genetic Algorithms
نویسندگان
چکیده
It has been a well-known fact that genetic algorithms (GAs) get part of their success from the efficient exploration/exploitation balance. This equilibrium is related to the population diversity decreasing rate. This rate is not the same for all GAs, but it depends on the reproductive cycle being used. In particular, steady-state (μ+1)-GAs (ssGA) have a larger convergence rate than traditional (genGA) generational (μ,μ)-GAs. Also, decentralized GAs are still not well known, and this is the reason for studying two of their most popular models: cellular, and distributed GAs (cGA & dGA, respectively).
منابع مشابه
An Analysis of Synchronous and Asynchronous Parallel Distributed Genetic Algorithms with Structured and Panmictic Islands
In a parallel genetic algorithm (PGA) several communicating nodal GAs evolve in parallel to solve the same problem. PGAs have been traditionally used to extend the power of serial GAs since they often can be tailored to provide a larger efficiency on complex search tasks. This has led to a considerable number of different models and implementations that preclude direct comparisons and knowledge...
متن کاملHybrid algorithms for Job shop Scheduling Problem with Lot streaming and A Parallel Assembly Stage
In this paper, a Job shop scheduling problem with a parallel assembly stage and Lot Streaming (LS) is considered for the first time in both machining and assembly stages. Lot Streaming technique is a process of splitting jobs into smaller sub-jobs such that successive operations can be overlapped. Hence, to solve job shop scheduling problem with a parallel assembly stage and lot streaming, deci...
متن کاملStatic Task Allocation in Distributed Systems Using Parallel Genetic Algorithm
Over the past two decades, PC speeds have increased from a few instructions per second to several million instructions per second. The tremendous speed of today's networks as well as the increasing need for high-performance systems has made researchers interested in parallel and distributed computing. The rapid growth of distributed systems has led to a variety of problems. Task allocation is a...
متن کاملAnalyzing synchronous and asynchronous parallel distributed genetic algorithms
Parallel genetic algorithms (PGAs) have been traditionally used to extend the power of serial GAs, since they often can be tailored to provide a larger efficiency on complex search problems. In a PGA several subalgorithms cooperate in parallel to solve the problem. This high-level definition has leaded to a considerable number of different implementations that preclude direct comparisons and kn...
متن کاملOptimum Routing in the Urban Transportation Network by Integrating Genetic Meta-heuristic (GA) and Tabu Search (Ts) Algorithms
Urban transportation is one of the most important issues of urban life especially in big cities. Urban development, and subsequently the increase of routes and communications, make the role of transportation science more pronounced. The shortest path problem in a network is one of the most basic network analysis issues. In fact, finding answers to this question is necessity for higher level ana...
متن کامل