Over the past few decades great efforts were made to solve uncertain hybrid optimization problems. The n-Queen problem is one of such problems that many solutions have been proposed for. The traditional methods to solve this problem are exponential in terms of runtime and are not acceptable in terms of space and memory complexity. In this study, parallel genetic algorithms are proposed to solve...

there are some machineries and equipments as well as relatively fix amount of human resources involved in any production process. in many cases, by observing operational method of a process, one may see that some of these machineries are not working, but on the other hand, other equipments are continuously working, and many parts are set in front of them, waiting to be set up over machines to c...

As a contribution to the BioSPICE project, we have developed an optimization module, for the task of fitting kinetic rate constants to time series concentration data. The algorithms use, both local searches, such as the Levenberg-Marquardt, and simplex, as well as global search methods such as simulated annealing and real coded genetic algorithms. We provide a description of the modules in term...

This report describes work in VLSI partitioning done under the Computing Research Association's Computing Research Experience for Women program. Three undergraduate women participated throughout the 1998-1999 academic year. In the process, the team wrote software to implement two existing "classic" methods for VLSI partitioning, and studied modern algorithms by reading recent journal and confer...

Acknowledgements The production of this Toolbox was made possible by a UK SERC grant on " Genetic Algorithms in Control Systems Engineering " (GR/J17920). Many thanks are due to Hartmut Pohlheim, a visiting researcher from the Technical University Ilmenau, Germany, for the support for real-valued genetic algorithms and his hard work in coding and revising many of the routines in this Toolbox. T...

The genetic algorithm behaviour is determined by the exploitation and exploration relationship kept throughout the run. Adaptive genetic algorithms have been built for inducing exploitation/exploration relationships that avoid the premature convergence problem and improve the nal results. One of the most widely studied adaptive approaches are the adaptive parameter setting techniques. In this p...

We propose a softening of a genetic program by the so–called fractional instructions. Thanks to their adjustable strengths, a new instruction can be gradually introduced to a program, and the other instructions may gradually adapt to the new member. In this way, a transformation of one candidate into another can be continuous. Such an approach makes it possible to take advantage of properties o...

in this paper, trajectory generation for the 4 dof arm of surena iii humanoid robot with the purpose of optimizing energy and avoiding a moving obstacle is presented. for this purpose, first, kinematic equations for a seven dof manipulator are derived. then, using the lagrange method, an explicit dynamics model for the arm is developed. in the next step, in order to generate the desired traject...

in this paper, genetic algorithms (gas) are employed to control simultaneous linear systems in both state and output feedback. first, the similarity transformation is applied to obtain parameterized controllers. this requires solution of a system of equations and also some non-linear inequalities. gas are used to solve these equations and inequalities. therefore, the paper presents an analytica...