نتایج جستجو برای: classical genetic algorithms
تعداد نتایج: 1080903 فیلتر نتایج به سال:
there are many approaches for solving variety combinatorial optimization problems (np-compelete) that devided to exact solutions and approximate solutions. exact methods can only be used for very small size instances due to their expontional search space. for real-world problems, we have to employ approximate methods such as evolutionary algorithms (eas) that find a near-optimal solution in a r...
This investigation considers a reentrant permutation flowshop scheduling problem whose performance criterion is maximum tardiness. The reentrant flowshop (RFS) is a natural extension of the classical flowshop by allowing a job to visit certain machines more than once. The RFS scheduling problem, in which the job order is the same for each machine in each layer, is called a reentrant permutati...
This paper describes a Genetic Algorithms approach to amanpower-scheduling problem arising at a Petrochemical Company. AlthoughGenetic Algorithms have been successfully used for similar problemsin the past, they always had to overcome the limitations of theclassical Genetic Algorithms paradigm in handling the conflict betweenobjectives and constraints. The approach taken here is to use an indir...
a new structure learning approach for bayesian networks (bns) based on asexual reproduction optimization (aro) is proposed in this letter. aro can be essentially considered as an evolutionary based algorithm that mathematically models the budding mechanism of asexual reproduction. in aro, a parent produces a bud through a reproduction operator; thereafter the parent and its bud compete to survi...
in this paper, a new approach is proposed for the optimum design of single-phase induction motor. by using the classical design equations and the evolutionary algorithms such as genetic algorithms (ga), particle swarm optimization (pso) and modified particle swarm optimization (mpso), a single phase induction motor (spim) was designed with the maximum efficiency. the finite element method (fem)...
in many real world assembly line systems which the work-piece is of large size more than one worker work on the same work-piece in each station. this type of assembly line is called multi-manned assembly line (mal). in the classical multi-manned assembly line balancing problem (malbp) the objective is to minimize the manpower needed to manufacture one product unit. apart from the manpower, othe...
nowadays network-on-chips is used instead of system-on-chips for better performance. this paper presents a new algorithm to find a shorter path, and shows that genetic algorithm is a potential technique for solving routing problem for mesh topology in on-chip-network.
in this paper, we develop a capacitated location-covering model considering interval values for demand and service parameters. we also consider flexibility on distance standard for covering demand nodes by the servers. we use the satisfaction degree to represent the constraint of service capacity. the proposed model belongs to the class of mixed integer programming models. our model can be redu...
The purpose of our bibliometric research was to capture and analyze the trends two types well-known classical artificial intelligence (AI) algorithms: neural networks (NNs) genetic algorithms (GAs). Symmetry is a very popular international interdisciplinary scientific journal that cover six major subjects mathematics, computer science, engineering physics, biology, chemistry which are all relat...
In this paper, a new approach is proposed for the optimum design of single-phase induction motor. By using the classical design equations and the evolutionary algorithms such as Genetic Algorithms (GA), Particle Swarm Optimization (PSO) and Modified Particle Swarm Optimization (MPSO), a Single Phase Induction Motor (SPIM) was designed with the maximum efficiency. The Finite Element Method (FEM)...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید