D. R. Pereira, M. A. Pazoti, Luís A. M. Pereira, J. Papa
{"title":"A social-spider optimization approach for support vector machines parameters tuning","authors":"D. R. Pereira, M. A. Pazoti, Luís A. M. Pereira, J. Papa","doi":"10.1109/SIS.2014.7011769","DOIUrl":"https://doi.org/10.1109/SIS.2014.7011769","url":null,"abstract":"The choice of hyper-parameters in Support Vector Machines (SVM)-based learning is a crucial task, since different values may degrade its performance, as well as can increase the computational burden. In this paper, we introduce a recently developed nature-inspired optimization algorithm to find out suitable values for SVM kernel mapping named Social-Spider Optimization (SSO). We compare the results obtained by SSO against with a Grid-Search, Particle Swarm Optimization and Harmonic Search. Statistical evaluation has showed SSO can outperform the compared techniques for some sort of kernels and datasets.","PeriodicalId":380286,"journal":{"name":"2014 IEEE Symposium on Swarm Intelligence","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114877593","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":"Non-dominated sorting cuckoo search for multiobjective optimization","authors":"Xingshi He, Na Li, Xin-She Yang","doi":"10.1109/SIS.2014.7011772","DOIUrl":"https://doi.org/10.1109/SIS.2014.7011772","url":null,"abstract":"Cuckoo search is a swarm-intelligence-based algorithm that is very effective for solving highly nonlinear optimization problems. In this paper, the multiobjective cuckoo search is extended so as to obtain high-quality Pareto fronts more accurately for multiobjective optimization problems with complex constraints. The proposed approach uses a combination of the cuckoo search with non-dominated sorting and archiving techniques. The performance of the proposed approach is validated by seven test problems. The convergence property and diversity as well as uniformity are compared with those of the NSGA-II. The results show that the proposed approach can find Pareto fronts with better uniformity and quicker convergence.","PeriodicalId":380286,"journal":{"name":"2014 IEEE Symposium on Swarm Intelligence","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123095441","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":"Balancing search direction in cultural algorithm for enhanced global numerical optimization","authors":"Mostafa Z. Ali, Noor H. Awad, R. Reynolds","doi":"10.1109/SIS.2014.7011814","DOIUrl":"https://doi.org/10.1109/SIS.2014.7011814","url":null,"abstract":"Many meta-heuristics methods are applied to guide the exploration and exploitation of the search space for large scale optimization problems. These problems have attracted much attention from researchers who proposed developed a variety of techniques for locating the optimal solutions. Cultural Algorithm has been recently adopted to solve global numerical optimization problems. In this paper, a modified version of Cultural Algorithm (CA) that uses four knowledge sources in order to incorporate the information obtained from the objective function as well as constraint violation into knowledge structure in the belief space is proposed. The archived knowledge in the proposed approach will be used to enhance the way the belief space influences future generations of problem solvers. The first step is to use the four knowledge sources to guide the direction of the search to more promising solutions. The search is balanced between exploration and exploitation by dynamically adjusting the number of evaluations available for each type of knowledge source based on whether is primarily exploratory or exploitative. The second step selects one local search method to find the nearest solutions to those proposed by the knowledge sources. The proposed work is employed to solve seven global optimization problems in 50 and 100 dimensions, and an engineering application problem. Simulation results show how the approach speeds up the convergence process with very competitive results on such complex benchmarks when compared to other state-of-the-art algorithms.","PeriodicalId":380286,"journal":{"name":"2014 IEEE Symposium on Swarm Intelligence","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121710259","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 planner for autonomous risk-sensitive coverage (PARCov) by a team of unmanned aerial vehicles","authors":"Alex Wallar, E. Plaku, D. Sofge","doi":"10.1109/SIS.2014.7011807","DOIUrl":"https://doi.org/10.1109/SIS.2014.7011807","url":null,"abstract":"This paper proposes a path-planning approach to enable a team of unmanned aerial vehicles (UAVs) to efficiently conduct surveillance of sensitive areas. The proposed approach, termed PARCov (Planner for Autonomous Risk-sensitive Coverage), seeks to maximize the area covered by the sensors mounted on each UAV while maintaining high sensor data quality and minimizing detection risk. PARCov leverages from swarm intelligence the idea of using simple interactions among UAVs to promote an emergent behavior that achieves the desired objectives. PARCov uses a dynamic grid to keep track of the parts of the space that have been surveyed and the times that they were last surveyed. This information is then used to move the UAVs toward areas that have not been covered in a long time. Moreover, a nonlinear optimization formulation is used to determine the altitude at which each UAV flies. The efficiency and scalability of PARCov is demonstrated in simulation using complex environments and an increasing number of UAVs to conduct risk-sensitive surveillance.","PeriodicalId":380286,"journal":{"name":"2014 IEEE Symposium on Swarm Intelligence","volume":"68 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122801413","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":"Hybrid cooperative co-evolution for large scale optimization","authors":"Mohammed El-Abd","doi":"10.1109/SIS.2014.7011815","DOIUrl":"https://doi.org/10.1109/SIS.2014.7011815","url":null,"abstract":"In this paper, we propose the idea of hybrid cooperative co-evolution (hCC). In CC, multiple instances of the same evolutionary algorithm work in parallel, each optimizes a different subset of the problem in hand. In recent years, different approaches have been introduced to divide the problem variables into separate groups based on the property of separability. The idea is that when dependent variables are grouped together, a better optimization performance is reached. However, the same evolutionary algorithm is still applied to all groups regardless of the type of variables each group contains. In this work, we propose the use of multiple evolutionary algorithms to optimize the different subsets within the CC framework. We use one algorithm for the non-separable group(s) and another algorithm for the separable group. Experiments carried on the CEC10 benchmarks indicate the promising performance of this proposed approach.","PeriodicalId":380286,"journal":{"name":"2014 IEEE Symposium on Swarm Intelligence","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116288497","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An artificial bee colony algorithm for minimum weight dominating set","authors":"C. G. Nitash, Alok Singh","doi":"10.1109/SIS.2014.7011811","DOIUrl":"https://doi.org/10.1109/SIS.2014.7011811","url":null,"abstract":"The minimum weight dominating set (MWDS) problem is a classic NP-Hard optimisation problem with a wide range of practical applications. As a result, many algorithms have been proposed for this problem. Several greedy and approximation algorithms exist which provide good results for unit disk graphs with smooth weights. However, these algorithms do not perform well when applied to general graphs. There are a few metaheuristics in the literature such as genetic algorithms and ant colony optimisation algorithm, which also work for general graphs. In this paper, a swarm intelligence algorithm called artificial bee colony (ABC) algorithm is presented for the MWDS problem. The proposed ABC algorithm is compared with other metaheuristics in the literature and shown to perform better than any of these metaheuristics, both in terms of solution quality and time taken.","PeriodicalId":380286,"journal":{"name":"2014 IEEE Symposium on Swarm Intelligence","volume":"178 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134242075","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Evolving novel algorithm based on intellectual behavior of Wild dog group as optimizer","authors":"A. S. Buttar, A. K. Goel, Shakti Kumar","doi":"10.1109/SIS.2014.7011768","DOIUrl":"https://doi.org/10.1109/SIS.2014.7011768","url":null,"abstract":"Numerous algorithms have been invented for optimizations which are nature inspired and based on real life behaviour of species. In this paper, intelligent chasing and hunting methods adopted by the dogs to chase and hunt their prey in groups are used to develop the novel methodology named as “Dog Group Wild Chase and Hunt Drive (DGWCHD) Algorithm”. The proposed algorithm has been implemented on some TSP benchmark problems. These benchmark problems have been solved by different researchers for optimization as test bed for performance analysis of their proposed novel intelligent algorithms like Ant Colony System (ACS), Genetic Algorithms (GA), Simulated Annealing (SA), Evolutionary Programming (EP), The Multi-Agent Optimization System (MAOS), Particle Swarm Optimization (PSO) and Neural Networks (NN). The performance analysis of the novel proposed DGWCHD algorithm has been done and results are compared with other nature inspired techniques. The results obtained are very optimistic and encouraging.","PeriodicalId":380286,"journal":{"name":"2014 IEEE Symposium on Swarm Intelligence","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134462505","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":"Fitness function evaluations: A fair stopping condition?","authors":"A. Engelbrecht","doi":"10.1109/SIS.2014.7011793","DOIUrl":"https://doi.org/10.1109/SIS.2014.7011793","url":null,"abstract":"It has become acceptable practice to use only a limit on the number of fitness function evaluations (FEs) as a stopping condition when comparing population-based optimization algorithms, irrespective of the initial number of candidate solutions. This practice has been advocated in a number of competitions to compare the performance of population-based algorithms, and has been used in many articles that contain empirical comparisons of algorithms. This paper advocates the opinion that this practice does not result in fair comparisons, and provides an abundance of empirical evidence to support this claim. Empirical results are obtained from application of a standard global best particle swarm optimization (PSO) algorithm with different swarm sizes under the same FE computational limit, on a large benchmark suite.","PeriodicalId":380286,"journal":{"name":"2014 IEEE Symposium on Swarm Intelligence","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129003399","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 computational basis for the presence of sub-cultures in cultural algoithms","authors":"Yousof A. Gawasmeh, R. Reynolds","doi":"10.1109/SIS.2014.7011813","DOIUrl":"https://doi.org/10.1109/SIS.2014.7011813","url":null,"abstract":"Cultural Algorithms are computational models of social evolution based upon principle of Cultural Evolution. A Cultural Algorithm consists of a Belief Space consisting of a network of active and passive knowledge sources and a Population Space of agents. The agents are connected via a social fabric over which information used in agent problem solving as passed. The knowledge sources in the Belief Space compete with each other in order to influence the decision making of agents in the Population Space. Likewise, the problem solving experiences of agents in the Population Space are sent back to the Belief Space and used to update the knowledge sources there. It is a dual inheritance system in which both the Population and Belief spaces evolve in parallel. In this paper we investigate why sub-cultures can emerge in the Population Space in response to the complexity of the problems presented to a Cultural System. This system is compared with other evolutionary approaches relative to a variety of benchmark problem of varying complexity. We show that the presence of sub-cultures can provide computational advantages in problem landscape that are generated by multiple independent processes. These advantages can increase problem solving efficiency along with the ability to dampen the impact of increase in problem complexity.","PeriodicalId":380286,"journal":{"name":"2014 IEEE Symposium on Swarm Intelligence","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123657664","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 bio-inspired approach to task assignment of multi-robots","authors":"Xin Yi, Anmin Zhu, Zhong Ming","doi":"10.1109/SIS.2014.7011778","DOIUrl":"https://doi.org/10.1109/SIS.2014.7011778","url":null,"abstract":"In this paper, a SOM (self organizing map)-based approach to task assignment of multi-robots in 3-D dynamic environments is proposed. This approach intends to mimic the operating mechanism of biological neural systems, and integrates the advantages and characteristics of biological neural systems. It is capable of dynamically planning the paths of multi-robots in 3-D environments under uncertain situations, such as when some robots are added in or broken down or when more than one robot is needed for some special task locations. The effectiveness and efficiency of the proposed approach are demonstrated by simulation studies.","PeriodicalId":380286,"journal":{"name":"2014 IEEE Symposium on Swarm Intelligence","volume":"121 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114522644","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}