{"title":"Examination of multi-objective optimization method for global search using DIRECT and GA","authors":"Luyi Wang, Hiroyuki Ishida, T. Hiroyasu, M. Miki","doi":"10.1109/CEC.2008.4631125","DOIUrl":"https://doi.org/10.1109/CEC.2008.4631125","url":null,"abstract":"A number of multi-objective genetic algorithms (MOGAs) have been developed to obtain Pareto optimal solutions for multi-objective optimization problems. However, as these methods involve probabilistic algorithms, there is no guarantee that the global search will be conducted in the design variable space. In such cases, there are unsearched areas in the design variable space, and the obtained Pareto solutions may not be truly optimal. In this paper, we propose an optimization method called NSDIRECT-GA to conduct a global search over the design variable space as much as possible, which improves the reliability of the obtained Pareto solutions. The effectiveness of NSDIRECT-GA was examined through numerical experiments. NSDIRECT-GA can obtain not only Pareto solutions, but also grasp the landscape of the search space, which results in higher reliability of the obtained solutions compared to MOGAs.","PeriodicalId":328803,"journal":{"name":"2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117203635","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":"Investigation of simply coded evolutionary artificial neural networks on robot control problems","authors":"Y. Katada, Jun Nakazawa","doi":"10.1109/CEC.2008.4631088","DOIUrl":"https://doi.org/10.1109/CEC.2008.4631088","url":null,"abstract":"One of the advantages of evolutionary robotics over other approaches in embodied cognitive science would be its parallel population search. Due to the population search, it takes a long time to evaluate all robot in a real environment. Thus, such techniques as to shorten the time are required for real robots to evolve in a real environment. This paper proposes to use simply coded evolutionary artificial neural networks for robot control to make genetic search space as small as possible and investigates the performance of them using simulated robots. Two types of genetic algorithm (GAs) are employed, one is the standard GA and the other is an extended GA, to achieve higher final fitnesses as well as achieve high fitnesses faster. The results suggest the benefits of the proposed method.","PeriodicalId":328803,"journal":{"name":"2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120944351","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":"Exploring the use of ancestry as a unified network model of finite population evolution","authors":"P. Whigham, Grant Dick","doi":"10.1109/CEC.2008.4631303","DOIUrl":"https://doi.org/10.1109/CEC.2008.4631303","url":null,"abstract":"The evolution of a population is determined by many factors, including the geographic separation of individuals in the population (spatial structure), parent selection via assortative mating (biasing who breeds with whom), environmental gradients, founder effects, disturbance, selection, stochastic effects characterised as genetic drift and so on. Ultimately the interest in studying a population of organisms is about characterising parent selection over time. This paper will examine the evolution of a population under the neutral conditions of genetic drift and for a simple selection model. For drift two conditions are considered: the first is for a range of spatial (geographic) constraints defined by a network; the second is through the use of a tagging system that models assortative mate selection. A simple selection model for the OneMax problem is used to illustrate the response of a population to selection pressure. An ancestry network is constructed representing the shared parent interactions over time. This structure is analyzed as a method for characterising the interactions of a population. The approach demonstrates a unified model to characterise population dynamics, independent of the underlying evolutionary constraints.","PeriodicalId":328803,"journal":{"name":"2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127144248","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":"Towards a self regulating local network neighbourhood artificial immune system for data clustering","authors":"A. J. Graaff, A. Engelbrecht","doi":"10.1109/CEC.2008.4630862","DOIUrl":"https://doi.org/10.1109/CEC.2008.4630862","url":null,"abstract":"The theory of idiotopic lymphocyte networks in the natural immune system inspired the modelling of network based artificial immune systems (AIS). Many of these network based AIS models establish network links between the artificial lymphocytes (ALCs) whenever the measured Euclidean distance between the ALCs are below a certain network threshold. The linked ALCs represent an artificial lymphocyte network. Graaff and Engelbrecht introduced the Local Network Neighbourhood AIS (LNNAIS) [2]. The interpretation of the network theory is the main difference between LNNAIS and existing network based AIS models. The LNNAIS uses the concept of an artificial lymphocyte neighbourhood to determine network links between ALCs [A.J. Graaf and A.P. Engelbrecht, 2007]. The purpose of this paper is to highlight the drawbacks of the proposed LNNAIS model and to address these drawbacks with some enhancements, improving LNNAIS towards a self regulating AIS.","PeriodicalId":328803,"journal":{"name":"2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127533306","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":"Solving and analyzing Sudokus with cultural algorithms","authors":"Timo Mantere, J. Koljonen","doi":"10.1109/CEC.2008.4631350","DOIUrl":"https://doi.org/10.1109/CEC.2008.4631350","url":null,"abstract":"This paper studies how cultural algorithm suits to solving and analyzing Sudoku puzzles. Sudoku is a number puzzle that has recently become a worldwide phenomenon. It can be regarded as a combinatorial problem, but when solved with evolutionary algorithms it can also be handled as a constraint satisfaction or multi-objective optimization problem. The objectives of this study were 1) to test if a cultural algorithm with a belief space solves Sudoku puzzles more efficiently than a normal permutation genetic algorithm, 2) to see if the belief space gathers information that helps analyze the results and improve the method accordingly, 3) to improve our previous Sudoku solver presented in CEC2007. Experiments showed that proposed the cultural algorithm performed slightly better than the previous genetic algorithm based Sudoku solver.","PeriodicalId":328803,"journal":{"name":"2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124887193","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 Coalition-Based Metaheuristic for the vehicle routing problem","authors":"D. Meignan, Jean-Charles Créput, A. Koukam","doi":"10.1109/CEC.2008.4630945","DOIUrl":"https://doi.org/10.1109/CEC.2008.4630945","url":null,"abstract":"This paper presents a population based Metaheuristic adopting the metaphor of social autonomous agents. In this context, agents cooperate and self-adapt in order to collectively solve a given optimization problem. From an evolutionary computation point of view, mechanisms driving the search consist of combining intensification operators and diversification operators, such as local search and mutation or recombination. The multiagent paradigm mainly focuses on the adaptive capabilities of individual agents evolving in a context of decentralized control and asynchronous communication. In the proposed metaheuristic, the agentpsilas behavior is guided by a decision process for the operatorspsilachoice which is dynamically adapted during the search using reinforcement learning and mimetism learning between agents. The approach is called Coalition-Based Metaheuristic (CBM) to refer to the strong autonomy conferred to the agents. This approach is applied to the Vehicle Routing Problem to emphasize the performance of learning and cooperation mechanisms.","PeriodicalId":328803,"journal":{"name":"2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124972355","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}
Luis Martí, Jesús García, A. Berlanga, J. M. Molina
{"title":"Model-building algorithms for multiobjective EDAs: Directions for improvement","authors":"Luis Martí, Jesús García, A. Berlanga, J. M. Molina","doi":"10.1109/CEC.2008.4631179","DOIUrl":"https://doi.org/10.1109/CEC.2008.4631179","url":null,"abstract":"In order to comprehend the advantages and short-comings of each model-building algorithm they should be tested under similar conditions and isolated from the MOEDA it takes part of. In this work we will assess some of the main machine learning algorithms used or suitable for model-building in a controlled environment and under equal conditions. They are analyzed in terms of solution accuracy and computational complexity. To the best of our knowledge a study like this has not been put forward before and it is essential for the understanding of the nature of the model-building problem of MOEDAs and how they should be improved to achieve a quantum leap in their problem solving capacity.","PeriodicalId":328803,"journal":{"name":"2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125305962","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":"An evolutionary algorithm for discovering biclusters in gene expression data of breast cancer","authors":"Qinghua Huang, Minhua Lu, Hong Yan","doi":"10.1109/CEC.2008.4630892","DOIUrl":"https://doi.org/10.1109/CEC.2008.4630892","url":null,"abstract":"The analysis of gene expression data of breast cancer is important for discovering the signatures that can classify different subtypes of tumors and predict prognosis. Biclustering algorithms have been proven to be able to group the genes with similar expression patterns under a number of samples and offer the capability to analyze the microarray data of cancer. In this study, we propose a new biclustering algorithm which uses an evolutionary search procedure. The algorithm is applied to the conditions to search for combinations of conditions for a potential bicluster. Preliminary results using synthetic and real yeast data sets demonstrate that our algorithm outperforms several existing ones. We have also applied the method to real microarray data sets of breast cancer, and successfully found several biclusters, which can be used as signatures for differentiating tumor types.","PeriodicalId":328803,"journal":{"name":"2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114886624","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":"Robust model matching control of immune systems under environmental disturbances: Fuzzy dynamic game approach","authors":"Chia-Hung Chang, Bor‐Sen Chen, Y. Chuang","doi":"10.1109/CEC.2008.4631075","DOIUrl":"https://doi.org/10.1109/CEC.2008.4631075","url":null,"abstract":"A robust model matching control of immune response is proposed for therapeutic enhancement to match a prescribed immune response under uncertain initial states and environmental disturbances, including continuous intrusion of exogenous pathogens. The worst-case effect of all possible environmental disturbances and uncertain initial states on the matching for a desired immune response is minimized for the enhanced immune system, i.e. a robust control is designed to track a prescribed immune model response from the minimax matching perspective. This minimax matching problem could be transformed to an equivalent dynamic game problem. The exogenous pathogen and environmental disturbances are considered as a player to maximize (worsen) the matching error when the therapeutic control agents are considered as another player to minimize the matching error. Since the innate immune system is highly nonlinear, it is not easy to solve the robust model matching control problem by the nonlinear dynamic game method directly. A fuzzy model is proposed to interpolate several linearized immune systems at different operation points to approximate the innate immune system via smooth fuzzy membership functions. With the help of fuzzy approximation method, the minimax matching control problem of immune systems could be easily solved by the proposed fuzzy dynamic game method via the linear matrix inequality (LMI) technique with the help of robust control toolbox in Matlab. Finally, an in silico example is given to illustrate the design procedure and to confirm the efficiency and efficacy of the proposed method.","PeriodicalId":328803,"journal":{"name":"2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114908109","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":"Epigenetic sensorimotor pathways and its application to developmental object learning","authors":"Zhengping Ji, M. Luciw, J. Weng","doi":"10.1109/CEC.2008.4631333","DOIUrl":"https://doi.org/10.1109/CEC.2008.4631333","url":null,"abstract":"A pathway in the central nervous system (CNS) is a path through which nervous signals are processed in an orderly fashion. A sensorimotor pathway starts from a sensory input and ends at a motor output, although almost all pathways are not simply unidirectional. In this paper, we introduce a simple, biologically inspired, unified computational model - Multi-layer In-place Learning Network (MILN), with a design goal to develop a recurrent network, as a function of sensorimotor signals, for open-ended learning of multiple sensorimotor tasks. The biologically motivated MILN provides automatic feature derivation and pathway refinement from the temporally real-time inputs. The work presented here is applied in the challenging application field of developing reactive behaviors from a video camera and a (noisy) radar range sensor for a vehicle-based robot in open, natural driving environments. An internal model of the agentpsilas experience of the environments is created and refined from the ground-up using a cell-centered model, based on the genomic equivalence principle. The outputs can be imposed by a teacher, at the same time as the learning is active. At any time instant, sensory information from the radar allows the system to focus its visual analysis on relatively small areas within the image plane (attention selection), in a computationally efficient way, suitable for real-time training. This system was trained with data from 10 different city and highway road environments, and cross validation shows that MILN was able to correctly recognize above 95% of the radar-extracted images from the multiple environments. The in-place learning mechanism compares with other learning algorithms favorably, as results of a comparison indicate that in-place learning is the only one to fit all the specified criteria of development of a general-purpose sensorimotor pathway.","PeriodicalId":328803,"journal":{"name":"2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114949539","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}