%EvoWorkshops 2004 proceedings Gunther Raidl Thu, 19 Feb 2004 14:17:33 +0100 %WBL Added abstracts etc 23 Feb 2004 %MER 18 May 2005 page numbers corrected %WBL 16 Sep 2007 add @proceedings @Proceedings{evows04, title = {Applications of Evolutionary Computing, EvoWorkshops2004: {EvoBIO}, {EvoCOMNET}, {EvoHOT}, {EvoIASP}, {EvoMUSART}, {EvoSTOC}}, year = {2004}, month = {5-7 April}, editor = {Guenther R. Raidl and Stefano Cagnoni and Jurgen Branke and David W. Corne and Rolf Drechsler and Yaochu Jin and Colin Johnson and Penousal Machado and Elena Marchiori and Franz Rothlauf and George D. Smith and Giovanni Squillero}, series = {LNCS}, volume = {3005}, address = {Coimbra, Portugal}, publisher = {Springer Verlag}, publisher_address = {Berlin}, keywords = {evolutionary computation}, ISBN = {}, url = {}, notes = {EvoWorkshops2004}, } @InProceedings{bazzoli:evows04, author = {Andrea Bazzoli and Andrea G. B. Tettamanzi}, title = {A Memetic Algorithm for Protein Structure Prediction in a {3D}-Lattice {HP} Model}, booktitle = {Applications of Evolutionary Computing, EvoWorkshops2004: {EvoBIO}, {EvoCOMNET}, {EvoHOT}, {EvoIASP}, {EvoMUSART}, {EvoSTOC}}, year = {2004}, month = {5-7 April}, editor = {Guenther R. Raidl and Stefano Cagnoni and Jurgen Branke and David W. Corne and Rolf Drechsler and Yaochu Jin and Colin Johnson and Penousal Machado and Elena Marchiori and Franz Rothlauf and George D. Smith and Giovanni Squillero}, series = {LNCS}, volume = {3005}, address = {Coimbra, Portugal}, publisher = {Springer Verlag}, publisher_address = {Berlin}, pages = {1--10}, keywords = {evolutionary computation}, ISBN = {}, url = {}, abstract = {we present a memetic algorithm with self-adaptive local search, applied to protein structure prediction in an HP, cubic lattice model. Besides describing in detail how the algorithm works, we report experimental results that justify important implementation choices, such as the introduction of speciation mechanisms and the extensive application of local search. Test runs on 48-mer chains show that the proposed algorithm has promising search capabilities.}, notes = {EvoWorkshops2004}, } @InProceedings{brizuela:evows04, author = {Carlos A. Brizuela and Luis C. Gonz\'{a}lez and Heidi J. Romero}, title = {An Improved Genetic Algorithm for the Sequencing by Hybridization Problem}, booktitle = {Applications of Evolutionary Computing, EvoWorkshops2004: {EvoBIO}, {EvoCOMNET}, {EvoHOT}, {EvoIASP}, {EvoMUSART}, {EvoSTOC}}, year = {2004}, month = {5-7 April}, editor = {Guenther R. Raidl and Stefano Cagnoni and Jurgen Branke and David W. Corne and Rolf Drechsler and Yaochu Jin and Colin Johnson and Penousal Machado and Elena Marchiori and Franz Rothlauf and George D. Smith and Giovanni Squillero}, series = {LNCS}, volume = {3005}, address = {Coimbra, Portugal}, publisher = {Springer Verlag}, publisher_address = {Berlin}, pages = {11--20}, keywords = {evolutionary computation}, ISBN = {}, url = {}, abstract = {presents a genetic algorithm for a computational biology problem. The problem appears in the computational part of a new deoxyribonucleic acid (DNA) sequencing procedure denominated sequencing by Hybridization (SBH). The proposed genetic algorithm is an improvement over a recently proposed algorithm in the literature. The improvement is achieved by modifying the crossover operator towards an almost deterministic greedy crossover which makes the algorithm both more effective and more efficient. Experimental results on real DNA data are presented to show the advantages of using the proposed algorithm.}, notes = {EvoWorkshops2004}, } @InProceedings{cotta:evows04, author = {Carlos Cotta and Christian Sloper and Pablo Moscato}, title = {Evolutionary Search of Thresholds for Robust Feature Set Selection: Application to the Analysis of Microarray Data}, booktitle = {Applications of Evolutionary Computing, EvoWorkshops2004: {EvoBIO}, {EvoCOMNET}, {EvoHOT}, {EvoIASP}, {EvoMUSART}, {EvoSTOC}}, year = {2004}, month = {5-7 April}, editor = {Guenther R. Raidl and Stefano Cagnoni and Jurgen Branke and David W. Corne and Rolf Drechsler and Yaochu Jin and Colin Johnson and Penousal Machado and Elena Marchiori and Franz Rothlauf and George D. Smith and Giovanni Squillero}, series = {LNCS}, volume = {3005}, address = {Coimbra, Portugal}, publisher = {Springer Verlag}, publisher_address = {Berlin}, pages = {21--30}, keywords = {evolutionary computation}, ISBN = {}, url = {}, abstract = {We deal with two important problems in pattern recognition that arise in the analysis of large datasets. While most feature subset selection methods use statistical techniques to preprocess the labeled datasets, these methods are generally not linked with the combinatorial properties of the final solutions. We prove that it is $NP-$hard to obtain an appropriate set of thresholds that will transform a given dataset into a binary instance of a robust feature subset selection problem. We publisher_address this problem using an evolutionary algorithm that learns the appropriate value of the thresholds. The empirical evaluation shows that robust subset of genes can be obtained. This evaluation is done using real data corresponding to the gene expression of lymphomas.}, notes = {EvoWorkshops2004}, } @InProceedings{heddad:evows04, author = {Amine Heddad and Markus Brameier and Robert MacCallum}, title = {Evolving Regular Expression-based Sequence Classifiers for Protein Nuclear Localisation}, booktitle = {Applications of Evolutionary Computing, EvoWorkshops2004: {EvoBIO}, {EvoCOMNET}, {EvoHOT}, {EvoIASP}, {EvoMUSART}, {EvoSTOC}}, year = {2004}, month = {5-7 April}, editor = {Guenther R. Raidl and Stefano Cagnoni and Jurgen Branke and David W. Corne and Rolf Drechsler and Yaochu Jin and Colin Johnson and Penousal Machado and Elena Marchiori and Franz Rothlauf and George D. Smith and Giovanni Squillero}, series = {LNCS}, volume = {3005}, address = {Coimbra, Portugal}, publisher = {Springer Verlag}, publisher_address = {Berlin}, pages = {31--40}, keywords = {genetic algorithms, genetic programming, evolutionary computation}, ISBN = {}, url = {}, abstract = {A number of bioinformatics tools use regular expression (RE) matching to locate protein or DNA sequence motifs that have been discovered by researchers in the laboratory. For example, patterns representing nuclear localisation signals (NLSs) are used to predict nuclear localisation. NLSs are not yet well understood, and so the set of currently known NLSs may be incomplete. Here we use genetic programming (GP) to generate RE-based classifiers for nuclear localisation. While the approach is a supervised one (with respect to protein location), it is unsupervised with respect to already known NLSs. It therefore has the potential to discover new NLS motifs. We apply both tree based and linear GP to the problem. The inclusion of predicted secondary structure in the input does not improve performance. Benchmarking shows that our majority classifiers are competitive with existing tools. The evolved REs are usually "NLS like" and work is underway to analyse these for novelty.}, notes = {EvoWorkshops2004}, } @InProceedings{jong:evows04, author = {Kees Jong and Elena Marchiori and Aad {van der Vaart}}, title = {Analysis of Proteomic Pattern Data for Cancer Detection}, booktitle = {Applications of Evolutionary Computing, EvoWorkshops2004: {EvoBIO}, {EvoCOMNET}, {EvoHOT}, {EvoIASP}, {EvoMUSART}, {EvoSTOC}}, year = {2004}, month = {5-7 April}, editor = {Guenther R. Raidl and Stefano Cagnoni and Jurgen Branke and David W. Corne and Rolf Drechsler and Yaochu Jin and Colin Johnson and Penousal Machado and Elena Marchiori and Franz Rothlauf and George D. Smith and Giovanni Squillero}, series = {LNCS}, volume = {3005}, address = {Coimbra, Portugal}, publisher = {Springer Verlag}, publisher_address = {Berlin}, pages = {41--51}, keywords = {evolutionary computation}, ISBN = {}, url = {}, abstract = {we analyse two proteomic pattern datasets containing measurement s from ovarian and prostate cancer samples. In particular, a linear and a quadratic support vector machine (SVM) are applied to the data for distinguishing between cancer and benign status. On the ovarian dataset SVM gives excellent results, while the prostate dataset seems to be a harder classification problem for SVM. The prostate dataset is further analysed by means of an evolutionary algorithm for feature selection (EAFS) that searches for small subsets of features in order to optimise the SVM performance. In general, the subsets of features generated by EAFS vary over different runs and over different data splitting in training and hold out sets. Nevertheless, particular features occur more frequently over all the runs. The role of these ``core'' features as potential tumour biomarkers deserves further study.}, notes = {EvoWorkshops2004}, } @InProceedings{matsumaru:evows04, author = {Naoki Matsumaru and Florian Centler and Klaus-Peter Zauner and Peter Dittrich}, title = {Self-adaptive Scouting---Autonomous Experimentation for Systems Biology}, booktitle = {Applications of Evolutionary Computing, EvoWorkshops2004: {EvoBIO}, {EvoCOMNET}, {EvoHOT}, {EvoIASP}, {EvoMUSART}, {EvoSTOC}}, year = {2004}, month = {5-7 April}, editor = {Guenther R. Raidl and Stefano Cagnoni and Jurgen Branke and David W. Corne and Rolf Drechsler and Yaochu Jin and Colin Johnson and Penousal Machado and Elena Marchiori and Franz Rothlauf and George D. Smith and Giovanni Squillero}, series = {LNCS}, volume = {3005}, address = {Coimbra, Portugal}, publisher = {Springer Verlag}, publisher_address = {Berlin}, pages = {52--62}, keywords = {evolutionary computation}, ISBN = {}, url = {}, abstract = {We introduce an algorithm for autonomous experimentation. This algorithm uses evolution to drive exploration during scientific discovery. Population size and mutation strength are self adaptive. The only variables remaining to be set are the limits and maximum resolution of the parameters in the experiment. In practice, these are determined by instrumentation. Aside from conducting physical experiments, the algorithm is a valuable tool for investigating simulation models of biological systems. We illustrate the operation of the algorithm on a model of HIV immune system interaction. Finally, the difference between scouting and optimisation is discussed. }, notes = {EvoWorkshops2004}, } @InProceedings{moore:evows04, author = {Jason Moore and Lance Hahn}, title = {An Improved Grammatical Evolution Strategy for Hierarchical Petri Net Modeling of Complex Genetic Systems}, booktitle = {Applications of Evolutionary Computing, EvoWorkshops2004: {EvoBIO}, {EvoCOMNET}, {EvoHOT}, {EvoIASP}, {EvoMUSART}, {EvoSTOC}}, year = {2004}, month = {5-7 April}, editor = {Guenther R. Raidl and Stefano Cagnoni and Jurgen Branke and David W. Corne and Rolf Drechsler and Yaochu Jin and Colin Johnson and Penousal Machado and Elena Marchiori and Franz Rothlauf and George D. Smith and Giovanni Squillero}, series = {LNCS}, volume = {3005}, address = {Coimbra, Portugal}, publisher = {Springer Verlag}, publisher_address = {Berlin}, pages = {63--72}, keywords = {genetic algorithms, genetic programming, grammatical evolution, evolutionary computation}, ISBN = {}, url = {}, abstract = {DNA sequence variations impact human health through a hierarchy of biochemical and physiological systems. Understanding the hierarchical relationships in the genotype-phenotype mapping is expected to improve the diagnosis, prevention, and treatment of common, complex human diseases. We previously developed a hierarchical dynamic systems approach based on Petri nets for generating biochemical network models that are consistent with genetic models of disease susceptibility. This strategy uses an evolutionary computation approach called grammatical evolution for symbolic manipulation and optimization of Petri net models. We previously demonstrated that this approach routinely identifies biochemical network models that are consistent with a variety of complex genetic models in which disease susceptibility is determined by nonlinear interactions between two DNA sequence variations. However, the modeling strategy was generally not successful when extended to modelling nonlinear interactions between three DNA sequence variations. In the present study, we evaluate a modified grammar for building Petri net models of Riochemical systems that are consistent with high order genetic models of disease susceptibility. The results indicate that our hierarchical model building approach is capable of identifying perfect Petri net models when an appropriate grammar is used.}, notes = {EvoWorkshops2004}, } @InProceedings{nam:evows04, author = {Jin-Wu Nam and Je-Gun Joung and Young-Sirk Ahn and Byoung-Tak Zhang}, title = {Two-Step Genetic Programming for Optimization of {RNA} Common-Structure}, booktitle = {Applications of Evolutionary Computing, EvoWorkshops2004: {EvoBIO}, {EvoCOMNET}, {EvoHOT}, {EvoIASP}, {EvoMUSART}, {EvoSTOC}}, year = {2004}, month = {5-7 April}, editor = {Guenther R. Raidl and Stefano Cagnoni and Jurgen Branke and David W. Corne and Rolf Drechsler and Yaochu Jin and Colin Johnson and Penousal Machado and Elena Marchiori and Franz Rothlauf and George D. Smith and Giovanni Squillero}, series = {LNCS}, volume = {3005}, address = {Coimbra, Portugal}, publisher = {Springer Verlag}, publisher_address = {Berlin}, pages = {73--83}, keywords = {genetic algorithms, genetic programming, evolutionary computation}, ISBN = {}, url = {}, abstract = {We present an algorithm for identifying putative ncRNAs using an RCSG (RNA Common Structural Grammar) and show the effectiveness of the algorithm. The algorithm consists of two steps: structure learning step and sequence learning step. Both steps are based on genetic programming. Generally genetic programming has been applied to learn programs automatically, reconstruct networks, and predict protein secondary structures. In this study, we have applied genetic programming to optimise structural grammars. The structural grammars can be formulated by some rules as tree structure including function variables. They can be learned by genetic programming. We have defined the rules on how structure definition grammars can be encoded into function trees. The results we obtained from the experiments with RCSG of tRNA and 5S small rRNA and demonstrate the efficiency of our algorithm.}, notes = {EvoWorkshops2004}, } @InProceedings{rocha:evows04, author = {Miguel Rocha and Jos\'e Neves and Isabel Rocha and Eug\'enio Ferreira}, title = {Evolutionary Algorithms for Optimal Control in Fed-batch Fermentation Processes}, booktitle = {Applications of Evolutionary Computing, EvoWorkshops2004: {EvoBIO}, {EvoCOMNET}, {EvoHOT}, {EvoIASP}, {EvoMUSART}, {EvoSTOC}}, year = {2004}, month = {5-7 April}, editor = {Guenther R. Raidl and Stefano Cagnoni and Jurgen Branke and David W. Corne and Rolf Drechsler and Yaochu Jin and Colin Johnson and Penousal Machado and Elena Marchiori and Franz Rothlauf and George D. Smith and Giovanni Squillero}, series = {LNCS}, volume = {3005}, address = {Coimbra, Portugal}, publisher = {Springer Verlag}, publisher_address = {Berlin}, pages = {84--93}, keywords = {evolutionary computation}, ISBN = {}, url = {}, abstract = {Evolutionary Algorithms (EAs) are used to achieve optimal feedforward control in a recombinant bacterial fed batch fermentation process, that aims at producing a bio-pharmaceutical product. Three different aspects are the target of the optimisation procedure: the feeding trajectory (the amount of substrate introduced in a bioreactor per time unit), the duration of the fermentation and the initial conditions of the process. An EA with variable size chromosomes and using real valued representations is proposed that is capable of simultaneously optimizing the aforementioned aspects. Outstanding productivity levels were achieved and the results are validated by practice.}, notes = {EvoWorkshops2004}, } @InProceedings{shen:evows04, author = {Jian Shen and Robert Heckendorn}, title = {Discrete Branch Length Representations for Genetic Algorithms in Phylogenetic Search}, booktitle = {Applications of Evolutionary Computing, EvoWorkshops2004: {EvoBIO}, {EvoCOMNET}, {EvoHOT}, {EvoIASP}, {EvoMUSART}, {EvoSTOC}}, year = {2004}, month = {5-7 April}, editor = {Guenther R. Raidl and Stefano Cagnoni and Jurgen Branke and David W. Corne and Rolf Drechsler and Yaochu Jin and Colin Johnson and Penousal Machado and Elena Marchiori and Franz Rothlauf and George D. Smith and Giovanni Squillero}, series = {LNCS}, volume = {3005}, address = {Coimbra, Portugal}, publisher = {Springer Verlag}, publisher_address = {Berlin}, pages = {94--103}, keywords = {evolutionary computation}, ISBN = {}, url = {}, abstract = {Likelihood analysis for phylogenetics is a well suited domain for optimisation by genetic algorithm. A major factor in the performance of genetic algorithms is representation and operators. We present promising preliminary results on using a discrete set of edge lengths in the phylogenetic trees. We find that discretizing the edge lengths changes the fundamental character of the search and can produce higher quality trees. Our results suggest a search that is more robust to traps in local optima and an opportunity to better control the balance between topology search and edge length search.}, notes = {EvoWorkshops2004}, } @InProceedings{spieth:evows04, author = {Christian Spieth and Felix Streichert and Nora Speer and Andreas Zell}, title = {Iteratively Inferring Gene Regulatory Networks with Virtual Knockout Experiments}, booktitle = {Applications of Evolutionary Computing, EvoWorkshops2004: {EvoBIO}, {EvoCOMNET}, {EvoHOT}, {EvoIASP}, {EvoMUSART}, {EvoSTOC}}, year = {2004}, month = {5-7 April}, editor = {Guenther R. Raidl and Stefano Cagnoni and Jurgen Branke and David W. Corne and Rolf Drechsler and Yaochu Jin and Colin Johnson and Penousal Machado and Elena Marchiori and Franz Rothlauf and George D. Smith and Giovanni Squillero}, series = {LNCS}, volume = {3005}, address = {Coimbra, Portugal}, publisher = {Springer Verlag}, publisher_address = {Berlin}, pages = {104--112}, keywords = {evolutionary computation}, ISBN = {}, url = {}, abstract = {we publisher_address the problem of finding gene regulatory networks from experimental DNA microarray data. We introduce enhancements to an Evolutionary Algorithm optimisation process to infer the parameters of the non-linear system given by the observed data more reliably and precisely. Due to the limited number of available data the inferring problem is under determined and ambiguous. Further on, the problem often is multi-modal and therefore appropriate optimization strategies become necessary. Therefore, we propose a method, which will suggest necessary additional biological experiments to remove the ambiguities.}, notes = {EvoWorkshops2004}, } @InProceedings{thomsen:evows04, author = {Ren\'{e} Thomsen and Wouter Boomsma}, title = {Multiple Sequence Alignment Using {SAGA}: Investigating the Effects of Operator Scheduling, Population Seeding, and Crossover Operators}, booktitle = {Applications of Evolutionary Computing, EvoWorkshops2004: {EvoBIO}, {EvoCOMNET}, {EvoHOT}, {EvoIASP}, {EvoMUSART}, {EvoSTOC}}, year = {2004}, month = {5-7 April}, editor = {Guenther R. Raidl and Stefano Cagnoni and Jurgen Branke and David W. Corne and Rolf Drechsler and Yaochu Jin and Colin Johnson and Penousal Machado and Elena Marchiori and Franz Rothlauf and George D. Smith and Giovanni Squillero}, series = {LNCS}, volume = {3005}, address = {Coimbra, Portugal}, publisher = {Springer Verlag}, publisher_address = {Berlin}, pages = {113--122}, keywords = {evolutionary computation}, ISBN = {}, url = {}, abstract = {Multiple sequence alignment (MSA) is a fundamental problem of great importance in molecular biology. In this study, we investigated several aspects of SAGA, a well known evolutionary algorithm (EA) for solving MSA problems. The SAGA algorithm is important because it represents a successful attempt at applying EAs to MSA and since it is the first EA to use operator scheduling on this problem. However, it is largely undocumented which elements of SAGA are vital to its performance. An important finding in this study is that operator scheduling does not improve the performance of SAGA compared to a uniform selection of operators. Furthermore, the experiments show that seeding SAGA with a ClustalW derived alignment allows the algorithm to discover alignments of higher quality compared to the traditional initialisation scheme with randomly generated alignments. Finally, the experimental results indicate that SAGA's performance is largely unaffected when the crossover operators are disabled. Thus, the major determinant of SAGA's success seems to be the mutation operators and the scoring functions used.}, notes = {EvoWorkshops2004}, } @InProceedings{vandecasteele:evows04, author = {Frederik P. J. Vandecasteele and Thomas F. Hess and Ronald L. Crawford}, title = {Constructing Microbial Consortia with Minimal Growth Using a Genetic Algorithm}, booktitle = {Applications of Evolutionary Computing, EvoWorkshops2004: {EvoBIO}, {EvoCOMNET}, {EvoHOT}, {EvoIASP}, {EvoMUSART}, {EvoSTOC}}, year = {2004}, month = {5-7 April}, editor = {Guenther R. Raidl and Stefano Cagnoni and Jurgen Branke and David W. Corne and Rolf Drechsler and Yaochu Jin and Colin Johnson and Penousal Machado and Elena Marchiori and Franz Rothlauf and George D. Smith and Giovanni Squillero}, series = {LNCS}, volume = {3005}, address = {Coimbra, Portugal}, publisher = {Springer Verlag}, publisher_address = {Berlin}, pages = {123--129}, keywords = {evolutionary computation}, ISBN = {}, url = {}, abstract = {The processes occurring in microbial ecosystems are typically governed by the actions of many different microorganisms that can all interact with each other in a highly nonlinear way. Historically, most work in microbiology has been focused on pure cultures of single organisms, while the study of groups of organisms (consortia) still forms a major challenge. Although genetic algorithms are capable of optimising noisy and nonlinear systems and they should therefore be very well suited for studying microbial ecology, they have only rarely been used in this field. In this work, a genetic algorithm was successfully used to construct microbial consortia exhibiting minimal growth from separate isolated fast growing strains. The technique developed here may open the way to new ecological insights.}, notes = {EvoWorkshops2004}, } @InProceedings{jedidi:evows04, author = {Adel Jedidi and Alexandre Caminada and Gerd Finke}, title = {2-Objective Optimization of Cells Overlap and Geometry with Evolutionary Algorithms}, booktitle = {Applications of Evolutionary Computing, EvoWorkshops2004: {EvoBIO}, {EvoCOMNET}, {EvoHOT}, {EvoIASP}, {EvoMUSART}, {EvoSTOC}}, year = {2004}, month = {5-7 April}, editor = {Guenther R. Raidl and Stefano Cagnoni and Jurgen Branke and David W. Corne and Rolf Drechsler and Yaochu Jin and Colin Johnson and Penousal Machado and Elena Marchiori and Franz Rothlauf and George D. Smith and Giovanni Squillero}, series = {LNCS}, volume = {3005}, address = {Coimbra, Portugal}, publisher = {Springer Verlag}, publisher_address = {Berlin}, pages = {130--139}, keywords = {evolutionary computation}, ISBN = {}, url = {}, abstract = {Cellular network design is a very large and complex combinatorial optimisation problem. It consists of antenna location and parameters settings. Until now, the design is done using radio quality criteria. Radio coverage, traffic capacity and field overlap are the main factors considered within optimisation process to make decisions about network solutions. Nevertheless, such objectives do not lead to an efficient organisation of network cells whereas this is a major assessment for radio expert planners. Absence of a clear geometrical structure of network cells prevents experts using many theoretical concepts on network design. We proposes a model to evaluate the cell shape and a bi-criteria approach using an Evolutionary Algorithm to handle cells overlap and cells geometry as criteria for real life network optimisation.}, notes = {EvoWorkshops2004}, } @InProceedings{livramento:evows04, author = {Silvana Livramento and Arnaldo Vieira Moura and Fl\'avio Keidi Miyazawa and M\'ario Massato Harada and Rog\'erio Albertoni Miranda}, title = {A Genetic Algorithm for Telecommunication Network Design}, booktitle = {Applications of Evolutionary Computing, EvoWorkshops2004: {EvoBIO}, {EvoCOMNET}, {EvoHOT}, {EvoIASP}, {EvoMUSART}, {EvoSTOC}}, year = {2004}, month = {5-7 April}, editor = {Guenther R. Raidl and Stefano Cagnoni and Jurgen Branke and David W. Corne and Rolf Drechsler and Yaochu Jin and Colin Johnson and Penousal Machado and Elena Marchiori and Franz Rothlauf and George D. Smith and Giovanni Squillero}, series = {LNCS}, volume = {3005}, address = {Coimbra, Portugal}, publisher = {Springer Verlag}, publisher_address = {Berlin}, pages = {140--149}, keywords = {evolutionary computation}, ISBN = {}, url = {}, abstract = {A Genetic Algorithm (GA) to solve a problem in telecommunication network design is described. The problem is to partition a large urban project area into smaller service sections, which can be controlled by a single standard communication switch. The GA incorporates geometric and topological information from the project area by operating directly with a grid of geographically dispersed demand points. Computational results show this to be a promising technique for partitioning the project area and positioning the control switches. Tests were realized with real instances taken from large areas in the city of Sao Paulo.}, notes = {EvoWorkshops2004}, } @InProceedings{talay:evows04, author = {A. Cagatay Talay and Sema Oktug}, title = {A GA/Heuristic Hybrid Technique for Routing and Wavelength Assignment in WDM Networks}, booktitle = {Applications of Evolutionary Computing, EvoWorkshops2004: {EvoBIO}, {EvoCOMNET}, {EvoHOT}, {EvoIASP}, {EvoMUSART}, {EvoSTOC}}, year = {2004}, month = {5-7 April}, editor = {Guenther R. Raidl and Stefano Cagnoni and Jurgen Branke and David W. Corne and Rolf Drechsler and Yaochu Jin and Colin Johnson and Penousal Machado and Elena Marchiori and Franz Rothlauf and George D. Smith and Giovanni Squillero}, series = {LNCS}, volume = {3005}, address = {Coimbra, Portugal}, publisher = {Springer Verlag}, publisher_address = {Berlin}, pages = {150--159}, keywords = {evolutionary computation}, ISBN = {}, url = {}, abstract = {The routing and wavelength assignment problem which is known to be NP-hard, in all optical transport networks is considered. The present literature on this topic contains a lot of heuristics. These heuristics, however, have limited applicability because they have a number of fundamental problems including high time complexity, and lack of scalability with respect to optimal solutions. We propose a hybrid genetic algorithm/heuristic based algorithm. A cost model that incorporates a dependency on link wavelength requirements is adopted. The hybrid algorithm presented uses an object-oriented representation of networks, and incorporates four operators: semi-adaptive path mutation, single-point crossover, reroute, and shift-out. Experimental results of the test networks make clear that, when the network cost depends on heavily wavelength assignment, the proposed GA/Heuristic hybrid approach provides promising results compared to recent wavelength assignment heuristics.}, notes = {EvoWorkshops2004}, } @InProceedings{blesa:evows04, author = {Maria Blesa and Christian Blum}, title = {Ant Colony Optimization for the Maximum Edge-Disjoint Paths Problem}, booktitle = {Applications of Evolutionary Computing, EvoWorkshops2004: {EvoBIO}, {EvoCOMNET}, {EvoHOT}, {EvoIASP}, {EvoMUSART}, {EvoSTOC}}, year = {2004}, month = {5-7 April}, editor = {Guenther R. Raidl and Stefano Cagnoni and Jurgen Branke and David W. Corne and Rolf Drechsler and Yaochu Jin and Colin Johnson and Penousal Machado and Elena Marchiori and Franz Rothlauf and George D. Smith and Giovanni Squillero}, series = {LNCS}, volume = {3005}, address = {Coimbra, Portugal}, publisher = {Springer Verlag}, publisher_address = {Berlin}, pages = {160--169}, keywords = {evolutionary computation}, ISBN = {}, url = {}, abstract = {Given a graph G representing a network topology, and a collection T={(s_1,t_1)...(s_k,t_k)} of pairs of vertices in G representing connection request, the maximum edge disjoint paths problem is an NP-hard problem which consists in determining the maximum number of pairs in T that can be routed in $G$ by mutually edge-disjoint s_i-t_i paths. We propose an Ant Colony Optimization (ACO) algorithm to solve this problem. ACO algorithms are inspired by the foraging behaviour of real ants, whose distributed nature makes them suitable for the application in network environments. Our current version is aimed for the application in static graphs. In comparison to a multi-start greedy approach, our algorithm has advantages especially when speed is an issue.}, notes = {EvoWorkshops2004}, } @InProceedings{comellas:evows04, author = {Francesc Comellas and Cristina Dalf\'o}, title = {Using Genetic Programming to Design Broadcasting Algorithms for Manhattan Street Networks}, booktitle = {Applications of Evolutionary Computing, EvoWorkshops2004: {EvoBIO}, {EvoCOMNET}, {EvoHOT}, {EvoIASP}, {EvoMUSART}, {EvoSTOC}}, year = {2004}, month = {5-7 April}, editor = {Guenther R. Raidl and Stefano Cagnoni and Jurgen Branke and David W. Corne and Rolf Drechsler and Yaochu Jin and Colin Johnson and Penousal Machado and Elena Marchiori and Franz Rothlauf and George D. Smith and Giovanni Squillero}, series = {LNCS}, volume = {3005}, address = {Coimbra, Portugal}, publisher = {Springer Verlag}, publisher_address = {Berlin}, pages = {170--177}, keywords = {genetic algorithms, genetic programming, evolutionary computation}, ISBN = {}, url = {}, abstract = {Broadcasting is the process of disseminating a message from a node of a communication network to all other nodes as quickly as possible. We consider Manhattan Street Networks (MSNs) which are mesh-structured, toroidal, directed, regular networks such that locally they resemble the geographical topology of the avenues and streets of Manhattan. With the use of genetic programming we have generated broadcasting algorithms for 2-dimensional and 3-dimensional MSNs.}, notes = {EvoWorkshops2004}, } @InProceedings{araujo:evows04, author = {S\'{e}rgio {Granato de Ara\'{u}jo} and Ant\^{o}nio {Carneiro de Mesquita Filho} and Aloysio {de Castro Pinto Pedroza}}, title = {A Scenario-Based Approach to Protocol Design Using Evolutionary Techniques}, booktitle = {Applications of Evolutionary Computing, EvoWorkshops2004: {EvoBIO}, {EvoCOMNET}, {EvoHOT}, {EvoIASP}, {EvoMUSART}, {EvoSTOC}}, year = {2004}, month = {5-7 April}, editor = {Guenther R. Raidl and Stefano Cagnoni and Jurgen Branke and David W. Corne and Rolf Drechsler and Yaochu Jin and Colin Johnson and Penousal Machado and Elena Marchiori and Franz Rothlauf and George D. Smith and Giovanni Squillero}, series = {LNCS}, volume = {3005}, address = {Coimbra, Portugal}, publisher = {Springer Verlag}, publisher_address = {Berlin}, pages = {178--187}, keywords = {evolutionary computation}, ISBN = {}, url = {}, abstract = {An evolutionary approach to design communication protocols from scenario based specifications is presented. It enables to automatically generate finite-state models of protocol entities from Message Sequence Charts. By converting the Message Sequence Charts into input/output sequences, the problem reduces to evolving finite state machines with the specified input/output behaviours. The proposed approach does not over generalise the entity behaviour producing, by construction, minimal, deterministic and completely specified finite state machines.}, notes = {EvoWorkshops2004}, } @InProceedings{berntsson:evows04, author = {Johan Berntsson and Maolin Tang}, title = {A Slicing Structure Representation for the Multi-Layer Floorplan Layout Problem}, booktitle = {Applications of Evolutionary Computing, EvoWorkshops2004: {EvoBIO}, {EvoCOMNET}, {EvoHOT}, {EvoIASP}, {EvoMUSART}, {EvoSTOC}}, year = {2004}, month = {5-7 April}, editor = {Guenther R. Raidl and Stefano Cagnoni and Jurgen Branke and David W. Corne and Rolf Drechsler and Yaochu Jin and Colin Johnson and Penousal Machado and Elena Marchiori and Franz Rothlauf and George D. Smith and Giovanni Squillero}, series = {LNCS}, volume = {3005}, address = {Coimbra, Portugal}, publisher = {Springer Verlag}, publisher_address = {Berlin}, pages = {188--197}, keywords = {evolutionary computation}, ISBN = {}, url = {}, abstract = {This is a preliminary study in which we use a genetic algorithm to solve the multiple layer floor planning problem. The original contribution is a three dimensional slicing structure representation which, to the best of our knowledge, is the first 3D floor plan representation in the literature. We give some background on VLSI design and the floor planning problem before describing the slicing structure representation and the genetic algorithm extensions. We present results for benchmark problems and obtain improvements on previously published results for single layer floor planning.}, notes = {EvoWorkshops2004}, } @InProceedings{drechsler:evows04, author = {Nicole Drechsler and Mario Hilgemeier and G\"orschwin Fey and Rolf Drechsler}, title = {Disjoint Sum of Product Minimization by Evolutionary Algorithms}, booktitle = {Applications of Evolutionary Computing, EvoWorkshops2004: {EvoBIO}, {EvoCOMNET}, {EvoHOT}, {EvoIASP}, {EvoMUSART}, {EvoSTOC}}, year = {2004}, month = {5-7 April}, editor = {Guenther R. Raidl and Stefano Cagnoni and Jurgen Branke and David W. Corne and Rolf Drechsler and Yaochu Jin and Colin Johnson and Penousal Machado and Elena Marchiori and Franz Rothlauf and George D. Smith and Giovanni Squillero}, series = {LNCS}, volume = {3005}, address = {Coimbra, Portugal}, publisher = {Springer Verlag}, publisher_address = {Berlin}, pages = {198--207}, keywords = {evolutionary computation}, ISBN = {}, url = {}, abstract = {Recently, an approach has been presented to minimise Disjoint Sum-of-Products (DSOPs) based on Binary Decision Diagrams (BDDs). Due to the symbolic representation of cubes for large problem instances, the method is orders of magnitude faster than previous enumerative techniques. But the quality of the approach largely depends on the variable ordering of the underlying BDD. Evolutionary Algorithm (EA) optimise the DSOP representation of a given Boolean function. The EA is used to find an optimized variable ordering for the BDD representation. Then the DSOP is derived from the optimised BDD using structural and symbolic techniques. Experiments are performed to adjust the parameters of the EA. Experimental results are given to demonstrate the efficiency of the approach.}, notes = {EvoWorkshops2004}, } @InProceedings{fuhner:evows04, author = {Tim F\"{u}hner and Andreas Erdmann and Rich\'{a}rd Farkas and Bernd Tollk\"{u}hn and Gabriella K\'{o}kai}, title = {Genetic Algorithms to Improve Mask and Illumination Geometries in Lithographic Imaging Systems}, booktitle = {Applications of Evolutionary Computing, EvoWorkshops2004: {EvoBIO}, {EvoCOMNET}, {EvoHOT}, {EvoIASP}, {EvoMUSART}, {EvoSTOC}}, year = {2004}, month = {5-7 April}, editor = {Guenther R. Raidl and Stefano Cagnoni and Jurgen Branke and David W. Corne and Rolf Drechsler and Yaochu Jin and Colin Johnson and Penousal Machado and Elena Marchiori and Franz Rothlauf and George D. Smith and Giovanni Squillero}, series = {LNCS}, volume = {3005}, address = {Coimbra, Portugal}, publisher = {Springer Verlag}, publisher_address = {Berlin}, pages = {208--218}, keywords = {evolutionary computation}, ISBN = {}, url = {}, abstract = {proposes the use of a genetic algorithm to optimise mask and illumination geometries in optical projection lithography. A fitness function is introduced that evaluates the imaging quality of arbitrary line patterns in a specified focus range. As a second criterion the manufacturability and inspectability of the mask are taken into account. With this approach optimum imaging conditions can be identified without any additional a-priori knowledge of the lithographic process. Several examples demonstrate the successful application and further potentials of the proposed concept.}, notes = {EvoWorkshops2004}, } @InProceedings{pires:evows04, author = {Eduardo Jos\'e {Solteiro Pires} and Paulo B. {de Moura Oliveira} and Jos\'e Ant\'onio {Tenreiro Machado}}, title = {Multi-Objective Genetic Manipulator Trajectory Planner}, booktitle = {Applications of Evolutionary Computing, EvoWorkshops2004: {EvoBIO}, {EvoCOMNET}, {EvoHOT}, {EvoIASP}, {EvoMUSART}, {EvoSTOC}}, year = {2004}, month = {5-7 April}, editor = {Guenther R. Raidl and Stefano Cagnoni and Jurgen Branke and David W. Corne and Rolf Drechsler and Yaochu Jin and Colin Johnson and Penousal Machado and Elena Marchiori and Franz Rothlauf and George D. Smith and Giovanni Squillero}, series = {LNCS}, volume = {3005}, address = {Coimbra, Portugal}, publisher = {Springer Verlag}, publisher_address = {Berlin}, pages = {219--229}, keywords = {evolutionary computation}, ISBN = {}, url = {}, abstract = {proposes a multi-objective genetic algorithm to optimise a manipulator trajectory. The planner has several objectives namely the minimisation of the space and join arm displacements and the energy required in the trajectory, without colliding with any obstacles in the workspace. Simulations results are presented for robots with two and three degrees of freedom, considering the optimization of two and three objectives.}, notes = {EvoWorkshops2004}, } @InProceedings{sanchez:evows04, author = {Ernesto Sanchez and Giovanni Squillero and Massimo Violante}, title = {Exploiting HW Acceleration for Classifying Complex Test Program Generation Problems}, booktitle = {Applications of Evolutionary Computing, EvoWorkshops2004: {EvoBIO}, {EvoCOMNET}, {EvoHOT}, {EvoIASP}, {EvoMUSART}, {EvoSTOC}}, year = {2004}, month = {5-7 April}, editor = {Guenther R. Raidl and Stefano Cagnoni and Jurgen Branke and David W. Corne and Rolf Drechsler and Yaochu Jin and Colin Johnson and Penousal Machado and Elena Marchiori and Franz Rothlauf and George D. Smith and Giovanni Squillero}, series = {LNCS}, volume = {3005}, address = {Coimbra, Portugal}, publisher = {Springer Verlag}, publisher_address = {Berlin}, pages = {230--239}, keywords = {evolutionary computation}, ISBN = {}, url = {}, abstract = {We present a complete framework to examine, evaluate and characterise an evolutionary test-program generation problem. Our methodology is based on a local analysis of the relationships between genotype and fitness. Furthermore we propose the adoption of a hardware accelerator device for speeding up program cultivation. A commercial, complex microprocessor was used as case study. Experimental analysis allows discovering the characteristics of the specific task and foreseeing the behaviour of the test-program generation.}, notes = {EvoWorkshops2004}, } @InProceedings{sekanina:evows04, author = {Luk\'{a}\v{s} Sekanina}, title = {Evolutionary Design Space Exploration for Median Circuits}, booktitle = {Applications of Evolutionary Computing, EvoWorkshops2004: {EvoBIO}, {EvoCOMNET}, {EvoHOT}, {EvoIASP}, {EvoMUSART}, {EvoSTOC}}, year = {2004}, month = {5-7 April}, editor = {Guenther R. Raidl and Stefano Cagnoni and Jurgen Branke and David W. Corne and Rolf Drechsler and Yaochu Jin and Colin Johnson and Penousal Machado and Elena Marchiori and Franz Rothlauf and George D. Smith and Giovanni Squillero}, series = {LNCS}, volume = {3005}, address = {Coimbra, Portugal}, publisher = {Springer Verlag}, publisher_address = {Berlin}, pages = {240--249}, keywords = {genetic algorithms, genetic programming, cartesian genetic programming, evolutionary computation}, ISBN = {}, url = {}, abstract = {It is possible to (1) discover novel implementations of median circuits using evolutionary techniques and (2) find out suitable median circuits in case that only limited resources are available for their implementation. These problems are approached using Cartesian genetic programming and an ordinary compare--swap encoding. Combining the proposed approaches a method is demonstrated for effective exploration of the design space of median circuits under various constraints.}, notes = {EvoWorkshops2004}, } @InProceedings{ballerini:evows04, author = {Lucia Ballerini and Lennart Franz{\'e}n}, title = {Genetic Optimization of Morphological Filters with Applications in Breast Cancer Detection}, booktitle = {Applications of Evolutionary Computing, EvoWorkshops2004: {EvoBIO}, {EvoCOMNET}, {EvoHOT}, {EvoIASP}, {EvoMUSART}, {EvoSTOC}}, year = {2004}, month = {5-7 April}, editor = {Guenther R. Raidl and Stefano Cagnoni and Jurgen Branke and David W. Corne and Rolf Drechsler and Yaochu Jin and Colin Johnson and Penousal Machado and Elena Marchiori and Franz Rothlauf and George D. Smith and Giovanni Squillero}, series = {LNCS}, volume = {3005}, address = {Coimbra, Portugal}, publisher = {Springer Verlag}, publisher_address = {Berlin}, pages = {250--259}, keywords = {evolutionary computation}, ISBN = {}, url = {}, abstract = {we apply genetic algorithms to morphological filter optimization. The validation of the method is illustrated by performing experiments with synthetic images, whose optimal filter is known. Applications to microscopic images of breast tissue are reported. The medical problem consists in the discrimination between cancerous tissue and normal one.}, notes = {EvoWorkshops2004}, } @InProceedings{ballerini2:evows04, author = {Lucia Ballerini and Leonardo Bocchi and Carina B. Johansson}, title = {Image Segmentation by a Genetic Fuzzy c-Means Algorithm using Color and Spatial Information}, booktitle = {Applications of Evolutionary Computing, EvoWorkshops2004: {EvoBIO}, {EvoCOMNET}, {EvoHOT}, {EvoIASP}, {EvoMUSART}, {EvoSTOC}}, year = {2004}, month = {5-7 April}, editor = {Guenther R. Raidl and Stefano Cagnoni and Jurgen Branke and David W. Corne and Rolf Drechsler and Yaochu Jin and Colin Johnson and Penousal Machado and Elena Marchiori and Franz Rothlauf and George D. Smith and Giovanni Squillero}, series = {LNCS}, volume = {3005}, address = {Coimbra, Portugal}, publisher = {Springer Verlag}, publisher_address = {Berlin}, pages = {260--269}, keywords = {evolutionary computation, colour computer vision}, ISBN = {}, url = {}, abstract = {clustering algorithm for color image segmentation. We combine the classical fuzzy c-means algorithm (FCM) with a genetic algorithm (GA), and we modify the objective function of the FCM for taking into account the spatial information of image data and the intensity inhomogeneities. An application to medical images is presented. Experiments show that the proposed algorithm provides a useful method for image segmentation, without the need of a prefiltering step for background estimation. Moreover, the segmentation of noise images is effectively improved.}, notes = {EvoWorkshops2004}, } @InProceedings{brabazon:evows04, author = {Anthony Brabazon and Michael O'Neill}, title = {Bond-Issuer Credit Rating with Grammatical Evolution}, booktitle = {Applications of Evolutionary Computing, EvoWorkshops2004: {EvoBIO}, {EvoCOMNET}, {EvoHOT}, {EvoIASP}, {EvoMUSART}, {EvoSTOC}}, year = {2004}, month = {5-7 April}, editor = {Guenther R. Raidl and Stefano Cagnoni and Jurgen Branke and David W. Corne and Rolf Drechsler and Yaochu Jin and Colin Johnson and Penousal Machado and Elena Marchiori and Franz Rothlauf and George D. Smith and Giovanni Squillero}, series = {LNCS}, volume = {3005}, address = {Coimbra, Portugal}, publisher = {Springer Verlag}, publisher_address = {Berlin}, pages = {270--279}, keywords = {genetic algorithms, genetic programming, grammatical evolution, evolutionary computation}, ISBN = {}, url = {}, abstract = {This study examines the utility of Grammatical Evolution in modelling the corporate bond-issuer credit rating process, using information drawn from the financial statements of bond-issuing firms. Financial data, and the associated Standard & Poor's issuer-credit ratings of 791 US firms, drawn from the year 1999/2000 are used to train and test the model. The best developed model was found to be able to discriminate in-sample (out-of-sample) between investment-grade and junk bond ratings with an average accuracy of 87.59 (84.92)% across a five-fold cross validation. The results suggest that the two classifications of credit rating can be predicted with notable accuracy from a relatively limited subset of firm-specific financial data, using Grammatical Evolution.}, notes = {EvoWorkshops2004}, } @InProceedings{cooper:evows04, author = {Crispin Cooper and David Howard and Andy M. Tyrrell}, title = {Using GAs to Create a Waveguide Model of the Oral Vocal Tract}, booktitle = {Applications of Evolutionary Computing, EvoWorkshops2004: {EvoBIO}, {EvoCOMNET}, {EvoHOT}, {EvoIASP}, {EvoMUSART}, {EvoSTOC}}, year = {2004}, month = {5-7 April}, editor = {Guenther R. Raidl and Stefano Cagnoni and Jurgen Branke and David W. Corne and Rolf Drechsler and Yaochu Jin and Colin Johnson and Penousal Machado and Elena Marchiori and Franz Rothlauf and George D. Smith and Giovanni Squillero}, series = {LNCS}, volume = {3005}, address = {Coimbra, Portugal}, publisher = {Springer Verlag}, publisher_address = {Berlin}, pages = {280--288}, keywords = {evolutionary computation}, ISBN = {}, url = {}, abstract = {A Digital Waveguide Mesh is introduced as a method for acoustic modelling. Genetic Algorithms are applied to evolve the structure of a mesh to simulate the human throat and mouth, producing vowel-like sounds. The evolved shapes are compared to actual shapes adopted by the oral vocal tract during speech. The evolutionary methods are "tuned" for implementation on a new hardware device being developed under the POEtic project. Initial results are promising.}, notes = {EvoWorkshops2004}, } @InProceedings{cui:evows04, author = {Jin-shi Cui and Zeng-qi Sun}, title = {Vision-Based Hand Motion Capture Using Genetic Algorithm}, booktitle = {Applications of Evolutionary Computing, EvoWorkshops2004: {EvoBIO}, {EvoCOMNET}, {EvoHOT}, {EvoIASP}, {EvoMUSART}, {EvoSTOC}}, year = {2004}, month = {5-7 April}, editor = {Guenther R. Raidl and Stefano Cagnoni and Jurgen Branke and David W. Corne and Rolf Drechsler and Yaochu Jin and Colin Johnson and Penousal Machado and Elena Marchiori and Franz Rothlauf and George D. Smith and Giovanni Squillero}, series = {LNCS}, volume = {3005}, address = {Coimbra, Portugal}, publisher = {Springer Verlag}, publisher_address = {Berlin}, pages = {289--300}, keywords = {evolutionary computation}, ISBN = {}, url = {}, abstract = {3D hand motion capture plays an important role in multi-modal human-computer interfaces. Existing vision-based approaches mainly include two directions: model-based optimization framework and appearance-based learning approach. The main obstacle to handle with human hand motion capture is the high dimensionality associated with a full degree-of-freedom (DOF) articulated model. vision-based 3D hand motion capture algorithm is proposed. It views hand pose estimation and motion tracking as search prob-lems and utilizes genetic algorithm (GA). Firstly, a learning integrating with op-timization approach is introduced to estimate initial hand pose in 3D model based framework. And then a motion tracking method using GA-based particle filter (PF) is proposed to deal with the tracking problem in high-dimensional and multi-modal state space. Experimental results show that present approach significantly improves performance of motion tracking, especially in high-dimensional configuration space.}, notes = {EvoWorkshops2004}, } @InProceedings{duarte:evows04, author = {Abraham Duarte and \'Angel S\'anchez and Felipe Fern\'andez and Antonio S. Montemayor and Juan J. Pantrigo}, title = {Top-Down Evolutionary Image Segmentation using a Hierarchical Social Metaheuristic}, booktitle = {Applications of Evolutionary Computing, EvoWorkshops2004: {EvoBIO}, {EvoCOMNET}, {EvoHOT}, {EvoIASP}, {EvoMUSART}, {EvoSTOC}}, year = {2004}, month = {5-7 April}, editor = {Guenther R. Raidl and Stefano Cagnoni and Jurgen Branke and David W. Corne and Rolf Drechsler and Yaochu Jin and Colin Johnson and Penousal Machado and Elena Marchiori and Franz Rothlauf and George D. Smith and Giovanni Squillero}, series = {LNCS}, volume = {3005}, address = {Coimbra, Portugal}, publisher = {Springer Verlag}, publisher_address = {Berlin}, pages = {301--311}, keywords = {evolutionary computation}, ISBN = {}, url = {}, abstract = {an application of a hierarchical social (HS) metaheuristic to region-based segmentation. The original image is modelled as a simplified image graph, which is successively partitioned into two regions, corresponding to the most significant components of the actual image, until a termination condition is met. The graph-partitioning task is solved as a variant of the min-cut problem (normalized cut) using an HS metaheuristic. The computational efficiency of the proposed algorithm for the normalized cut computation improves the performance of a standard genetic algorithm. We applied the HS approach to brightness segmentation on various synthetic and real images, with stimulating trade-off results between execution time and segmentation quality.}, notes = {EvoWorkshops2004}, } @InProceedings{dunn:evows04, author = {Enrique Dunn and Gustavo Olague}, title = {Multi-objective Sensor Planning for Efficient and Accurate Object Reconstruction}, booktitle = {Applications of Evolutionary Computing, EvoWorkshops2004: {EvoBIO}, {EvoCOMNET}, {EvoHOT}, {EvoIASP}, {EvoMUSART}, {EvoSTOC}}, year = {2004}, month = {5-7 April}, editor = {Guenther R. Raidl and Stefano Cagnoni and Jurgen Branke and David W. Corne and Rolf Drechsler and Yaochu Jin and Colin Johnson and Penousal Machado and Elena Marchiori and Franz Rothlauf and George D. Smith and Giovanni Squillero}, series = {LNCS}, volume = {3005}, address = {Coimbra, Portugal}, publisher = {Springer Verlag}, publisher_address = {Berlin}, pages = {312--321}, keywords = {evolutionary computation}, ISBN = {}, url = {}, abstract = {sensor planning, which incorporates multi-objective optimization principals into the autonomous design of sensing strategies, is presented. The study addresses planning the behavior of an automated 3D inspection system, consisting of a manipulator robot in an Eye-on-Hand configuration. Task planning in this context is stated as a constrained multi-objective optimization problem, where reconstruction accuracy and robot motion efficiency are the criteria to optimize. An approach based on evolutionary computation is developed and experimental results shown. The obtained convex Pareto front of solutions confirms the conflict among objectives in our planning.}, notes = {EvoWorkshops2004}, } @InProceedings{kim:evows04, author = {Sung-Min Kim and Wonha Kim}, title = {An Algorithm for Segmenting Gaseous Objects on Images}, booktitle = {Applications of Evolutionary Computing, EvoWorkshops2004: {EvoBIO}, {EvoCOMNET}, {EvoHOT}, {EvoIASP}, {EvoMUSART}, {EvoSTOC}}, year = {2004}, month = {5-7 April}, editor = {Guenther R. Raidl and Stefano Cagnoni and Jurgen Branke and David W. Corne and Rolf Drechsler and Yaochu Jin and Colin Johnson and Penousal Machado and Elena Marchiori and Franz Rothlauf and George D. Smith and Giovanni Squillero}, series = {LNCS}, volume = {3005}, address = {Coimbra, Portugal}, publisher = {Springer Verlag}, publisher_address = {Berlin}, pages = {322--328}, keywords = {evolutionary computation}, ISBN = {}, url = {}, abstract = {methodology for segmenting gaseous object images is introduced. Unlike in case of a rigid object, the edge intensity of a gaseous object varies along the object boundary (edge intensities of some pixels on a gaseous object boundary are weaker than those of small rigid objects or noise itself). Therefore, the conventional edge detectors may not adequately detect boundary-like edge pixels of gaseous objects. We develop an object segmenting method using fuzzy algorithm trained by the genetic algorithm. The proposed method consists of a fuzzy-based boundary detector applicable to gaseous as well as rigid objects, and concave region filling to recover object regions. This algorithm is well applicable to medical image such as breast cancer or tumor segmentation.}, notes = {EvoWorkshops2004}, } @InProceedings{macias:evows04, author = {Demetrio Macias and Alexandre Vial and Dominique Barchiesi}, title = {Evolution Strategies Approach for the Solution of an Inverse Problem in Near-Field Optics}, booktitle = {Applications of Evolutionary Computing, EvoWorkshops2004: {EvoBIO}, {EvoCOMNET}, {EvoHOT}, {EvoIASP}, {EvoMUSART}, {EvoSTOC}}, year = {2004}, month = {5-7 April}, editor = {Guenther R. Raidl and Stefano Cagnoni and Jurgen Branke and David W. Corne and Rolf Drechsler and Yaochu Jin and Colin Johnson and Penousal Machado and Elena Marchiori and Franz Rothlauf and George D. Smith and Giovanni Squillero}, series = {LNCS}, volume = {3005}, address = {Coimbra, Portugal}, publisher = {Springer Verlag}, publisher_address = {Berlin}, pages = {329--338}, keywords = {evolutionary computation}, ISBN = {}, url = {}, abstract = {We propose and study two inversion procedures for the characterization of a nanostructure from near-field scattered intensity data. For this approach, the inverse problem is reformulated as a non-linear constrained optimization problem. The solution of the resultant fitness function is found through the application of the $(\mu/\rho,\lambda)$ and $(\mu/\rho+\lambda)$ strategies. The performance of the inversion algorithms is illustrated through an example and the results are discussed by means of a comparison between the methods proposed.}, notes = {EvoWorkshops2004}, } @InProceedings{myodo:evows04, author = {Emi Myodo and Kiyoshi Tanaka}, title = {A Watermark Sharing Scheme to High Quality Halftone Images with Genetic Algorithms}, booktitle = {Applications of Evolutionary Computing, EvoWorkshops2004: {EvoBIO}, {EvoCOMNET}, {EvoHOT}, {EvoIASP}, {EvoMUSART}, {EvoSTOC}}, year = {2004}, month = {5-7 April}, editor = {Guenther R. Raidl and Stefano Cagnoni and Jurgen Branke and David W. Corne and Rolf Drechsler and Yaochu Jin and Colin Johnson and Penousal Machado and Elena Marchiori and Franz Rothlauf and George D. Smith and Giovanni Squillero}, series = {LNCS}, volume = {3005}, address = {Coimbra, Portugal}, publisher = {Springer Verlag}, publisher_address = {Berlin}, pages = {339--348}, keywords = {evolutionary computation}, ISBN = {}, url = {}, abstract = {watermark sharing scheme to binary halftone images, which is extended from an image halftoning scheme using genetic algorithms. In addition to conventional evaluation functions on gray-level precision and appropriate contrast near edges, we design and introduce an evaluation function on watermark appearance to the scheme, and generate multiple binary halftone images shared a watermark image through solution search by GA. Also, we improve the resolution of the watermark image to the same size of generated images, which contributes to increase the appearance of watermark image remarkably. Simulation results show that we can share a watermark to generated halftone images keeping high image quality, but clearly decode the embedded watermark by overlapping those images optically.}, notes = {EvoWorkshops2004}, } @InProceedings{rivero:evows04, author = {Daniel Rivero and Juan R. Rabu\~nal and Juli\'an Dorado and Alejandro Pazos}, title = {Using Genetic Programming for Character Discrimination in Damaged Documents}, booktitle = {Applications of Evolutionary Computing, EvoWorkshops2004: {EvoBIO}, {EvoCOMNET}, {EvoHOT}, {EvoIASP}, {EvoMUSART}, {EvoSTOC}}, year = {2004}, month = {5-7 April}, editor = {Guenther R. Raidl and Stefano Cagnoni and Jurgen Branke and David W. Corne and Rolf Drechsler and Yaochu Jin and Colin Johnson and Penousal Machado and Elena Marchiori and Franz Rothlauf and George D. Smith and Giovanni Squillero}, series = {LNCS}, volume = {3005}, address = {Coimbra, Portugal}, publisher = {Springer Verlag}, publisher_address = {Berlin}, pages = {349--358}, keywords = {genetic algorithms, genetic programming, evolutionary computation}, ISBN = {}, url = {}, abstract = {an application of Genetic Programming (GP) to solve one problem in the field of image processing. This problem is the recovery of a deteriorated old document from the damages caused by centuries. This document was affected by many aggresive agents, mainly by the humidity caused by a wrong storage during many years. This makes this problem particularly hard and unaffordable by other image processing techniques. Recent works have shown how Genetic Algorithms are a suitable technique suitable but we show how we can obtain better results with GP.}, notes = {EvoWorkshops2004}, } @InProceedings{shin:evows04, author = {Jeongho Shin and Hyunjong Ki and Vivek Maik and Jinyoung Kang and Junghoon Jung and Joonki Paik}, title = {Evolutionary Algorithm-Based Local Structure Modeling for Improved Active Shape Model}, booktitle = {Applications of Evolutionary Computing, EvoWorkshops2004: {EvoBIO}, {EvoCOMNET}, {EvoHOT}, {EvoIASP}, {EvoMUSART}, {EvoSTOC}}, year = {2004}, month = {5-7 April}, editor = {Guenther R. Raidl and Stefano Cagnoni and Jurgen Branke and David W. Corne and Rolf Drechsler and Yaochu Jin and Colin Johnson and Penousal Machado and Elena Marchiori and Franz Rothlauf and George D. Smith and Giovanni Squillero}, series = {LNCS}, volume = {3005}, address = {Coimbra, Portugal}, publisher = {Springer Verlag}, publisher_address = {Berlin}, pages = {359--368}, keywords = {evolutionary computation}, ISBN = {}, url = {}, abstract = {An evolutionary algorithm-based robust local structure modeling technique is proposed to improve the performance of the active shape model (ASM). The proposed algorithm can extract boundary of an object under adverse condition, such as noisy corruption, occlusions, and shadow effect. The principle idea of the evolutionary algorithm is to find the global minimum of an objective function by evolving from a large set of populations rather than a single solution which may cause a local minimum. The proposed algorithm has been tested for various images including a sequence of human motion to demonstrate the improved performance of object tracking based on the evolutionary ASM.}, notes = {EvoWorkshops2004}, } @InProceedings{zhang:evows04, author = {Mengjie Zhang and Will Smart}, title = {Multiclass Object Classification Using Genetic Programming}, booktitle = {Applications of Evolutionary Computing, EvoWorkshops2004: {EvoBIO}, {EvoCOMNET}, {EvoHOT}, {EvoIASP}, {EvoMUSART}, {EvoSTOC}}, year = {2004}, month = {5-7 April}, editor = {Guenther R. Raidl and Stefano Cagnoni and Jurgen Branke and David W. Corne and Rolf Drechsler and Yaochu Jin and Colin Johnson and Penousal Machado and Elena Marchiori and Franz Rothlauf and George D. Smith and Giovanni Squillero}, series = {LNCS}, volume = {3005}, address = {Coimbra, Portugal}, publisher = {Springer Verlag}, publisher_address = {Berlin}, pages = {369--378}, keywords = {genetic algorithms, genetic programming, evolutionary computation}, ISBN = {}, url = {}, abstract = {We describe an approach to the use of genetic programming for multiclass object classification problems. Rather than using fixed static thresholds as boundaries to distinguish between different classes, this approach introduces two methods of classification where the boundaries between different classes can be dynamically determined during the evolutionary process. The two methods are centred dynamic class boundary determination and slotted dynamic class boundary determination. The two methods are tested on four object classification problems of increasing difficulty and are compared with the commonly used static class boundary determination method. The results suggest that, while the static class boundary determination method works well on relatively easy object classification problems, the two dynamic class boundary determination methods outperform the static method for more difficult multiple class object classification problems.}, notes = {EvoWorkshops2004}, } @InProceedings{zhang2:evows04, author = {Mengjie Zhang and Urvesh Bhowan}, title = {Program Size and Pixel Statistics in Genetic Programming for Object Detection}, booktitle = {Applications of Evolutionary Computing, EvoWorkshops2004: {EvoBIO}, {EvoCOMNET}, {EvoHOT}, {EvoIASP}, {EvoMUSART}, {EvoSTOC}}, year = {2004}, month = {5-7 April}, editor = {Guenther R. Raidl and Stefano Cagnoni and Jurgen Branke and David W. Corne and Rolf Drechsler and Yaochu Jin and Colin Johnson and Penousal Machado and Elena Marchiori and Franz Rothlauf and George D. Smith and Giovanni Squillero}, series = {LNCS}, volume = {3005}, address = {Coimbra, Portugal}, publisher = {Springer Verlag}, publisher_address = {Berlin}, pages = {379--388}, keywords = {genetic algorithms, genetic programming, evolutionary computation}, ISBN = {}, url = {}, abstract = {an approach to the use of genetic programming for object detection problems. In this approach, local region pixel statistics are used to form three terminal sets. The function set is constructed by the four standard arithmetic operators and a conditional operator. A multi-objective fitness function is constructed based on detection rate, false alarm rate, false alarm area and program size. This approach is applied to three object detection problems of increasing difficulty. The results suggest that the concentric circular pixel statistics are more effective than the square features for the coin detection problems. The fitness function with program size is more effective and more efficient for these object detection problems and the evolved genetic programs using this fitness function are much shorter and easier to interpret.}, notes = {EvoWorkshops2004}, } @InProceedings{zhang3:evows04, author = {Yang Zhang and Steve L. Smith and Andy M. Tyrrell}, title = {Intrinsic Evolvable Hardware in Digital Filter Design}, booktitle = {Applications of Evolutionary Computing, EvoWorkshops2004: {EvoBIO}, {EvoCOMNET}, {EvoHOT}, {EvoIASP}, {EvoMUSART}, {EvoSTOC}}, year = {2004}, month = {5-7 April}, editor = {Guenther R. Raidl and Stefano Cagnoni and Jurgen Branke and David W. Corne and Rolf Drechsler and Yaochu Jin and Colin Johnson and Penousal Machado and Elena Marchiori and Franz Rothlauf and George D. Smith and Giovanni Squillero}, series = {LNCS}, volume = {3005}, address = {Coimbra, Portugal}, publisher = {Springer Verlag}, publisher_address = {Berlin}, pages = {389--398}, keywords = {genetic algorithms, genetic programming, cartesian genetic programming, evolutionary computation}, ISBN = {}, url = {}, abstract = {application of Intrinsic Evolvable Hardware to real-world combinational circuit synthesis, as an alternative to conventional approaches. The evolutionary technique employs Cartesian Genetic Programming at a functional level by devising compact evolutionary processing elements and an external genetic reconfiguration unit. The experimental results conclude that in terms of computational effort, filtered image signal and implementation cost, the evolution outperforms convention approaches in most cases.}, notes = {EvoWorkshops2004}, } @InProceedings{blackwell:evows04, author = {Tim Blackwell and Michael Young}, title = {Swarm Granulator}, booktitle = {Applications of Evolutionary Computing, EvoWorkshops2004: {EvoBIO}, {EvoCOMNET}, {EvoHOT}, {EvoIASP}, {EvoMUSART}, {EvoSTOC}}, year = {2004}, month = {5-7 April}, editor = {Guenther R. Raidl and Stefano Cagnoni and Jurgen Branke and David W. Corne and Rolf Drechsler and Yaochu Jin and Colin Johnson and Penousal Machado and Elena Marchiori and Franz Rothlauf and George D. Smith and Giovanni Squillero}, series = {LNCS}, volume = {3005}, address = {Coimbra, Portugal}, publisher = {Springer Verlag}, publisher_address = {Berlin}, pages = {399--408}, keywords = {evolutionary computation}, ISBN = {}, url = {}, abstract = {a Swarm Granulator, an application of particle swarms to sound synthesis. Granulation, an established technique in sound synthesis, depends on many parameters which are non-intuitive and hard to control from a human perspective. It is proposed here that a particle swarm can organise these parameters and produce musically interesting and novel timbres. A crucial element of the system is the self-organisation of grain parameters around attractors which themselves represent musical events and textures in an external environment. This means that Swarm Granulator is interactive, and not merely reactive.}, notes = {EvoWorkshops2004}, } @InProceedings{lewis:evows04, author = {Matthew Lewis}, title = {Aesthetic Video Filter Evolution in an Interactive Real-time Framework}, booktitle = {Applications of Evolutionary Computing, EvoWorkshops2004: {EvoBIO}, {EvoCOMNET}, {EvoHOT}, {EvoIASP}, {EvoMUSART}, {EvoSTOC}}, year = {2004}, month = {5-7 April}, editor = {Guenther R. Raidl and Stefano Cagnoni and Jurgen Branke and David W. Corne and Rolf Drechsler and Yaochu Jin and Colin Johnson and Penousal Machado and Elena Marchiori and Franz Rothlauf and George D. Smith and Giovanni Squillero}, series = {LNCS}, volume = {3005}, address = {Coimbra, Portugal}, publisher = {Springer Verlag}, publisher_address = {Berlin}, pages = {409--418}, keywords = {genetic algorithms, genetic programming, evolutionary computation}, ISBN = {}, url = {}, abstract = {A data-flow network-based interactive evolutionary design framework is presented which will provide a testbed for the development and exploration of a diverse range of visual artistic design spaces. The domain of real-time layered video filters is focused on as the primary example. The system supports both real-time video streams and prerecorded video. Issues of stylistic signature, GA vs. GP-based approaches, rapid tuning of fitness distributions, and desirable traits of generic evolutionary design systems are discussed.}, notes = {EvoWorkshops2004}, } @InProceedings{dehlinger:evows04, author = {Hans Eberhardt Dehlinger}, title = {Generative Art: Fuzzy Polygon Clipping in Program Generated Line Oriented Drawings}, booktitle = {Applications of Evolutionary Computing, EvoWorkshops2004: {EvoBIO}, {EvoCOMNET}, {EvoHOT}, {EvoIASP}, {EvoMUSART}, {EvoSTOC}}, year = {2004}, month = {5-7 April}, editor = {Guenther R. Raidl and Stefano Cagnoni and Jurgen Branke and David W. Corne and Rolf Drechsler and Yaochu Jin and Colin Johnson and Penousal Machado and Elena Marchiori and Franz Rothlauf and George D. Smith and Giovanni Squillero}, series = {LNCS}, volume = {3005}, address = {Coimbra, Portugal}, publisher = {Springer Verlag}, publisher_address = {Berlin}, pages = {419--426}, keywords = {evolutionary computation}, ISBN = {}, url = {}, abstract = {Generative Art with a focus on algorithmically generated drawings of high density, executed on pen-plotters. Special attention is given to the concept of fuzzy clipping, extending the classical approaches to the clipping of line drawings. Strategies for fuzzy clipping are discussed and illustrated. The generating program is regarded as a personal vehicle designed for experiments of an artist. It supports the pursued intentions on the basis of defined preferences. The universe of hand-generated drawings is compared to the universe of program-generated drawings. It is argued that the richness of the universe of program generated drawings reveals aesthetic properties, which rival those of the universe of hand drawings. Examples of generated drawings are used to demonstrate the range of variety in the output of the generator.}, notes = {EvoWorkshops2004}, } @InProceedings{greenfield:evows04, author = {Gary Greenfield}, title = {Tilings of Sequences of Co-evolved Images}, booktitle = {Applications of Evolutionary Computing, EvoWorkshops2004: {EvoBIO}, {EvoCOMNET}, {EvoHOT}, {EvoIASP}, {EvoMUSART}, {EvoSTOC}}, year = {2004}, month = {5-7 April}, editor = {Guenther R. Raidl and Stefano Cagnoni and Jurgen Branke and David W. Corne and Rolf Drechsler and Yaochu Jin and Colin Johnson and Penousal Machado and Elena Marchiori and Franz Rothlauf and George D. Smith and Giovanni Squillero}, series = {LNCS}, volume = {3005}, address = {Coimbra, Portugal}, publisher = {Springer Verlag}, publisher_address = {Berlin}, pages = {427--436}, keywords = {evolutionary computation}, ISBN = {}, url = {}, abstract = {Sims' well-known technique for using evolving expressions to generate abstract images is paired with a co-evolutionary hosts and parasites fitness scheme to instantiate an evolutionary simulation. An added twist is that image populations are completely replaced after each generation. The goal is to identify evolutionary epochs where significant aesthetic themes emerge so that sequences of maximally fit images can be culled. Culled sequences are used to construct tessilations. The technique yields abstract tilings where the interplay between creation, competition, and cooperation of visual themes combine to produce some surprising aesthetic results.}, notes = {EvoWorkshops2004}, } @InProceedings{machado:evows04, author = {Penousal Machado and Juan Romero and Mar\'{i}a Luisa Santos and Am\'{i}lcar Cardoso and Bill Manaris}, title = {Adaptive Critics for Evolutionary Artists}, booktitle = {Applications of Evolutionary Computing, EvoWorkshops2004: {EvoBIO}, {EvoCOMNET}, {EvoHOT}, {EvoIASP}, {EvoMUSART}, {EvoSTOC}}, year = {2004}, month = {5-7 April}, editor = {Guenther R. Raidl and Stefano Cagnoni and Jurgen Branke and David W. Corne and Rolf Drechsler and Yaochu Jin and Colin Johnson and Penousal Machado and Elena Marchiori and Franz Rothlauf and George D. Smith and Giovanni Squillero}, series = {LNCS}, volume = {3005}, address = {Coimbra, Portugal}, publisher = {Springer Verlag}, publisher_address = {Berlin}, pages = {437--446}, keywords = {evolutionary computation}, ISBN = {}, url = {}, abstract = {We focus on the development of artificial art critics. These systems analyse art works, extracting relevant features, and produce an evaluation of the perceived pieces. The ability to perform aesthetic judgements is a desirable characteristic in an evolutionary artificial artist. As such, the inclusion of artificial art critics in these systems may improve their artistic abilities. We propose artificial art critics for the domains of music and visual arts, presenting a comprehensive set of experiments in author identification tasks. The experimental results show the viability and potential of our approach.}, notes = {EvoWorkshops2004}, } @InProceedings{svangard:evows04, author = {Nils Svang{\aa}rd and Peter Nordin}, title = {Automated Aesthetic Selection of Evolutionary Art by Distance Based Classification of Genomes and Phenomes using the Universal Similarity Metric}, booktitle = {Applications of Evolutionary Computing, EvoWorkshops2004: {EvoBIO}, {EvoCOMNET}, {EvoHOT}, {EvoIASP}, {EvoMUSART}, {EvoSTOC}}, year = {2004}, month = {5-7 April}, editor = {Guenther R. Raidl and Stefano Cagnoni and Jurgen Branke and David W. Corne and Rolf Drechsler and Yaochu Jin and Colin Johnson and Penousal Machado and Elena Marchiori and Franz Rothlauf and George D. Smith and Giovanni Squillero}, series = {LNCS}, volume = {3005}, address = {Coimbra, Portugal}, publisher = {Springer Verlag}, publisher_address = {Berlin}, pages = {447--456}, keywords = {evolutionary computation}, ISBN = {}, url = {}, abstract = {We present a technique for automatically approximating the aesthetic fitness of evolutionary art. Instead of assigning fitness values to images interactively, we use the Universal Similarity Metric to predict how interesting new images are to the observer based on a library of aesthetic images. In order to approximate the Information Distance, and find the images most similar to the training set, we use a combination of zip-compression, for genomes, and jpeg-compression of the final images. We evaluated the prediction accuracy of our system by letting the user label a new set of images and then compare that to what our system classifies as the most aesthetically pleasing images. Our experiments indicate that the Universal Similarity Metric can successfully be used to classify what images and genomes are aesthetically pleasing, and that it can clearly distinguish between "ugly" and "pretty" images with an accuracy better than the random baseline.}, notes = {EvoWorkshops2004}, } @InProceedings{nemirovsky:evows04, author = {Paul Nemirovsky and Rebecca Luger-Guillaume}, title = {Improvisational Media Space :: Architecture and Strategies for Evolution}, booktitle = {Applications of Evolutionary Computing, EvoWorkshops2004: {EvoBIO}, {EvoCOMNET}, {EvoHOT}, {EvoIASP}, {EvoMUSART}, {EvoSTOC}}, year = {2004}, month = {5-7 April}, editor = {Guenther R. Raidl and Stefano Cagnoni and Jurgen Branke and David W. Corne and Rolf Drechsler and Yaochu Jin and Colin Johnson and Penousal Machado and Elena Marchiori and Franz Rothlauf and George D. Smith and Giovanni Squillero}, series = {LNCS}, volume = {3005}, address = {Coimbra, Portugal}, publisher = {Springer Verlag}, publisher_address = {Berlin}, pages = {457--466}, keywords = {evolutionary computation}, ISBN = {}, url = {}, abstract = {We present the current state in an on going development of the Emonic Environment (EE): a real-time improvisational system employing evolutionary principles for the mutation of media space. We position the associated problems in the context of user interaction, provide eight principles essential for creating an improvisational media environment, follow with a description of how the EE implements these principles, and conclude with a description of the evolutionary algorithms' functionality.}, notes = {EvoWorkshops2004}, } @InProceedings{dorin:evows04, author = {Alan Dorin}, title = {The Virtual Ecosystem As Generative Electronic Art}, booktitle = {Applications of Evolutionary Computing, EvoWorkshops2004: {EvoBIO}, {EvoCOMNET}, {EvoHOT}, {EvoIASP}, {EvoMUSART}, {EvoSTOC}}, year = {2004}, month = {5-7 April}, editor = {Guenther R. Raidl and Stefano Cagnoni and Jurgen Branke and David W. Corne and Rolf Drechsler and Yaochu Jin and Colin Johnson and Penousal Machado and Elena Marchiori and Franz Rothlauf and George D. Smith and Giovanni Squillero}, series = {LNCS}, volume = {3005}, address = {Coimbra, Portugal}, publisher = {Springer Verlag}, publisher_address = {Berlin}, pages = {467--476}, keywords = {evolutionary computation}, ISBN = {}, url = {}, abstract = {We propose four desirable attributes of processes to be applied in generative electronic art. By example, it then demonstrates that the virtual ecosystem in its entirety is a process with many of these desirable attributes. We contrast this process with the use of cellular automata. It outlines a number of generative art works with which the author has been involved that use the virtual ecosystem, and discusses their pros and cons in the context of generative art. We suggest means by which the application of the four desirable attributes may extend the creative possibilities for these works.}, notes = {EvoWorkshops2004}, } @InProceedings{mccormack:evows04, author = {Jon McCormack}, title = {Aesthetic Evolution of L-systems Revisited}, booktitle = {Applications of Evolutionary Computing, EvoWorkshops2004: {EvoBIO}, {EvoCOMNET}, {EvoHOT}, {EvoIASP}, {EvoMUSART}, {EvoSTOC}}, year = {2004}, month = {5-7 April}, editor = {Guenther R. Raidl and Stefano Cagnoni and Jurgen Branke and David W. Corne and Rolf Drechsler and Yaochu Jin and Colin Johnson and Penousal Machado and Elena Marchiori and Franz Rothlauf and George D. Smith and Giovanni Squillero}, series = {LNCS}, volume = {3005}, address = {Coimbra, Portugal}, publisher = {Springer Verlag}, publisher_address = {Berlin}, pages = {477--488}, keywords = {evolutionary computation}, ISBN = {}, url = {}, abstract = {Methods for evolving Lindenmayer systems (L-systems) have been discussed in the literature for more than 10 years. We revisits one of the first published methods on the application of interactive evolution of L-systems for creative purposes, using aesthetic selection. An epilogue surveys the techniques and applications of evolutionary L-system methods since the original publication by the author in 1993. Conclusions are drawn about the utility and difficulties associated with evolving L-system productions, and aesthetic evolution in general, particularly with application to design and creative process.}, notes = {EvoWorkshops2004}, } @InProceedings{blackwell:evows04, author = {Tim Blackwell and J\"urgen Branke}, title = {Multi-Swarm Optimization in Dynamic Environments}, booktitle = {Applications of Evolutionary Computing, EvoWorkshops2004: {EvoBIO}, {EvoCOMNET}, {EvoHOT}, {EvoIASP}, {EvoMUSART}, {EvoSTOC}}, year = {2004}, month = {5-7 April}, editor = {Guenther R. Raidl and Stefano Cagnoni and Jurgen Branke and David W. Corne and Rolf Drechsler and Yaochu Jin and Colin Johnson and Penousal Machado and Elena Marchiori and Franz Rothlauf and George D. Smith and Giovanni Squillero}, series = {LNCS}, volume = {3005}, address = {Coimbra, Portugal}, publisher = {Springer Verlag}, publisher_address = {Berlin}, pages = {489--500}, keywords = {evolutionary computation}, ISBN = {}, url = {}, abstract = {Many real-world problems are dynamic, requiring an optimisation algorithm which is able to continuously track a changing optimum over time. We present variants of Particle Swarm Optimisation (PSO) specifically designed to work well in dynamic environments. The main idea is to extend the single population PSO and Charged Particle Swarm Optimisation (CPSO) methods by constructing interacting multi-swarms. In addition, an algorithmic variant, which broadens the implicit atomic analogy of CPSO to a quantum model, is introduced. The multi-swarm algorithms are tested on a multi-modal dynamic function - the moving peaks benchmark - and results are compared to the single population approach of PSO and CPSO, and to results obtained by a state-of-the-art evolutionary algorithm, namely self-organising scouts (SOS). We show that our multi-swarm optimizer significantly outperforms single population PSO on this problem, and that multi-quantum swarms are superior to multi-charged swarms and SOS.}, notes = {EvoWorkshops2004}, } @InProceedings{fleury:evows04, author = {G\'erard Fleury and Philippe Lacomme and Christian Prins}, title = {Evolutionary Algorithms for Stochastic Arc Routing Problems}, booktitle = {Applications of Evolutionary Computing, EvoWorkshops2004: {EvoBIO}, {EvoCOMNET}, {EvoHOT}, {EvoIASP}, {EvoMUSART}, {EvoSTOC}}, year = {2004}, month = {5-7 April}, editor = {Guenther R. Raidl and Stefano Cagnoni and Jurgen Branke and David W. Corne and Rolf Drechsler and Yaochu Jin and Colin Johnson and Penousal Machado and Elena Marchiori and Franz Rothlauf and George D. Smith and Giovanni Squillero}, series = {LNCS}, volume = {3005}, address = {Coimbra, Portugal}, publisher = {Springer Verlag}, publisher_address = {Berlin}, pages = {501--512}, keywords = {evolutionary computation}, ISBN = {}, url = {}, abstract = {The Capacitated Arc Routing Problem (CARP) is a combinatorial optimisation problem in which vehicles with limited capacity must treat a set of arcs in a network, to minimise the total cost of the trips. The SCARP is a stochastic version with random demands on the arcs. The management rules used for instance in waste collection enable to derive mathematical expressions for objectives like the expected total cost. A memetic algorithm (MA) for the SCARP is proposed and compared with two deterministic versions based on average demands. All solutions are evaluated by simulation, to see how they are affected by random fluctuations of demands. This evaluation confirms the expected cost computed by the MA and shows its ability to provide robust solutions, without significant enlargement of the cost of planned trips.}, notes = {EvoWorkshops2004}, } @InProceedings{janson:evows04, author = {Stefan Janson and Martin Middendorf}, title = {A Hierarchical Particle Swarm Optimizer for Dynamic Optimization Problems}, booktitle = {Applications of Evolutionary Computing, EvoWorkshops2004: {EvoBIO}, {EvoCOMNET}, {EvoHOT}, {EvoIASP}, {EvoMUSART}, {EvoSTOC}}, year = {2004}, month = {5-7 April}, editor = {Guenther R. Raidl and Stefano Cagnoni and Jurgen Branke and David W. Corne and Rolf Drechsler and Yaochu Jin and Colin Johnson and Penousal Machado and Elena Marchiori and Franz Rothlauf and George D. Smith and Giovanni Squillero}, series = {LNCS}, volume = {3005}, address = {Coimbra, Portugal}, publisher = {Springer Verlag}, publisher_address = {Berlin}, pages = {513--524}, keywords = {evolutionary computation}, ISBN = {}, url = {}, abstract = {Particle Swarm Optimisation (PSO) methods for dynamic function optimisation are studied. We compare dynamic variants of standard PSO and Hierarchical PSO (H-PSO) on different dynamic benchmark functions. Moreover hierarchical PSO, called Partitioned H-PSO (PH-PSO), is proposed. In this algorithm the hierarchy is partitioned into several sub-swarms for a limited number of generations after a change occurred. Different methods for determining the time when to rejoin the hierarchy and how to handle the topmost sub-swarm are discussed. The test results show that H-PSO performs significantly better than PSO on all test functions and that the PH-PSO algorithms often perform best on multi modal functions where changes are not too severe.}, notes = {EvoWorkshops2004}, } @InProceedings{jin:evows04, author = {Yaochu Jin and Bernhard Sendhoff}, title = {Constructing Dynamic Optimization Test Problems Using the Multi-Objective Optimization Concept}, booktitle = {Applications of Evolutionary Computing, EvoWorkshops2004: {EvoBIO}, {EvoCOMNET}, {EvoHOT}, {EvoIASP}, {EvoMUSART}, {EvoSTOC}}, year = {2004}, month = {5-7 April}, editor = {Guenther R. Raidl and Stefano Cagnoni and Jurgen Branke and David W. Corne and Rolf Drechsler and Yaochu Jin and Colin Johnson and Penousal Machado and Elena Marchiori and Franz Rothlauf and George D. Smith and Giovanni Squillero}, series = {LNCS}, volume = {3005}, address = {Coimbra, Portugal}, publisher = {Springer Verlag}, publisher_address = {Berlin}, pages = {525--536}, keywords = {evolutionary computation}, ISBN = {}, url = {}, abstract = {Dynamic optimisation using evolutionary algorithms is receiving increasing interests. However, typical test functions for comparing the performance of various dynamic optimisation algorithms still lack. We suggest a method for constructing dynamic optimisation test problems using multi-objective optimisation (MOO) concepts. By aggregating different objectives of an MOO problem and changing the weights dynamically, we are able to construct dynamic single objective and multi-objective test problems systematically. The proposed method is computationally efficient, easily tunable and functionally powerful. This is mainly due to the fact that the proposed method associates dynamic optimisation with multi-objective optimisation and thus the rich MOO test problems can easily be adapted to dynamic optimisation test functions.}, notes = {EvoWorkshops2004}, } @InProceedings{maravall:evows04, author = {Dar\'{\i}o Maravall and Javier {de Lop}e and Miguel \'Angel Patricio}, title = {Competitive Goal Coordination in Automatic Parking}, booktitle = {Applications of Evolutionary Computing, EvoWorkshops2004: {EvoBIO}, {EvoCOMNET}, {EvoHOT}, {EvoIASP}, {EvoMUSART}, {EvoSTOC}}, year = {2004}, month = {5-7 April}, editor = {Guenther R. Raidl and Stefano Cagnoni and Jurgen Branke and David W. Corne and Rolf Drechsler and Yaochu Jin and Colin Johnson and Penousal Machado and Elena Marchiori and Franz Rothlauf and George D. Smith and Giovanni Squillero}, series = {LNCS}, volume = {3005}, address = {Coimbra, Portugal}, publisher = {Springer Verlag}, publisher_address = {Berlin}, pages = {537--548}, keywords = {evolutionary computation}, ISBN = {}, url = {}, abstract = {The problem of automatic parking by a back-wheel drive vehicle, using a biomimetic model based on direct coupling between vehicle perceptions and actions. The proposed automatic parking solution leads to a dynamic multiobjective optimisation problem that cannot be dealt with analytically. A genetic algorithm is therefore used. Results of computer simulations are discussed}, notes = {EvoWorkshops2004}, } @InProceedings{vaccaro:evows04, author = {James Vaccaro and Clark Guest}, title = {Evolutionary Bayesian Network Dynamic Planner for Game {RISK}}, booktitle = {Applications of Evolutionary Computing, EvoWorkshops2004: {EvoBIO}, {EvoCOMNET}, {EvoHOT}, {EvoIASP}, {EvoMUSART}, {EvoSTOC}}, year = {2004}, month = {5-7 April}, editor = {Guenther R. Raidl and Stefano Cagnoni and Jurgen Branke and David W. Corne and Rolf Drechsler and Yaochu Jin and Colin Johnson and Penousal Machado and Elena Marchiori and Franz Rothlauf and George D. Smith and Giovanni Squillero}, series = {LNCS}, volume = {3005}, address = {Coimbra, Portugal}, publisher = {Springer Verlag}, publisher_address = {Berlin}, pages = {549--560}, keywords = {evolutionary computation}, ISBN = {}, url = {}, abstract = {Many artificial intelligence problems are susceptible to a goal-directed solution. For some problems, such as dynamic planning and execution, a goal-directed approach may be the only option. Using information available about a desirable state or a measure of acceptability of possible future states, a goal-directed approach determines routes or plans to reach these desirable states. These problems can be categorised as game problems. One such game is RISK. RISK is complex, multi-scaled, and provides a good application for testing a variety of goal-directed approaches. A goal-directed hybrid evolutionary program that plays the RISK game effectively has been developed. This approach advances an understanding of: (1) how to use Bayesian probability to prune combinatorial explosive planning spaces; (2) how to incorporate temporal planning cost in an objective function; and (3) provides a procedure for mapping a problem (i.e., data and knowledge) into a dynamic planning and execution framework.}, notes = {EvoWorkshops2004}, }