Cultural-Based Multi-Objective Particle Swarm Optimization for EEG Channel Reduction in Multi-Class Brain-Computer Interfaces

2012 ◽  
Vol 239-240 ◽  
pp. 1027-1032 ◽  
Author(s):  
Qing Guo Wei ◽  
Yan Mei Wang ◽  
Zong Wu Lu
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Problems ◽  
Real Life ◽  
Particle Swarm ◽  
Channel Selection ◽  
L1 Norm ◽  
Swarm Optimization ◽  
Multi Objective ◽  
Channel Reduction ◽  
Novel Method

Applying many electrodes is undesirable for real-life brain-computer interface (BCI) application since the recording preparation can be troublesome and time-consuming. Multi-objective particle swarm optimization (MOPSO) has been widely utilized to solve multi-objective optimization problems and thus can be employed for channel selection. This paper presented a novel method named cultural-based MOPSO (CMOPSO) for channel selection in motor imagery based BCI. The CMOPSO method introduces a cultural framework to adapt the personalized flight parameters of the mutated particles. A comparison between the proposed algorithm and typical L1-norm algorithm was conducted, and the results showed that the proposed approach is more effective in selecting a smaller subset of channels while maintaining the classification accuracy unreduced.

Chaos Particle Swarm Optimization Algorithm for Optimization Problems

2018 ◽  
Vol 32 (11) ◽  
pp. 1859019 ◽  
Author(s):  
Wenbin Liu ◽  
Nengsheng Luo ◽  
Guo Pan ◽  
Aijia Ouyang
Keyword(s):  
Global Optimization ◽  
Particle Swarm Optimization ◽  
Simulation Experiment ◽  
Optimization Problems ◽  
Real Life ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Swarm Optimization ◽  
Parameter Inversion ◽  
Novel Method

A chaos particle swarm optimization (CPSO) algorithm based on the chaos operator (CS) is proposed for global optimization problems and parameter inversion of the nonlinear sun shadow model in our study. The CPSO algorithm combines the local search ability of CS and the global search ability of PSO algorithm. The CPSO algorithm can not only solve the global optimization problems effectively, but also address the parameter inversion problems of the date of sun shadow model location successfully. The results of numerical experiment and simulation experiment show that the CPSO algorithm has higher accuracy and faster convergence than the-state-of-the-art techniques. It can effectively improve the computing accuracy and computing efficiency of the global optimization problems, and also provide a novel method to solve the problems of integer parameter inversion in real life.

scholarly journals A Distributed Multifactorial Particle Swarm Optimization Approach

2021 ◽  
Author(s):  
Ahlem Aboud ◽  
Nizar Rokbani ◽  
Seyedali Mirjalili ◽  
Abdulrahman M. Qahtani ◽  
Omar Almutiry ◽  
...  
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Problems ◽  
Beta Function ◽  
Particle Swarm ◽  
Search Space ◽  
Optimization Approach ◽  
Multi Objective Optimization ◽  
Swarm Optimization ◽  
Multi Objective ◽  
New System

<p>Multifactorial Optimization (MFO) and Evolutionary Transfer Optimization (ETO) are new optimization challenging paradigms for which the multi-Objective Particle Swarm Optimization system (MOPSO) may be interesting despite limitations. MOPSO has been widely used in static/dynamic multi-objective optimization problems, while its potentials for multi-task optimization are not completely unveiled. This paper proposes a new Distributed Multifactorial Particle Swarm Optimization algorithm (DMFPSO) for multi-task optimization. This new system has a distributed architecture on a set of sub-swarms that are dynamically constructed based on the number of optimization tasks affected by each particle skill factor. DMFPSO is designed to deal with the issues of handling convergence and diversity concepts separately. DMFPSO uses Beta function to provide two optimized profiles with a dynamic switching behaviour. The first profile, Beta-1, is used for the exploration which aims to explore the search space toward potential solutions, while the second Beta-2 function is used for convergence enhancement. This new system is tested on 36 benchmarks provided by the CEC’2021 Evolutionary Transfer Multi-Objective Optimization Competition. Comparatives with the state-of-the-art methods are done using the Inverted General Distance (IGD) and Mean Inverted General Distance (MIGD) metrics. Based on the MSS metric, this proposal has the best results on most tested problems.</p>

