{"title":"Swarm intelligence and evolutionary approaches for reactive power and voltage control","authors":"L. Grant, G. Venayagamoorthy, G. Krost, G. Bakare","doi":"10.1109/SIS.2008.4668314","DOIUrl":"https://doi.org/10.1109/SIS.2008.4668314","url":null,"abstract":"This paper presents a comparison of swarm intelligence and evolutionary techniques based approaches for minimization of system losses and improvement of voltage profiles in a power network. Efficient distribution of reactive power in an electric network can be achieved by adjusting the excitation on generators, the on-load tap changer positions of transformers, and proper switching of discrete portions of inductors or capacitors. This is a mixed integer non-linear optimization problem where metaheuristics techniques have proven suitable for providing optimal solutions. Four algorithms explored in this paper include differential evolution (DE), particle swarm optimization (PSO), a hybrid combination of DE and PSO, and a mutated PSO (MPSO) algorithm. The effectiveness of these algorithms is evaluated based on their solution quality and convergence characteristic. Simulation studies on the Nigerian power system show that a PSO based solution is more effective than a DE approach in reducing real power losses while keeping the voltage profiles within acceptable limits. The results also show that MPSO allows for further reduction of the real power losses while maintaining a satisfactory voltage profile.","PeriodicalId":178251,"journal":{"name":"2008 IEEE Swarm Intelligence Symposium","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114598516","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":"Multi-objective design optimization of Surface Mount Permanent Magnet machine with particle swarm intelligence","authors":"Y. Duan, R. Harley, T. Habetler","doi":"10.1109/SIS.2008.4668319","DOIUrl":"https://doi.org/10.1109/SIS.2008.4668319","url":null,"abstract":"An efficient multi-objective design method with particle swarm optimization (PSO) is developed for surface mount permanent magnet machines to reduce the complexity in the PMSM machine design. First an analytical model of the PMSM machinepsilas geometry is developed and results are verified by finite element analysis. With proper design specification and assumption, the design input variables in this model can be reduced to as low as two, which significantly simplifies the optimization process. PSO is then applied to this analytical model. Compared to the traditional machine design methods, this proposed algorithm finds the optimized solution with fast computation and high convergence.","PeriodicalId":178251,"journal":{"name":"2008 IEEE Swarm Intelligence Symposium","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121206693","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":"Particle Swarm Optimization with Quantum Infusion for the design of digital filters","authors":"Bipul Luitel, G. Venayagamoorthy","doi":"10.1109/SIS.2008.4668316","DOIUrl":"https://doi.org/10.1109/SIS.2008.4668316","url":null,"abstract":"In this paper, particle swarm optimization with quantum infusion (PSO-QI) has been applied for the design of digital filters. In PSO-QI, Global best (gbest) particle (in PSO star topology) obtained from particle swarm optimization is enhanced by doing a tournament with an offspring produced by quantum behaved PSO, and selecting the winner as the new gbest. Filters are designed based on the best approximation to the ideal response by minimizing the maximum ripples in passband and stopband of the filter response. PSO-QI, as is shown in the paper, converges to a better fitness. This new algorithm is implemented in the design of finite impulse response (FIR) and infinite impulse response (IIR) filter.","PeriodicalId":178251,"journal":{"name":"2008 IEEE Swarm Intelligence Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130732399","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":"Human vs. swarm: An NK landscape game","authors":"Xiaohui Hu, R. Eberhart","doi":"10.1109/SIS.2008.4668283","DOIUrl":"https://doi.org/10.1109/SIS.2008.4668283","url":null,"abstract":"This paper describes a computer game the purpose of which is to investigate how humans interact with swarm intelligence. The game is based on an NK landscape as described by Stuart Kaufmann. It is concluded that the combination of a human-swarm team may have advantages in certain environments, such as dynamic decision making tasks. The team approach can combine computer computational power with human intuitive knowledge to provide improved performance for dynamic and complex tasks.","PeriodicalId":178251,"journal":{"name":"2008 IEEE Swarm Intelligence Symposium","volume":"AES-3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126494442","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 transmission power and hop count in ad hoc unicast routing with swarm intelligence","authors":"Ke Li, Chien-Chung Shen","doi":"10.1109/SIS.2008.4668323","DOIUrl":"https://doi.org/10.1109/SIS.2008.4668323","url":null,"abstract":"This paper describes CEDAR, a unicast routing protocol that balances transmission power and hop count in ad hoc networks. The protocol adopts the mechanism of swarm intelligence to dynamically assign transmission power to nodes along the discovered route (to reduce the sum of transmission power) subject to an end-to-end hop count constraint in data delivery. Simulation results validated the effectiveness of the protocol, and demonstrated the tradeoff relationship between end-to-end total transmission power and hop count.","PeriodicalId":178251,"journal":{"name":"2008 IEEE Swarm Intelligence Symposium","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121823247","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}
Cheng-Hung Chen, K. Bosworth, M. Schoen, S. Bearden, D. Naidu, A. P. Gracia
{"title":"A study of Particle Swarm Optimization on leukocyte adhesion molecules and control strategies for smart prosthetic hand","authors":"Cheng-Hung Chen, K. Bosworth, M. Schoen, S. Bearden, D. Naidu, A. P. Gracia","doi":"10.1109/SIS.2008.4668324","DOIUrl":"https://doi.org/10.1109/SIS.2008.4668324","url":null,"abstract":"Hard computing based optimization algorithms usually require a lot of computational resources and generally do not have the ability to arrive at the global optimum solution. Soft computing algorithms on the other hand negate these deficiencies, by allowing for reduced computational loads and the ability to find global optimal solutions, even for complex cost surfaces. This paper presents two numerical case studies where a particle swarm optimization (PSO) algorithm is applied to biomedical problems. In particular, the problem of identifying the rupture force for leukocyte adhesion molecules and the problem of finding the correct control parameters of a robotic hand, are addressed. Simulation results indicate that PSO is a feasible alternative to the computational expensive hard computing algorithms.","PeriodicalId":178251,"journal":{"name":"2008 IEEE Swarm Intelligence Symposium","volume":"255 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121328681","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Luis V. Santana-Quintero, C. Coello, A. G. Hernández-Díaz, J. Velázquez-Reyes
{"title":"Surrogate-based Multi-Objective Particle Swarm Optimization","authors":"Luis V. Santana-Quintero, C. Coello, A. G. Hernández-Díaz, J. Velázquez-Reyes","doi":"10.1109/SIS.2008.4668300","DOIUrl":"https://doi.org/10.1109/SIS.2008.4668300","url":null,"abstract":"This paper presents a new algorithm that approximates real function evaluations using supervised learning with a surrogate method called support vector machine (SVM). We perform a comparative study among different leader selection schemes in a multi-objective particle swarm optimizer (MOPSO), in order to determine the most appropriate approach to be adopted for solving the sort of problems of our interest. The resulting hybrid presents a poor spread of solutions, which motivates the introduction of a second phase to our algorithm, in which an approach called rough sets is adopted in order to improve the spread of solutions along the Pareto front. Rough sets are used as a local search engine, which is able to generate solutions in the neighborhood of the nondominated solutions previously generated by the surrogate-based algorithm. The resulting approach is able to generate reasonably good approximations of the Pareto front of problems of up to 30 decision variables with only 2,000 fitness function evaluations. Our results are compared with respect to the NSGA-II, which is a multi-objective evolutionary algorithm representative of the state-of-the-art in the area.","PeriodicalId":178251,"journal":{"name":"2008 IEEE Swarm Intelligence Symposium","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133489257","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":"Image-based tracking with Particle Swarms and Probabilistic Data Association","authors":"E. Kao, Peter VanMaasdam, John W. Sheppard","doi":"10.1109/SIS.2008.4668297","DOIUrl":"https://doi.org/10.1109/SIS.2008.4668297","url":null,"abstract":"The process of automatically tracking people within video sequences is currently receiving a great deal of interest within the computer vision research community. In this paper we contrast the performance of the popular Mean-Shift algorithmpsilas gradient descent based search strategy with a more advanced swarm intelligence technique. Towards this end, we propose the use of a Particle Swarm Optimization (PSO) algorithm to replace the gradient descent search, and also combine the swarm based search strategy with a Probabilistic Data Association Filter (PDAF) state estimator to perform the track association and maintenance stages. Performance is shown against a variety of data sets, ranging from easy to complex. The PSO-PDAF approach is seen to outperform both the Mean-Shift + Kalman filter and the single-measurement PSO + Kalman filter approach. However, PSOpsilas robustness to low contrast and occlusion comes at the cost of higher computational requirements.","PeriodicalId":178251,"journal":{"name":"2008 IEEE Swarm Intelligence Symposium","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132706624","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}
Leonardo D. Oliveira, T. Abrão, P. Jeszensky, F. Casadevall
{"title":"Particle swarm optimization assisted multiuser detector for M-QAM DS/CDMA systems","authors":"Leonardo D. Oliveira, T. Abrão, P. Jeszensky, F. Casadevall","doi":"10.1109/SIS.2008.4668321","DOIUrl":"https://doi.org/10.1109/SIS.2008.4668321","url":null,"abstract":"This paper analyzes the particle swarm optimization multiuser detector (PSO-MUD) under high-order modulation schemes, (particularly for M-QAM), in DS/CDMA systems single-input-single-output (SISO) multipath channels. In order to avoid the computation of complex-valued variables in high-order squared modulation, the optimization problem is reformulated as a real-valued problem. Considering previous results on literature for low-order modulation formats (usually binary/quadrature phase shift keying - BPSK/QPSK), a performancetimescomplexity trade-off comparison is carried out between PSO-MUD and local search multiuser detector (LS-MUD). Performance is evaluated by the symbol error rate (SER), and complexity by necessary number of cost function calculations for convergence. If the background for BPSK heuristic multiuser detection (HEURMUD) problem indicates that the 1-opt local search method is enough to achieve excellent performancetimescomplexity trade-offs, our Monte-Carlo simulation results and analysis show herein indicate the LS-MUD presents a lack of search diversity under high-order modulation formats, while the PSO-MUD is efficient to solve the MUD problem for high-order modulation schemes.","PeriodicalId":178251,"journal":{"name":"2008 IEEE Swarm Intelligence Symposium","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132731850","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":"Catfish particle swarm optimization","authors":"Li-Yeh Chuang, S. Tsai, Cheng-Hong Yang","doi":"10.1109/SIS.2008.4668277","DOIUrl":"https://doi.org/10.1109/SIS.2008.4668277","url":null,"abstract":"Catfish particle swarm optimization (CatfishPSO) is a novel optimization algorithm proposed in this paper. The mechanism is dependent on the incorporation of a catfish particle into the linearly decreasing weight particle swarm optimization (LDWPSO). The introduced catfish particle improves the performance of LDWPSO. Unlike other ordinary particles, the catfish particles will initialize a new search from the extreme points of the search space when the gbest fitness value (global optimum at each iteration) has not been changed for a given time, which results in further opportunities to find better solutions for the swarm by guiding the whole swarm to promising new regions of the search space, and accelerating convergence. In our experiment, CatfishPSO, LDWPSO and other improved PSO procedures were extensively compared on three benchmark test functions with 10, 20 and 30 different dimensions. Experimental results indicate that CatfishPSO achieves better performance than LDWPSO procedure and other improved PSO algorithms from the literature.","PeriodicalId":178251,"journal":{"name":"2008 IEEE Swarm Intelligence Symposium","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117077963","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}