The job-shop scheduling problem (JSSP) is a well known difficult NP-hard problem. Genetic Algorithms (GAs) for solving the JSSP have been proposed, and they perform well compared with other approaches [1]. However, the tuning of genetic parameters has to be performed by trial and error. To address this problem, Sawai et al. have proposed the Parameter-free GA (PfGA), for which no control parame...

In this paper, a genetic algorithm guided control point extraction method that enables automatic face image morphing is proposed. This method can morph two face images by automatically detecting all the control points necessary to perform the morph. A face detection neural network, edge detection and medium filters are employed to detect the face position and features. Five control points, for ...

Genetic algorithms are efficient global optimizers, but they are weak in performing fine-grained local searches. In this paper, the local search capability of genetic algorithm is improved by hybridizing real coded genetic algorithm with 'uniform random' local search to form a hybrid real coded genetic algorithm termed 'RCGAu'. The incorporated local technique is applied to all newly created of...

Combining the advantages of genetic algorithm (GA) and projection pursuit regression (PPR), this article firstly uses improved Hermit polynomial as the ridge function of projection pursuit regression model. And then adopted the real-coded genetic algorithm to optimize the projection direction, a forecasting model for peak flow of short flood forecasting is presented. Applied the presented model...

The author proposes an extension of genetic algorithm (GA) for solving fuzzy-valued optimization problems. In the proposed GA, values in the genotypes are not real numbers but fuzzy numbers. Evolutionary processes in GA are extended so that GA can handle genotype instances with fuzzy numbers. The proposed method is applied to evolving neural networks with fuzzy weights and biases. Experimental ...