نتایج جستجو برای: coded genetic algorithms
تعداد نتایج: 939636 فیلتر نتایج به سال:
Genetic algorithms have gained popularity as effective search procedures for obtaining solutions to traditionally difficult space mission optimization problems. In this paper, a real-coded genetic algorithm is used together with calculus of variations to optimize a trajectory for rendezvous problem. The global search properties of genetic algorithm combine with the local search capabilities of ...
Today due to increasing development and importance of petroleum activities andmarine transport as well as due to the mining of seabed, building activities such as construction of docks, platforms and structures as those in coastal areas and oceans has increased significantly. Concrete strength as one of the most important necessary parameters for designing, depends on many factors such as mixtu...
This paper proposes a novel optimization algorithm called Cellular Probabilistic Optimization Algorithms (CPOA) based on the probabilistic representation of solutions for real coded problems. In place of binary integers, the basic unit of information here is a probability density function. This probabilistic coding allows superposition of states for a more efficient algorithm. This probabilisti...
being one of the major research fields in the robotics discipline, the robot motion planning problem deals with finding an obstacle-free start-to-goal path for a robot navigating among workspace obstacles. such a problem is also encountered in path planning of intelligent vehicles and automatic guided vehicles (agvs). traditional (exact) algorithms have failed to solve the problem effectively s...
For many years, cryptanalysis has been considered as an attractive topic in jeopardizing the security and resistance of an encryption algorithm. The SDES encryption algorithm is a symmetric cryptography algorithm that performs a cryptographic operation using a crypt key. In the world of encryption, there are many search algorithms to cryptanalysis. In these researches, brute force attack algori...
Genetic algorithms are adaptive methods which may be used as approximation heuristic for search and optimization problems. Genetic algorithms process a population of search space solutions with three operations: selection, crossover and mutation. A great problem in the use of genetic algorithms is the premature convergence, a premature stagnation of the search caused by the lack of diversity in...
−−This work presents two stochastic optimization methods to perform the integrated synthesis and design of an activated sludge process. The process synthesis and design are carried out simultaneously with the control system design to obtain the most economical plant which satisfies the desired control system performance. The mathematical formulation of this objective translates the process supe...
Evaluating a local genetic algorithm as context-independent local search operator for metaheuristics
Local genetic algorithms have been designed with the aim of providing effective intensification. One of their most outstanding features is that they may help classical local search-based metaheuristics to improve their behavior. This paper focuses on experimentally investigating the role of a recent approach, the binary-coded local genetic algorithm (BLGA), as context-independent local search o...
A class of hybrid niching evolutionary algorithms (HNE) using clustering crowding and parallel local searching is proposed. By analyzing topology of fitness landscape and extending the space for searching similar individual, HNE determines the locality of search space more accurately, and decreases the replacement errors of crowding and suppressing genetic drift of the population. The integrati...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید