{"title":"On the mean convergence time for simple genetic algorithms","authors":"T. Niwa, M. Tanaka","doi":"10.1109/ICEC.1995.489176","DOIUrl":"https://doi.org/10.1109/ICEC.1995.489176","url":null,"abstract":"In this paper, we describe genetic drift by a Markov model arid give the mean couvergeiice time under genetic drift in tlie context of GAS. Our arialyses of GAS niakll use of tlie blarkov cliain formalisni based on the Wright-Fisher model which is a typical iiiodel in genetics. Tlie states of tlie Markov chain are giveii. Tlieii, we consider the mean coiivcrgeiicc time to the absorbing states of the Wright-Fisher model. Finally, we derive an optimal iiiutatioii rate for GAS and show that this rate works effectively.","PeriodicalId":213919,"journal":{"name":"Proceedings of 1995 IEEE International Conference on Evolutionary Computation","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124038956","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The application of evolution strategies to the problem of parameter optimization in fuzzy rulebased systems","authors":"M. Fathi-Torbaghan, L. Hildebrand","doi":"10.1109/ICEC.1995.487493","DOIUrl":"https://doi.org/10.1109/ICEC.1995.487493","url":null,"abstract":"Fuzzy logic has become widely acknowledged as an important and useful methodology in the design of rule based systems. It allows the representation of imprecise or incomplete knowledge and offers various mechanisms for reasoning with fuzzy data. In comparison to 'classical' rule based systems, only very few rules are needed to describe difficult problems. Nevertheless, in its current form it has several shortcomings: when it comes to the design of membership functions or to actually attaching priorities to the available rules, the choice of numerical quantities for the different parameters which is indispensable for the reasoning process is generally not justified by the results from knowledge acquisition and, what is worse, demands often a long process of iterative improvement to obtain good results. The use of empirically obtained quantitative representations seems questionable because of its high context dependence. The results are in many cases sub optimal systems. It seems natural to try to use a computer and an algorithmic optimization technique for the final adjustment of the parameters. Evolutionary algorithms seem especially appropriate for this task, partly because the fuzzy reasoning process can hardly be described by means of a closed mathematical formula-not to mention differentiability or other 'convenient' mathematical properties-partly because of the opportunity to apply parallel computation in a very natural way which seems essential in the design of large scale systems.","PeriodicalId":213919,"journal":{"name":"Proceedings of 1995 IEEE International Conference on Evolutionary Computation","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114721871","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Applying logic grammars to induce sub-functions in genetic programming","authors":"M. Wong, K. Leung","doi":"10.1109/ICEC.1995.487477","DOIUrl":"https://doi.org/10.1109/ICEC.1995.487477","url":null,"abstract":"Genetic programming (GP) is a method of automatically inducing S-expressions in LISP to perform specified tasks. The problem of inducing programs can be reformulated as a search for a highly fit program in the space of all possible programs. This paper presents a framework in which the search space can be specified declaratively by a user. Its application in inducing sub-functions is detailed. The framework is based on a formalism of logic grammars and it is implemented as a system called LOGENPRO (LOgic grammar-based GENetic PROgramming system). The formalism is powerful enough to represent context-sensitive information and domain-dependent knowledge. This knowledge can be used to accelerate the learning speed and/or improve the quality of the programs induced. The system is also very flexible and programs in various programming languages can be acquired. Automatic discovery of sub-functions is one of the most important research areas in GP. An experiment is used to demonstrate that LOGENPRO can emulate Koza's (1992, 1994) automatically defined functions (ADF). Moreover, LOGENPRO can employ knowledge such as argument types in a unified framework. An experiment shows that LOGENPRO has a superior performance to that of ADF when more domain-dependent knowledge is available.","PeriodicalId":213919,"journal":{"name":"Proceedings of 1995 IEEE International Conference on Evolutionary Computation","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132215299","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Evolving radial basis function neural networks using a genetic algorithm","authors":"B. Carse, A. Pipe, T. Fogarty, T. Hill","doi":"10.1109/ICEC.1995.489163","DOIUrl":"https://doi.org/10.1109/ICEC.1995.489163","url":null,"abstract":"Most research to date using genetic algorithms to evolve neural networks has focused on the multi-layer perceptron. Altemative neural network approaches such as the radial basis function network, and their representations appear to have received relatively little attention as grist for the GA mill. This is perhaps surprising since, for example, the radial basis function network has also been proved to be universal function approximator. Here we focus on evolution of radial basis function networks. While the multilayer perceptron network approximates functions through global interaction between network nodes, the radial basis function network uses local interactions between network nodes. It is suggested, that this difference may be of significance in tem of epistatic interactions in encoded genomes for the two types of network, which affects the ability of the genetic algorithm to evolve successful networks. A representation and attendant genetic operators for evolving radial basis function networks are proposed, drawing on recent work on evolutionary fuzzy logic systems. Experimental results in applying a hybrid leaming technique, using a genetic algorithm for evolving the radial basis function hidden layer (number of hidden nodes and hidden node centres and widths) and supervised leaming for tuning of network connection weights, are presented.","PeriodicalId":213919,"journal":{"name":"Proceedings of 1995 IEEE International Conference on Evolutionary Computation","volume":"181 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131514189","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Selecting features with genetic algorithm in handwritten digit recognition","authors":"Weiquan Liu, Minghui Wang, Yixin Zhong","doi":"10.1109/ICEC.1995.489180","DOIUrl":"https://doi.org/10.1109/ICEC.1995.489180","url":null,"abstract":"In this paper, a feature selection method is described. Ln a pattern recognition system, a large number of features usually make the realization of eflcient class$er df7cult. The redundancy within features is also unavoidable. The method proposed in this pigper selects features from the existing feature set according to the mutual information(iMIl measuremervt between classes and features. Genelic Algorithm(GA) is used to select the most informative feature subset. Based on the experiment results if handwritten digits recognition, This method can reduce the number of features needed in the recognition process without impairing the performance of class(j7er significantly.","PeriodicalId":213919,"journal":{"name":"Proceedings of 1995 IEEE International Conference on Evolutionary Computation","volume":"4 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131741534","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A multiprocessor scheduling scheme using problem-space genetic algorithms","authors":"M. Dhodhi, I. Ahmad, Ishfaq Ahmad","doi":"10.1109/ICEC.1995.489147","DOIUrl":"https://doi.org/10.1109/ICEC.1995.489147","url":null,"abstract":"Efficient assignment and scheduling of tasks of a parallel program is of prime importance in the effective utilization of multiprocessor systems. In this paper, we describe an efficient scheme for static scheduling of precedence constrained task graphs with non - neg lig i b le i n ter t as k communication onto fully connected multiprocessor systems with the objective of minimizing the completion time. Our technique is based on problem-space genetic algorithms (PSGA). It combines the search power of genetic algorithms with list scheduling heuristic in order to reduce the completion time and to increase the resource utilization. We demonstrate the effectiveness of our technique by comparing against several of the existing static scheduling techniques for the test examples reported in literature.","PeriodicalId":213919,"journal":{"name":"Proceedings of 1995 IEEE International Conference on Evolutionary Computation","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131160397","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Application of evolution program to resource demand optimisation in project planning","authors":"M. Pawlak","doi":"10.1109/ICEC.1995.489187","DOIUrl":"https://doi.org/10.1109/ICEC.1995.489187","url":null,"abstract":"This paper presents an evolution program implemented to optimisation ojresource demand in the area of project planning. The optimisation is being carried through on assumption of constant (minimum) process duration. The program has been applied to a practical case: the process of a track-laying vehicle repair. The results have been compared with heuristic algorithms.","PeriodicalId":213919,"journal":{"name":"Proceedings of 1995 IEEE International Conference on Evolutionary Computation","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127659034","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Scheduling cargo trains using genetic algorithms","authors":"V. Salim, X. Cai","doi":"10.1109/ICEC.1995.489149","DOIUrl":"https://doi.org/10.1109/ICEC.1995.489149","url":null,"abstract":"The scheduling problem examined in this paper involves the transportation of iron ore by train. A schedule for the trains in the system should consider two important criteria: feasibility and minimisation of costs. Feasibility implies that none of the trains conflicts with any other en route. The cost criterion includes minimising the costs associated with stopping (for example, due to wear and tear on the brakes) and the costs of delaying any trains. The latter two imply that it is desirable for a train to reach its destination in the shortest time possible. The problem at hand is particularly well suited to a genetic algorithmic formulation as it is an NP-hard problem and, hence, it is impossible in practice to use a constructive algorithm to obtain a solution. Various GA specifications are presented for an example extracted f?om a real system and the results obtained are compared against each other.","PeriodicalId":213919,"journal":{"name":"Proceedings of 1995 IEEE International Conference on Evolutionary Computation","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115432699","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Evolving building blocks for genetic algorithms using genetic engineering","authors":"J. Gero, V. Kazakov","doi":"10.1109/ICEC.1995.489170","DOIUrl":"https://doi.org/10.1109/ICEC.1995.489170","url":null,"abstract":"We present a lnodificatioli to the standard geiietic algoritliln (GA) , wliicli is 1msed on concepts of genetic engineering. Tlie motivation is to discover useful aiid harmfiil genetic materials and then execute ail evoliitioii process in such a way that the popiilation becoiiies increasingly coinposed of iiseful genetic material and increasingly free of the liariiifiil genetic material. Compared to the standard GA it provides sonie coinpiitational advantages as well as a tool for automatic generation of the genetic representations which are specifically tailored to suit certain classes of problems.","PeriodicalId":213919,"journal":{"name":"Proceedings of 1995 IEEE International Conference on Evolutionary Computation","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114745450","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A hybrid genetic algorithm/fuzzy logic approach to manufacturing process control","authors":"Bernd Freisleben, S. Strelen","doi":"10.1109/ICEC.1995.487495","DOIUrl":"https://doi.org/10.1109/ICEC.1995.487495","url":null,"abstract":"Genetic algorithms and fuzzy logic have been proven to be effective in a variety of control applications. We present an approach for automatically determining the control parameters of a machine used in a manufacturing environment for producing cookies and other pastry. The proposed solution is based on augmenting a genetic algorithm with elements of fuzzy logic, since either of them alone could not produce satisfactory results. The feasibility of the approach is demonstrated by presenting experimental results obtained in a series of test productions. The tests show that high quality cookies can be produced in a very short time.","PeriodicalId":213919,"journal":{"name":"Proceedings of 1995 IEEE International Conference on Evolutionary Computation","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116891362","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}