This paper describes a parallel genetic algorithms library which enables easy development of parallel programs exploiting genetic algorithm approach. The library is based on TOLKIEN C++ sequential library. SPMD paradigm is applied and PARA++ library is used for message passing. Island and global population models of parallelism have been implemented. The library may be used on virtual network c...

Process mining is helpful for deploying new business processes as well as auditing, analyzing and improving the already enacted ones. An improved pseudoparallel genetic algorithm is proposed with an asexual reproduction for avoiding crossover operators’ breach to nice gene patterns. The initial population is produced by greedy algorithm in order to enhance convergence velocity. Information exch...

evolutionary algorithms are some of the most crucial random approaches tosolve the problems, but sometimes generate low quality solutions. on the otherhand, learning automata are adaptive decision-making devices, operating onunknown random environments, so it seems that if evolutionary and learningautomaton based algorithms are operated simultaneously, the quality of results willincrease sharpl...

determining the optimal location of wells with the aid of an automated search algorithm is a significant and difficult step in the reservoir development process. it is a computationally intensive task due to the large number of simulation runs required. therefore,the key issue to such automatic optimization is development of algorithms that can find acceptable solutions with a minimum number of...

This paper presents a novel evolutionary G–continuous (continuous-differentiable curvature) path planner for nonholonomic wheeled mobile robots. The evolutionary path planner generates intermediate configurations connected via η-splines that yields a collision-free G–continuous path, which each point on the path has a closed-form expression. The path planner is implemented as architecture of is...

This paper presents a novel evolutionary G–continuous (continuous-differentiable curvature) path planner for nonholonomic wheeled mobile robots. The evolutionary path planner generates intermediate configurations connected via η-splines that yields a collision-free G–continuous path, which each point on the path has a closed-form expression. The path planner is implemented as architecture of is...

introduction: raman spectroscopy, that is a spectroscopic technique based on inelastic scattering of monochromatic light, can provide valuable information about molecular vibrations, so using this technique we can study molecular changes in a sample. material and methods: in this research, 153 raman spectra obtained from normal and dried skin samples. baseline and electrical noise were eliminat...

in practice, obtaining the global optimum for the economic dispatch {bf (ed)}problem with ramp rate limits and prohibited operating zones is presents difficulties. this paper presents a new andefficient method for solving the economic dispatch problem with non-smooth cost functions using afuzzy adaptive genetic algorithm (faga). the proposed algorithm  deals  with the issue ofcontrolling the ex...

clustering is a widespread data analysis and data mining technique in many fields of study such as engineering, medicine, biology and the like. the aim of clustering is to collect data points. in this paper, a cultural algorithm (ca) is presented to optimize partition with n objects into k clusters. the ca is one of the effective methods for searching into the problem space in order to find a n...