{"title":"Differential evolution vs. the functions of the 2/sup nd/ ICEO","authors":"K. Price","doi":"10.1109/ICEC.1997.592287","DOIUrl":"https://doi.org/10.1109/ICEC.1997.592287","url":null,"abstract":"Differential evolution (DE) is a simple evolutionary algorithm for numerical optimization whose most novel feature is that it mutates vectors by adding weighted, random vector differentials to them. A new version of the DE algorithm is described and the results of its attempts to optimize the 7 real-valued functions of the 2/sup nd/ ICEO are tabulated. DE succeeded in finding each function's global minimum, although the number of evaluations needed in one instance was unacceptably high. Despite this lone difficulty, DE's speed of execution across the remaining test bed, in addition to its simplicity, robustness and ease of use, suggest that it is a valuable tool for continuous numerical optimization.","PeriodicalId":167852,"journal":{"name":"Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115382478","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 robot morphology","authors":"H. Lund, J. Hallam, Wei-Po Lee","doi":"10.1109/ICEC.1997.592295","DOIUrl":"https://doi.org/10.1109/ICEC.1997.592295","url":null,"abstract":"True evolvable hardware should evolve whole hardware structures. In robotics, it is not enough only to evolve the control circuit; the performance of the control circuit is dependent on other hardware parameters-the robot body plan, which might include body size, wheel radius, motor time constant, sensors, etc. Both the control circuit and the body plan co-evolve in true evolvable hardware. By including the robot body plan in the genotype as a kind of Hox gene, we co-evolve task-fulfilling behaviors and body plans, and we study the distribution of body parameters in the morphological space. Further, we have developed a new hardware module for the Khepera robot, namely ears with programmable amplifiers, synthesizers and mixers, that allow us to study true evolvable hardware by modelling the evolution of auditory sensor morphology.","PeriodicalId":167852,"journal":{"name":"Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123206631","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":"Genetic-entropic algorithm in NK-model","authors":"Chang-Yong Lee, S. Han","doi":"10.1109/ICEC.1997.592263","DOIUrl":"https://doi.org/10.1109/ICEC.1997.592263","url":null,"abstract":"A new combinatorial optimization algorithm, genetic entropic algorithm, is proposed. To test the algorithm, we adopt the NK model and compare the performances of the genetic entropic algorithm with those of the conventional genetic algorithm. The higher the K value, the better this algorithm performs. The characteristics of this algorithm together with the difference between two algorithms are discussed.","PeriodicalId":167852,"journal":{"name":"Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123599882","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}
M. Sipper, M. Goeke, D. Mange, A. Stauffer, E. Sanchez, M. Tomassini
{"title":"The firefly machine: online evolware","authors":"M. Sipper, M. Goeke, D. Mange, A. Stauffer, E. Sanchez, M. Tomassini","doi":"10.1109/ICEC.1997.592292","DOIUrl":"https://doi.org/10.1109/ICEC.1997.592292","url":null,"abstract":"We present the firefly machine, an evolving hardware system, demonstrating that \"evolving ware\" (or \"evolware\") can be attained. The system is based on the cellular programming approach, in which parallel cellular machines evolve to solve computational tasks. The firefly system operates with no reference to an external device, such as a computer that carries out genetic operators, thereby exhibiting online autonomous evolution.","PeriodicalId":167852,"journal":{"name":"Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124465207","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 strategy for load balancing in distributed systems environments","authors":"S. Esquivel, G. Leguizamón, R. Gallard","doi":"10.1109/ICEC.1997.592282","DOIUrl":"https://doi.org/10.1109/ICEC.1997.592282","url":null,"abstract":"Load balancing algorithms attempt to improve systems performance through process migration. The article presents a hybrid strategy for load balancing in distributed systems, which exploits the benefits of evolutionary and predictive approaches. In order to decrease the communication traffic typically generated by load balancing schemes, we sought for a reduction in the number of requests done by an overloaded node. The predictive strategy applied to achieve this goal uses the knowledge attained by each node, through its previous experience.","PeriodicalId":167852,"journal":{"name":"Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97)","volume":"355 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122922835","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":"Finding a perceptual uniform color space with evolution strategies","authors":"G. R. Raidl, I. Tastl","doi":"10.1109/ICEC.1997.592364","DOIUrl":"https://doi.org/10.1109/ICEC.1997.592364","url":null,"abstract":"One of the goals of color science is to find a color space in which the Euclidean distance between any two colors corresponds to the color difference perceived by humans. Various empirical measurement methods are known in order to obtain data about the perceived differences between selected color samples. The problem is to find a function which transforms a well-known color space into a new one which matches the empirical data as closely as possible. One approach is to use multidimensional scaling in conjunction with tri-linear interpolation. In this paper, a new method is presented, using an evolution strategy for finding control point positions of a free-form deformation. Objective functions that are very well suited for two kinds of empirical data are described. In various test cases, this method proved to be very reliable in finding good solutions. Furthermore, free-form deformation has some essential advantages against tri-linear interpolation, e.g. derivative continuity to any degree.","PeriodicalId":167852,"journal":{"name":"Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128243896","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":"Adaptation in evolutionary computation: a survey","authors":"R. Hinterding, Z. Michalewicz","doi":"10.1109/ICEC.1997.592270","DOIUrl":"https://doi.org/10.1109/ICEC.1997.592270","url":null,"abstract":"Adaptation of parameters and operators is one of the most important and promising areas of research in evolutionary computation; it tunes the algorithm to the problem while solving the problem. In this paper we develop a classification of adaptation on the basis of the mechanisms used, and the level at which adaptation operates within the evolutionary algorithm. The classification covers all forms of adaptation in evolutionary computation and suggests further research.","PeriodicalId":167852,"journal":{"name":"Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97)","volume":"266 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116043289","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":"Evolutionary computation on multicriteria production process planning problem","authors":"G. Zhou, M. Gen","doi":"10.1109/ICEC.1997.592347","DOIUrl":"https://doi.org/10.1109/ICEC.1997.592347","url":null,"abstract":"The production process planning (PPP) problem is abundant among manufacturing systems. In general the problem can be approached by network analysis or dynamic programming. It is difficult for traditional optimization techniques to cope with the multicriteria production process planning (mPPP) problem. In this paper, a new evolutionary computation (EC) approach is developed to deal with the PPP problems with both single or multiple objective criteria. The proposed EC approach adopts a new simple state permutation encoding and combines with the neighborhood search technique in mutation operation to improve the evolutionary process in finding the optimal solution of the PPP problems. The numerical analysis shows that the proposed EC is both effective and efficient for the PPP problems.","PeriodicalId":167852,"journal":{"name":"Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97)","volume":"531 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120978653","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":"Evolutionary and adaptive strategies for engineering design-an overall framework","authors":"I. Parmee","doi":"10.1109/ICEC.1997.592338","DOIUrl":"https://doi.org/10.1109/ICEC.1997.592338","url":null,"abstract":"The paper investigates the integration of appropriate evolutionary and adaptive search (ES&AS) strategies with the various stages of the design process, i.e. conceptual, embodiment and detailed design. Rather than addressing the practical application of ES and AS techniques to complex specific engineering design problems the paper primarily attempts to identify the manner in which relevant co-operative ES and AS strategies can provide both a foundation and a framework for design activity that will satisfy the search and information requirements of the engineer throughout the design process. It is suggested that such strategies can support a range of activities from concept exploration and decision support to final product definition and optimisation. The paper is discussion-based and speculative in nature relying upon aspects of previous ES and AS research relating to the design process as a whole. The objective is to identify some areas of difficulty and assess the current and future potential benefits of successful generic AS and ES integration.","PeriodicalId":167852,"journal":{"name":"Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97)","volume":"125 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126617973","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":"Dual mutation strategies for mixed-integer optimisation in power station design","authors":"Kai Chen, I. Parmee, C. R. Gane","doi":"10.1109/ICEC.1997.592340","DOIUrl":"https://doi.org/10.1109/ICEC.1997.592340","url":null,"abstract":"This paper presents the integration of evolutionary search (AS) with the design and operation of nuclear power stations. The objective is to improve the overall performance of the thermal cycle of a nuclear power plant by optimising both station design and operation using integrated evolutionary search and conventional optimisation techniques. The problem pursued is in the class of mixed-integer, non-linear constrained optimisation problems. After an initial parametric study of various adaptive search and classical optimisation techniques to determine their relative potential within a search space characterised by heavy non-linear constraints, a hybrid approach has been developed. This firstly utilises a genetic algorithm (GA) as a pre-processor to identify a feasible region within the search space before employing a dual-mutation GA strategy to search the space of mixed-integer variables. A linear programming optimisation routine then periodically searches from the best GA points with the design configuration fixed to return an optimal solution in terms of plant performance.","PeriodicalId":167852,"journal":{"name":"Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97)","volume":"C-36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126491213","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}