An algorithm for solving quadratic, two-stage stochastic problems is developed. The algorithm is based on the framework of the Branch and Fix Coordination (BFC) method. These problems have continuous and binary variables in the first stage and only continuous variables in the second one. The objective function is quadratic and the constraints are linear. The nonanticipativity constraints are fu...

This paper proposes a new algorithm of a simulated annealing (SA): Parallel Simulated Annealing using Genetic Crossover (PSA/GAc). The proposed algorithm consists of several processes, and in each process SA is operated. The genetic crossover is used to exchange information between solutions at fixed intervals. While SA requires high computational costs, particularly in continuous problems, thi...

This paper describes an evolutionary way to lean behaviors of a mobile robot for recognizing environments. We have proposed AEM (Action-based Environment Modeling) which is an appropriate approach for a simple mobile robot to recognize environments, and made experiments using a real robot. The suitable behaviors for AEM have been described by a human designer. However the design is very difficu...

in this paper, a chaotic particle swarm optimization with mutation-based classifier particle swarm optimization is proposed to classifypatterns of different classes in the feature space. the introduced mutation operators and chaotic sequences allows us to overcomethe problem of early convergence into a local minima associated with particle swarm optimization algorithms. that is, the mutationope...

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 an intuitive method for novice users to interactively design custom populations of stylized, heterogeneous motion, from one input motion clip, thus allowing the user to amplify an existing database of motions. We allow the user to set up lattice deformers which are used by a genetic algorithm to manipulate the animation channels of the input motion and create new motion vari...

In this study, a genetic algorithm (GA) is used to detect damage in curved beam model, stiffness as well mass matrices of the elements formulated using Hamilton's principle. Each node element possesses seven degrees freedom including warping degree freedom. The had been derived based on Kang and Yoo’s thin-walled theory. identification an optimization problem, binary continuous algorithms(BGA, ...