Multi-objective collaborative multidisciplinary design optimization using particle swarm techniques and fuzzy decision making

2012 ◽  
Vol 226 (9) ◽  
pp. 2281-2295 ◽  
Author(s):  
Mohammad Reza Farmani ◽  
Jafar Roshanian ◽  
Meisam Babaie ◽  
Parviz M Zadeh
Keyword(s):  
Particle Swarm Optimization ◽  
Design Optimization ◽  
Multidisciplinary Design Optimization ◽  
Optimization Problems ◽  
Particle Swarm ◽  
Collaborative Optimization ◽  
Multidisciplinary Design ◽  
Fuzzy Decision ◽  
Swarm Optimization ◽  
Multi Objective

This article focuses on the efficient multi-objective particle swarm optimization algorithm to solve multidisciplinary design optimization problems. The objective is to extend the formulation of collaborative optimization which has been widely used to solve single-objective optimization problems. To examine the proposed structure, racecar design problem is taken as an example of application for three objective functions. In addition, a fuzzy decision maker is applied to select the best solution along the pareto front based on the defined criteria. The results are compared to the traditional optimization, and collaborative optimization formulations that do not use multi-objective particle swarm optimization. It is shown that the integration of multi-objective particle swarm optimization into collaborative optimization provides an efficient framework for design and analysis of hierarchical multidisciplinary design optimization problems.

Optimization of Shell and Tube Heat Exchanger Using Alpha Tuning Elephant Herding Optimization (EHO) Technique

2021 ◽  
Vol 52 ◽  
pp. 92-101
Author(s):  
Jiten Makadia ◽  
C.D. Sankhavara
Keyword(s):  
Particle Swarm Optimization ◽  
Heat Exchanger ◽  
Optimization Problems ◽  
Cost Optimization ◽  
Real Life ◽  
Particle Swarm ◽  
Benchmark Problems ◽  
Swarm Optimization ◽  
Tube Heat Exchanger ◽  
Shell And Tube

Swarm Intelligence algorithms like PSO (Particle Swarm Optimization), ACO (Ant Colony Optimization), ABC (Artificial Bee Colony), Glow-worm swarm Optimization, etc. have been utilized by researchers for solving optimization problems. This work presents the application of a novel modified EHO (Elephant Herding Optimization) for cost optimization of shell and tube heat exchanger. A comparison of the results obtained by EHO in two benchmark problems shows that it is superior to those obtained with genetic algorithm and particle swarm optimization. The overall cost reduction is 13.3 % and 9.68% for both the benchmark problem compared to PSO. Results indicate that EHO can be effectively utilized for solving real-life optimization problems.

Particle Swarm Optimization Algorithms Applied to Antenna and Microwave Design Problems

2012 ◽  
pp. 100-126
Author(s):  
Sotirios K. Goudos ◽  
Zaharias D. Zaharis ◽  
Konstantinos B. Baltzis
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Problems ◽  
Particle Swarm ◽  
Dual Band ◽  
Design Problems ◽  
Swarm Optimization ◽  
Multi Objective ◽  
Fitness Sharing ◽  
Microwave Design ◽  
Velocity Mutation

Particle Swarm Optimization (PSO) is an evolutionary optimization algorithm inspired by the social behavior of birds flocking and fish schooling. Numerous PSO variants have been proposed in the literature for addressing different problem types. In this chapter, the authors apply different PSO variants to common antenna and microwave design problems. The Inertia Weight PSO (IWPSO), the Constriction Factor PSO (CFPSO), and the Comprehensive Learning Particle Swarm Optimization (CLPSO) algorithms are applied to real-valued optimization problems. Correspondingly, discrete PSO optimizers such as the binary PSO (binPSO) and the Boolean PSO with velocity mutation (BPSO-vm) are used to solve discrete-valued optimization problems. In case of a multi-objective optimization problem, the authors apply two multi-objective PSO variants. Namely, these are the Multi-Objective PSO (MOPSO) and the Multi-Objective PSO with Fitness Sharing (MOPSO-fs) algorithms. The design examples presented here include microwave absorber design, linear array synthesis, patch antenna design, and dual-band base station antenna optimization. The conclusion and a discussion on future trends complete the chapter.

