{"title":"Multi-objectivization of short-term unit commitment under uncertainty using evolutionary algorithm","authors":"Anupam Trivedi, D. Sharma, D. Srinivasan","doi":"10.1109/CEC.2012.6256148","DOIUrl":"https://doi.org/10.1109/CEC.2012.6256148","url":null,"abstract":"The short-term unit commitment problem is traditionally solved as a single-objective optimization problem with system operation cost as the only objective. This paper presents multi-objectivization of the short-term unit commitment problem in uncertain environment by considering reliability as an additional objective along with the economic objective. The uncertainties occurring due to unit outage and load forecast error are incorporated using loss of load probability (LOLP) and expected unserved energy (EUE) reliability indices. The multi-objectivized unit commitment problem in uncertain environment is solved using our earlier proposed multi-objective evolutionary algorithm [1]. Simulations are performed on a test system of 26 thermal generating units and the results obtained are benchmarked against the study [2] where the unit commitment problem was solved as a reliability-constrained single-objective optimization problem. The simulation results demonstrate that the proposed multi-objectivized approach can find solutions with considerably lower cost than those obtained in the benchmark. Further, the efficiency and consistency of the proposed algorithm for multi-objectivized unit commitment problem is demonstrated by quantitative performance assessment using hypervolume indicator.","PeriodicalId":376837,"journal":{"name":"2012 IEEE Congress on Evolutionary Computation","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128758185","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":"On the use of Population Based Incremental Learning to do Reverse Engineering on Gene Regulatory Networks","authors":"Leon F Palafox, H. Iba","doi":"10.1109/CEC.2012.6256580","DOIUrl":"https://doi.org/10.1109/CEC.2012.6256580","url":null,"abstract":"Gene Regulatory Networks (GRNs) describe the interactions between different genes. One of the most important tasks in biology is to find the right regulations in a GRN given observed data. The problem, is that the data is often noisy and scarce, and we have to use models robust to noise and scalable to hundreds of genes. Recently, Recursive Neural Networks (RNNs) have been presented as a viable model for GRNs, which is robust to noise and can be scaled to larger networks. In this paper, to optimize the parameters of the RNN, we implement a classic Population Based Incremental Learning (PBIL), which in certain scenarios has outperformed classic GA and other evolutionary techniques like Particle Swarm Optimization (PSO). We test this implementation on a small and a large artificial networks. We further study the optimal tunning parameters and discuss the advantages of the method.","PeriodicalId":376837,"journal":{"name":"2012 IEEE Congress on Evolutionary Computation","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129054543","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":"Cooperative Coevolution with global search for large scale global optimization","authors":"Kai Zhang, Bin Li","doi":"10.1109/CEC.2012.6252936","DOIUrl":"https://doi.org/10.1109/CEC.2012.6252936","url":null,"abstract":"To improve the performance of EAs on large scale numerical optimization problems, a number of techniques have been invented, among which, Cooperative Coevolution (CC in short) is obviously a promising one. But sometimes CC is easy to lead to premature convergence in large scale global optimization. In this paper, a Cooperative Coevolution Evolutionary Algorithm (CCEA in short) with global search (CCGS) is presented to handle large scale global optimization (LSGO) problems. The performance of CCGS is evaluated on the test functions provided for the CEC 2012 competition and special session on Large Scale Global Optimization. The experiment results show that this technique is more effective than CCEAs without global search.","PeriodicalId":376837,"journal":{"name":"2012 IEEE Congress on Evolutionary Computation","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121556387","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 new objective function to build seismic networks using differential evolution","authors":"Josafath Israel Espinosa Ramos, R. Vázquez","doi":"10.1109/CEC.2012.6252913","DOIUrl":"https://doi.org/10.1109/CEC.2012.6252913","url":null,"abstract":"Natural phenomena such as earthquakes have caused devastating effects in different cities around the word. To prevent a great disaster, it is necessary to construct seismic stations at strategical locations to warn population. Many Disaster Alert Systems (DAS), such as the Seismic Alert System of Mexico City (SAS) [4] or the Deep-ocean Assessment and Reporting of Tsunamis (DART II) [11], were located not based in earthquake or tsunami data, but simply by spacing the sensors more or less evenly around the contour of the Pacific Ocean. The objective of a DAS is simple: to emit an alert as fast as possible, in order to warn the population as early as possible. According to a new location of its seismic stations, the SAS could issue a longer warning time. This research focuses on designing the locations of seismic sensing stations maximizing the “warning time”; that is, the gap between the time when an earthquake is detected and the alert is launched, and the arrival time of the disaster. Since locating these stations is basically a numerical problem, in this research, the authors propose a new objective function to maximize the warning time using a differential evolution algorithm. In order to perform the experiments and validate the efficiency of the algorithm, it was considered the epicenters of recorded earthquakes located in the State of Guerrero, México. This data is used in the objective function to set the fitness value of a candidate solution. The main disasters targeted in this paper are earthquakes, but this research can be extended easily to tsunamis or volcanic eruptions alert systems, locating telecommunications antennas, etc.","PeriodicalId":376837,"journal":{"name":"2012 IEEE Congress on Evolutionary Computation","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129179372","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":"Autonomous flock brush for non-photorealistic rendering","authors":"Hsueh En Huang, Y. Ong, Xianshun Chen","doi":"10.1109/CEC.2012.6256601","DOIUrl":"https://doi.org/10.1109/CEC.2012.6256601","url":null,"abstract":"Non-photorealistic rendering systems strive to create compelling stylized effects from realistic images. We present an interactive process using flocks of autonomous agents to model a painter's brush. As flocks of agents glide across the canvas like bristles on a paint brush, a stylized picture can be produced by carefully directing the path of movement. The agents leave behind a trail of color resulting in painterly or pencil sketch looking images.","PeriodicalId":376837,"journal":{"name":"2012 IEEE Congress on Evolutionary Computation","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130327525","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":"Japanese international air travel: The relationship between flight ticket price and geodesic distance","authors":"A. Sato","doi":"10.1109/CEC.2012.6252908","DOIUrl":"https://doi.org/10.1109/CEC.2012.6252908","url":null,"abstract":"This article considers the relationship between the price of flight tickets and their geodesic distance from the departure airport to the destination. Using the data collected from a Japanese flight booking site, I empirically investigated demand-supply situations from parameter estimates of an nth order polynomial function of the price in terms of the distance on each observation date. An adequate order of the polynomial function is determined by using two kinds of information criterions (AIC and BIC). It is confirmed that the ticket availability strongly depends on the Japanese calendar date and that the parameter estimates also depend on the calendar date. The parameter estimates may correspond to demand-supply situations of the Japanese air travel market.","PeriodicalId":376837,"journal":{"name":"2012 IEEE Congress on Evolutionary Computation","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130652286","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":"Evolution of cellular automata using instruction-based approach","authors":"Michal Bidlo, Z. Vašíček","doi":"10.1109/CEC.2012.6256475","DOIUrl":"https://doi.org/10.1109/CEC.2012.6256475","url":null,"abstract":"This paper introduces a method of encoding cellular automata local transition function using an instruction-based approach and their design by means of genetic algorithms. The proposed method represents an indirect mapping between the input combinations of states in the cellular neighborhood and the next states of the cells during the development steps. In this case the local transition function is described by a program (algorithm) whose execution calculates the next cell states. The objective of the program-based representation is to reduce the length of the chromosome in case of the evolutionary design of cellular automata. It will be shown that the instruction-based development allows us to design complex cellular automata with higher success rate than the conventional table-based method especially for complex cellular automata with more than two cell states. The case studies include the replication problem and the problem of development of a given pattern from an initial seed.","PeriodicalId":376837,"journal":{"name":"2012 IEEE Congress on Evolutionary Computation","volume":"62 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117226087","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":"Comparison of the criteria for updating Kriging response surface models in multi-objective optimization","authors":"K. Shimoyama, Koma Sato, S. Jeong, S. Obayashi","doi":"10.1109/CEC.2012.6256492","DOIUrl":"https://doi.org/10.1109/CEC.2012.6256492","url":null,"abstract":"This paper compares the criteria for updating the Kriging response surface models in multi-objective optimization: expected improvement (EI), expected hypervolume improvement (EHVI), estimation (EST), and those combination (EHVI+EST). EI has been conventionally used as the criterion considering the stochastic improvement of each objective function value individually, while EHVI has been recently proposed as the criterion considering the stochastic improvement of the front of non-dominated solutions in multi-objective optimization. EST is the value of each objective function, which is estimated non-stochastically by the Kriging model without considering its uncertainties. Numerical experiments were implemented in the welded beam design problem, and empirically showed that, in a non-constrained case, EHVI keeps a balance between accurate and wide search for non-dominated solutions on the Kriging models in multi-objective optimization. In addition, the present experiments suggested future investigation into the techniques for handling uncertain constraints to enhance the capability of EHVI in a constrained case.","PeriodicalId":376837,"journal":{"name":"2012 IEEE Congress on Evolutionary Computation","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131088016","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":"Differential evolution with a mix of Constraint Consenus methods for solving a real-world Optimization Problem","authors":"Noha M. Hamza, R. Sarker, D. Essam","doi":"10.1109/CEC.2012.6252904","DOIUrl":"https://doi.org/10.1109/CEC.2012.6252904","url":null,"abstract":"Over the last few decades, real world constrained optimization has become an important research topic in the evolutionary computation field. The Economic Load Dispatch is one of the well-known complex practical problems. The problem is usually represented by a non-convex constrained optimization model. In this paper, we propose to use an ensemble of three different Constraint Consensus (CC) methods within the Differential Evolution algorithm to solve the Economic Load Dispatch problem. During the evolution process, an adaptive mechanism is used to assign the infeasible solutions to each CC method with the emphasis on the best performing one. The experimental results show that the proposed algorithm is not only able to reach the 100% feasibility ratio, but that it is also able to obtain better solutions in comparison to the state-of-the-art algorithms.","PeriodicalId":376837,"journal":{"name":"2012 IEEE Congress on Evolutionary Computation","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132639111","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 repair mechanism for active inequality constraint handling","authors":"Amit Saha, T. Ray","doi":"10.1109/CEC.2012.6256498","DOIUrl":"https://doi.org/10.1109/CEC.2012.6256498","url":null,"abstract":"Constraint handling is an active field of research in the Genetic Algorithms community, considering that one or more constraints need to be satisfied in most real life optimization problems. Recently, we proposed a Most Probable Point based repair approach for handling equality constraints in Single-objective and Multi-objective optimization problems. In this work, we demonstrate the application of the repair approach to handle active inequality constraints. We show that the repair mechanism, which has so far been strictly applied to the domain of equality constraint handling can be used to obtain better results with faster convergence even in inequality constrained problems. We take up a number of standard Single-objective test problems having one or more active inequality constraints for our study. The applicability of the proposed procedure is demonstrated on a well studied Engineering design optimization problem. The present study contributes to the scarce body of literature available on repair mechanisms in inequality constraint handling and hence should motivate further research in this direction.","PeriodicalId":376837,"journal":{"name":"2012 IEEE Congress on Evolutionary Computation","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132798915","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}