{"title":"Feature selection and classification using ensembles of genetic programs and within-class and between-class permutations","authors":"Annica Ivert, C. Aranha, H. Iba","doi":"10.1109/CEC.2015.7257015","DOIUrl":"https://doi.org/10.1109/CEC.2015.7257015","url":null,"abstract":"Many feature selection methods are based on the assumption that important features are highly correlated with their corresponding classes, but mainly uncorrelated with each other. Often, this assumption can help eliminate redundancies and produce good predictors using only a small subset of features. However, when the predictability depends on interactions between features, such methods will fail to produce satisfactory results. In this paper a method that can find important features, both independently and dependently discriminative, is introduced. This method works by performing two different types of permutation tests that classify each of the features as either irrelevant, independently predictive or dependently predictive. It was evaluated using a classifier based on an ensemble of genetic programs. The attributes chosen by the permutation tests were shown to yield classifiers at least as good as the ones obtained when all attributes were used during training - and often better. The proposed method also fared well when compared to other attribute selection methods such as RELIEFF and CFS. Furthermore, the ability to determine whether an attribute was independently or dependently predictive was confirmed using artificial datasets with known dependencies.","PeriodicalId":403666,"journal":{"name":"2015 IEEE Congress on Evolutionary Computation (CEC)","volume":"2010 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127353763","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":"Critical properties of cellular automata with evolving network topologies","authors":"Christian Darabos, J. Moore","doi":"10.1109/CEC.2015.7257144","DOIUrl":"https://doi.org/10.1109/CEC.2015.7257144","url":null,"abstract":"Cellular automata (CAs) in their original form are laid out on regular structures such as rings or lattices. An unsophisticated evolutionary algorithm applied to the underlying structure of the CA's connectivity is capable to significantly improve its performance solving non-trivial tasks. In this work, we study the network properties that emerge in CAs with evolving topology for the density classification problem. We compare a simple rewiring mutation operator to a more sophisticated one that allows an increase in connectivity. We also analyze the effect of initial structure in the CAs before evolution, working over the entire spectrum of regular, irregular, and random networks. We conclude that, unsurprisingly, an increase in connectivity is the driver of fitness. This also result in an increase in the clustering coefficient, and decrease in assortativity. However, our study shows that artificial evolution can also achieve high fitness in CAs with constant degree by creating shortcuts through the network, lowing the characteristic path length, and keeping the assortativity and clustering coefficient constant.","PeriodicalId":403666,"journal":{"name":"2015 IEEE Congress on Evolutionary Computation (CEC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127446591","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 co-evolutionary algorithm based on mixed mutation strategy for WDP in combinatorial auction","authors":"Wei-gen Hou, Hongbin Dong, Guisheng Yin, Yuxin Dong","doi":"10.1109/CEC.2015.7257270","DOIUrl":"https://doi.org/10.1109/CEC.2015.7257270","url":null,"abstract":"To address computational complexity of winner determination in combinatorial auction, a new co-evolutionary algorithms is developed based on combining mixed mutation with self-organization optimization for finding high quality solutions quickly. Mixed mutation strategy can select adaptively mutation operators which are suitable for discrete space to maintain population diversity, self-organization optimization makes the search to jump out of local optima. This paper investigates two combination methods of mixed mutation and self-organization optimization, the results of experiment show the better performance of the second way (MMSEO2) that self-organization optimization is added to mixed mutation strategy set as a pure mutation operator. We compare the proposed algorithm with current well-known approximate algorithms for winner determination problem, and demonstrate that the proposed algorithm MMSEO2 produces competitive results and finds better solutions than other algorithms for large problem sizes.","PeriodicalId":403666,"journal":{"name":"2015 IEEE Congress on Evolutionary Computation (CEC)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124916564","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":"Short-term optimal hydrothermal scheduling problem considering power flow constraint","authors":"Jingrui Zhang, Shuang Lin, Xiangxiang Zeng, Qinghui Tang","doi":"10.1109/CEC.2015.7257294","DOIUrl":"https://doi.org/10.1109/CEC.2015.7257294","url":null,"abstract":"Short-term optimal hydrothermal scheduling problem is one of the most popular research issues in power systems optimization. A novel mathematical model of the short-term optimal hydrothermal scheduling is proposed in this paper. This model aims at minimizing the total fuel cost of the thermal generating units while satisfying the various constraints such as power balance, water balance, transmission network and other system's constraints. A modified differential evolution algorithm is also introduced to solve the short-term optimal hydrothermal scheduling problem. In the proposed approach, an operation of migration and a self-adaptive mechanism are presented to improve the searching efficiency. Moreover, four constraint handling rules are proposed to handle the complex constraints of short-term optimal hydrothermal scheduling problem. An IEEE nine buses test system is applied to verify the proposed mathematic model and algorithm. The numerical results show the feasibility and efficiency of the proposed approach to the short-term optimal hydrothermal scheduling problem.","PeriodicalId":403666,"journal":{"name":"2015 IEEE Congress on Evolutionary Computation (CEC)","volume":"454 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125788515","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":"Investigating the robustness of aisles in a non-traditional unit-load warehouse design: Leverage","authors":"Ömer Öztürkoğlu","doi":"10.1109/CEC.2015.7257160","DOIUrl":"https://doi.org/10.1109/CEC.2015.7257160","url":null,"abstract":"Recently, [9] proposed a non-traditional aisle design for unit-load warehouse for one, centrally located pickup and deposit (P&D) point both on the lower and upper sides of warehouse. We call this design Leverage. However, the number of P&D points is limited to one in design Leverage. Hence, in this research, we investigate the changes in improvement of Leverage as the number of P&D points increases by searching optimal designs by using [9]'s approach. We then compare Leverage with the improved designs to investigate its robustness in terms of changes in aisle structure and cost.","PeriodicalId":403666,"journal":{"name":"2015 IEEE Congress on Evolutionary Computation (CEC)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125874082","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Application of EPSO to designing a contract model of weather derivatives in Smart Grid","authors":"H. Mori, H. Fujita","doi":"10.1109/CEC.2015.7256909","DOIUrl":"https://doi.org/10.1109/CEC.2015.7256909","url":null,"abstract":"This paper proposes an efficient method for designing a contract model of the weather derivatives between energy utilities in Smart Grid. It is well-known that the weather conditions bring a profit decline or the increase of expenses to do damage to sound management. Weather derivatives are useful for solving such a problem. One of the ideas is to use the complementary relationship between electric power and gas companies in a sense that electric power companies are apt to make profits in hot summer while gas companies are inclined to reduce revenue. This paper focuses on how to create a reasonable contract model of the weather derivative. In this paper, EPSO (Evolutionary Particle Swarm Optimization) of meta-heuristics is applied to designing a contract model of the weather derivative. The proposed method aims at equalizing the mean and the variance of the payoffs between the power and gas companies. To enhance the model accuracy, DA clustering of global clustering is used to classify the historical data into clusters. The effectiveness of the proposed method is demonstrated for the real data in Tokyo, Japan.","PeriodicalId":403666,"journal":{"name":"2015 IEEE Congress on Evolutionary Computation (CEC)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126106234","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}
Zijian Cao, Lei Wang, Yuhui Shi, Xinhong Hei, Xiaofeng Rong, Qiaoyong Jiang, Hongye Li
{"title":"An effective cooperative coevolution framework integrating global and local search for large scale optimization problems","authors":"Zijian Cao, Lei Wang, Yuhui Shi, Xinhong Hei, Xiaofeng Rong, Qiaoyong Jiang, Hongye Li","doi":"10.1109/CEC.2015.7257129","DOIUrl":"https://doi.org/10.1109/CEC.2015.7257129","url":null,"abstract":"Cooperative Coevolution (CC) was introduced into evolutionary algorithms as a promising framework for tackling large scale optimization problems through a divide-and-conquer strategy. A number of decomposition methods to identify interacting variables have been proposed to construct subcomponents of a large scale problem, but if the variables are all non-separable, all the CC-based algorithms of decomposition will lose the functionality, therefore, classical CC-based algorithms are inefficient in processing non-separable problems that have many interacting variables. In this paper, a new CC framework which integrates global and local search algorithms is proposed for solving large scale optimization problems. In the stage of global cooperative coevolution, we introduce a new interacting variables grouping method named Sequential Sliding Window. When the performance of global search reaches a deviation tolerance or the variables are fully non-separable, we then use a more effective local search algorithm to subsequently search the solution space of the large scale optimization problem. The integration of global and local algorithms into CC framework can efficiently improve the capability in processing large scale non-separable problems. Experimental results on large scale optimization benchmarks show that the proposed framework is more effective than other existing CC frameworks.","PeriodicalId":403666,"journal":{"name":"2015 IEEE Congress on Evolutionary Computation (CEC)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115080457","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}
Hui Wang, Wenjun Wang, Hui Sun, Changhe Li, S. Rahnamayan, Yong Liu
{"title":"A modified cuckoo search algorithm for flow shop scheduling problem with blocking","authors":"Hui Wang, Wenjun Wang, Hui Sun, Changhe Li, S. Rahnamayan, Yong Liu","doi":"10.1109/CEC.2015.7256925","DOIUrl":"https://doi.org/10.1109/CEC.2015.7256925","url":null,"abstract":"This paper presents a Modified Cuckoo Search (MCS) algorithm for solving flow shop scheduling problem with blocking to minimize the makespan. To handle the discrete variables of the job scheduling problem, the smallest position value (SPV) rule is used to convert continuous solutions into discrete job permutations. The Nawaz-Enscore-Ham (NEH) heuristic method is utilized for generating high quality initial solutions. Moreover, two frequently used swap and insert operators are employed for enhancing the local search. To verify the performance of the proposed MCS algorithm, experiments are conducted on Taillard's benchmark set. Results show that MCS performs better than the standard CS and some previous algorithms proposed in the literature.","PeriodicalId":403666,"journal":{"name":"2015 IEEE Congress on Evolutionary Computation (CEC)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122717087","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":"Memetic algorithm for solving resource constrained project scheduling problems","authors":"Ismail M. Ali, S. Elsayed, T. Ray, R. Sarker","doi":"10.1109/CEC.2015.7257231","DOIUrl":"https://doi.org/10.1109/CEC.2015.7257231","url":null,"abstract":"Resource constrained project scheduling problem (RCPSP) is considered to be an NP hard problem. Over the last few decades, many different approaches have been developed in order to solve RCPSPs optimally within a reasonable time limit. However, no existing approach is well-accepted in this regard. In this paper, for efficiently solving RCPSPs, a memetic algorithm is proposed. The proposed algorithm incorporates local search techniques and adaptive mutation with a carefully designed genetic algorithm. To judge the performance of the proposed algorithm, we have solved 31 benchmark problems (16 with 30 activities, and 15 problems with 60 activities), and compared the quality of solutions and computational time with other state-of-the-art algorithms. The results show that our proposed algorithm achieved good quality solutions with a significantly lower computational time.","PeriodicalId":403666,"journal":{"name":"2015 IEEE Congress on Evolutionary Computation (CEC)","volume":"333 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122847853","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}
Taku Hasegawa, Kento Tsukada, N. Mori, Keinosuke Matsumoto
{"title":"Search dynamics of fitness landscape learning evolutionary computation with two types of evolution control","authors":"Taku Hasegawa, Kento Tsukada, N. Mori, Keinosuke Matsumoto","doi":"10.1109/CEC.2015.7257204","DOIUrl":"https://doi.org/10.1109/CEC.2015.7257204","url":null,"abstract":"Fitness approximation methods in Evolutionary Computation (EC) provide us good results in real-world optimization. On the other hand, little is known about the advantages and disadvantages of each surrogate models. Moreover, the performance of models depends on a structure of original function. Therefore, various kinds of surrogate models can leads to better results. We also have proposed a novel surrogate model which can estimate the only rank of two individuals using Support Vector Machine. In addition, we have proposed EC framework with that model called Fitness Landscape Learning Evolutionary Computation (FLLEC) which has shown good performance. In this paper, we compared two type of evolution control in FLLEC with the computational experiments.","PeriodicalId":403666,"journal":{"name":"2015 IEEE Congress on Evolutionary Computation (CEC)","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122918862","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}