An Improved Multi-Objective Particle Swarm Optimization Based on Utopia Point Guided Search

2018 ◽  
Vol 9 (4) ◽  
pp. 71-96 ◽  
Author(s):  
Swapnil Prakash Kapse ◽  
Shankar Krishnapillai
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Problems ◽  
Mechanical Design ◽  
Particle Swarm ◽  
Nsga Ii ◽  
Swarm Optimization ◽  
Guided Search ◽  
Multi Objective ◽  
Search Approach ◽  
Utopia Point

This article demonstrates the implementation of a novel local search approach based on Utopia point guided search, thus improving the exploration ability of multi- objective Particle Swarm Optimization. This strategy searches for best particles based on the criteria of seeking solutions closer to the Utopia point, thus improving the convergence to the Pareto-optimal front. The elite non-dominated selected particles are stored in an archive and updated at every iteration based on least crowding distance criteria. The leader is chosen among the candidates in the archive using the same guided search. From the simulation results based on many benchmark tests, the new algorithm gives better convergence and diversity when compared to existing several algorithms such as NSGA-II, CMOPSO, SMPSO, PSNS, DE+MOPSO and AMALGAM. Finally, the proposed algorithm is used to solve mechanical design based multi-objective optimization problems from the literature, where it shows the same advantages.

Application of Particle Swarm Optimization Based on Support Vector Machine in Multi-Objective Structure Optimization

2012 ◽  
Vol 201-202 ◽  
pp. 283-286
Author(s):  
Chen Yang Chang ◽  
Jing Mei Zhai ◽  
Qin Xiang Xia ◽  
Bin Cai
Keyword(s):  
Support Vector Machine ◽  
Particle Swarm Optimization ◽  
Optimization Design ◽  
Optimization Problems ◽  
Particle Swarm ◽  
Structure Optimization ◽  
Design Parameters ◽  
Support Vector ◽  
Swarm Optimization ◽  
Multi Objective

Aiming at addressing optimization problems of complex mathematical model with large amount of calculation, a method based on support vector machine and particle swarm optimization for structure optimization design was proposed. Support Vector Machine (SVM) is a powerful computational tool for problems with nonlinearity and could establish approximate structures model. Grey relational analysis was utilized to calculate the coefficient between target parameters in order to change the multi-objective optimization problem into a single objective one. The reconstructed models were solved by Particle Swam Optimization (PSO) algorithm. A slip cover at medical treatment was adopted as an example to illustrate this methodology. Appropriate design parameters were selected through the orthogonal experiment combined with ANSYS. The results show this methodology is accurate and feasible, which provides an effective strategy to solve complex optimization problems.

Multi-objective particle swarm optimization using Pareto-based set and aggregation approach

2017 ◽  
Vol 31 (19-21) ◽  
pp. 1740073 ◽  
Author(s):  
Song Huang ◽  
Yan Wang ◽  
Zhicheng Ji
Keyword(s):  
Particle Swarm Optimization ◽  
Local Search ◽  
Real World ◽  
Optimization Problems ◽  
Particle Swarm ◽  
Pareto Set ◽  
Multi Objective Optimization ◽  
Particle Swarm Optimizer ◽  
Swarm Optimization ◽  
Multi Objective

Multi-objective optimization problems (MOPs) need to be solved in real world recently. In this paper, a multi-objective particle swarm optimization based on Pareto set and aggregation approach was proposed to deal with MOPs. Firstly, velocities and positions were updated similar to PSO. Then, global-best set was defined in particle swarm optimizer to preserve Pareto-based set obtained by the population. Specifically, a hybrid updating strategy based on Pareto set and aggregation approach was introduced to update the global-best set and local search was carried on global-best set. Thirdly, personal-best positions were updated in decomposition way, and global-best position was selected from global-best set. Finally, ZDT instances and DTLZ instances were selected to evaluate the performance of MULPSO and the results show validity of the proposed algorithm for MOPs.

Sign in / Sign up

Export Citation Format

Share Document