Charging Guidance of Electric Taxis Based on Adaptive Particle Swarm Optimization.
Ontology highlight
ABSTRACT:
SUBMITTER: Niu L
PROVIDER: S-EPMC4506826 | biostudies-other | 2015
REPOSITORIES: biostudies-other
Similar Datasets
Project description:In this paper, a battery charging model is developed for solar PV system applications. As a means of photovoltaic power controlling system, buck-boost converter with a Maximum Power Point Tracking (MPPT) mechanism is developed in this paper for maximum efficiency. This paper proposed a novel combined technique of hybrid Particle Swarm Optimisation (PSO) and Salp Swarm Optimization (SSO) models to perform Maximum Power Point Tracking mechanisms and obtain a higher efficiency for battery charging. In order to retrieve the maximum power from the PV array, the Maximum Power Point Tracking mechanism is observed which reaches the maximum efficiency and the maximum power is fed through the buck-boost converter into the load. The buck-boost converter steps up the voltage to essential magnitude. The energy drawn from the PV array is used for the battery charging by means of an isolated buck converter since the buck-boost converter is not directly connected to the battery. The Fractional Order Proportional Integral Derivative (FOPID) controller handles the isolated buck converter and battery to enhance the efficiency obtained through the Maximum Power Point Tracking mechanism. The simulation results show higher steady efficiency by using the hybrid PSOSSO algorithm in all stages. The battery is charged without losing the efficiency obtained from the hybrid PSOSSO algorithm-based Maximum Power Point Tracking mechanism. The higher efficiency was obtained as 99.99% at Standard Test Conditions (STC) and 99.52% at PV partial shading conditions (PSCs) by using the new hybrid algorithm.
| S-EPMC8854737 | biostudies-literature
Project description:Feature selection is an important preprocessing method in machine learning and data mining. This process can be used not only to reduce the amount of data to be analyzed but also to build models with stronger interpretability based on fewer features. Traditional feature selection methods evaluate the dependency and redundancy of features separately, which leads to a lack of measurement of their combined effect. Moreover, a greedy search considers only the optimization of the current round and thus cannot be a global search. To evaluate the combined effect of different subsets in the entire feature space, an adaptive feature selection method based on V-shaped binary particle swarm optimization is proposed. In this method, the fitness function is constructed using the correlation information entropy. Feature subsets are regarded as individuals in a population, and the feature space is searched using V-shaped binary particle swarm optimization. The above procedure overcomes the hard constraint on the number of features, enables the combined evaluation of each subset as a whole, and improves the search ability of conventional binary particle swarm optimization. The proposed algorithm is an adaptive method with respect to the number of feature subsets. The experimental results show the advantages of optimizing the feature subsets using the V-shaped transfer function and confirm the effectiveness and efficiency of the feature subsets obtained under different classifiers.
| S-EPMC5373580 | biostudies-literature
Project description:This paper introduces a novel variant of the quantum particle swarm optimization algorithm based on the quantum concept of particle-like solitons as the most common solutions of the quantum nonlinear Schrödinger equation. Soliton adaptation in external potentials is one of their most remarkable features which allows them to be stabilized even without a trapping potential, while the potential must be bounded for quantum particles to be localized. So we consider the motion scenario of the present algorithm based on the corresponding probability density function of quantum solitons. To evaluate the efficiency, we examine the proposed algorithm over a set of known benchmark functions, including a selection of test functions with different modalities and dimensions. Moreover, to achieve a more comprehensive conclusion about the performance, we compare it with the results obtained by particle swarm optimization (PSO), standard quantum-behaved particle swarm optimization QPSO, improved sine cosine Algorithm (ISCA), and JAYA optimization algorithm. The numerical experiments reveal that the proposed algorithm is an effective approach to solving optimization problems that provides promising results in terms of better global search capability, high accuracy, and faster convergence rate.
| S-EPMC9385677 | biostudies-literature
Project description:This research paper develops a novel hybrid approach, called hybrid particle swarm optimization-teaching-learning-based optimization (hPSO-TLBO), by combining two metaheuristic algorithms to solve optimization problems. The main idea in hPSO-TLBO design is to integrate the exploitation ability of PSO with the exploration ability of TLBO. The meaning of "exploitation capabilities of PSO" is the ability of PSO to manage local search with the aim of obtaining possible better solutions near the obtained solutions and promising areas of the problem-solving space. Also, "exploration abilities of TLBO" means the ability of TLBO to manage the global search with the aim of preventing the algorithm from getting stuck in inappropriate local optima. hPSO-TLBO design methodology is such that in the first step, the teacher phase in TLBO is combined with the speed equation in PSO. Then, in the second step, the learning phase of TLBO is improved based on each student learning from a selected better student that has a better value for the objective function against the corresponding student. The algorithm is presented in detail, accompanied by a comprehensive mathematical model. A group of benchmarks is used to evaluate the effectiveness of hPSO-TLBO, covering various types such as unimodal, high-dimensional multimodal, and fixed-dimensional multimodal. In addition, CEC 2017 benchmark problems are also utilized for evaluation purposes. The optimization results clearly demonstrate that hPSO-TLBO performs remarkably well in addressing the benchmark functions. It exhibits a remarkable ability to explore and exploit the search space while maintaining a balanced approach throughout the optimization process. Furthermore, a comparative analysis is conducted to evaluate the performance of hPSO-TLBO against twelve widely recognized metaheuristic algorithms. The evaluation of the experimental findings illustrates that hPSO-TLBO consistently outperforms the competing algorithms across various benchmark functions, showcasing its superior performance. The successful deployment of hPSO-TLBO in addressing four engineering challenges highlights its effectiveness in tackling real-world applications.
| S-EPMC10813294 | biostudies-literature
Project description:In recent years, comprehensive learning particle swarm optimization (CLPSO) has attracted the attention of many scholars for using in solving multimodal problems, as it is excellent in preserving the particles' diversity and thus preventing premature convergence. However, CLPSO exhibits low solution accuracy. Aiming to address this issue, we proposed a novel algorithm called LILPSO. First, this algorithm introduced a Lagrange interpolation method to perform a local search for the global best point (gbest). Second, to gain a better exemplar, one gbest, another two particle's historical best points (pbest) are chosen to perform Lagrange interpolation, then to gain a new exemplar, which replaces the CLPSO's comparison method. The numerical experiments conducted on various functions demonstrate the superiority of this algorithm, and the two methods are proven to be efficient for accelerating the convergence without leading the particle to premature convergence.
| S-EPMC4849747 | biostudies-literature
Project description:To enhance the triangle quality of a reconstructed triangle mesh, a novel triangle mesh standardization method based on particle swarm optimization (PSO) is proposed. First, each vertex of the mesh and its first order vertices are fitted to a cubic curve surface by using least square method. Additionally, based on the condition that the local fitted surface is the searching region of PSO and the best average quality of the local triangles is the goal, the vertex position of the mesh is regulated. Finally, the threshold of the normal angle between the original vertex and regulated vertex is used to determine whether the vertex needs to be adjusted to preserve the detailed features of the mesh. Compared with existing methods, experimental results show that the proposed method can effectively improve the triangle quality of the mesh while preserving the geometric features and details of the original mesh.
| S-EPMC4979957 | biostudies-literature
Project description:BackgroundIdentifying approximately repeated patterns, or motifs, in DNA sequences from a set of co-regulated genes is an important step towards deciphering the complex gene regulatory networks and understanding gene functions.ResultsIn this work, we develop a novel motif finding algorithm (PSO+) using a population-based stochastic optimization technique called Particle Swarm Optimization (PSO), which has been shown to be effective in optimizing difficult multidimensional problems in continuous domains. We propose a modification of the standard PSO algorithm to handle discrete values, such as characters in DNA sequences. The algorithm provides several features. First, we use both consensus and position-specific weight matrix representations in our algorithm, taking advantage of the efficiency of the former and the accuracy of the latter. Furthermore, many real motifs contain gaps, but the existing methods usually ignore them or assume a user know their exact locations and lengths, which is usually impractical for real applications. In comparison, our method models gaps explicitly, and provides an easy solution to find gapped motifs without any detailed knowledge of gaps. Our method allows the presence of input sequences containing zero or multiple binding sites.ConclusionExperimental results on synthetic challenge problems as well as real biological sequences show that our method is both more efficient and more accurate than several existing algorithms, especially when gaps are present in the motifs.
| S-EPMC3022572 | biostudies-literature
Project description:Particle swarm optimization (PSO) is a nature-inspired algorithm that has shown outstanding performance in solving many realistic problems. In the original PSO and most of its variants all particles are treated equally, overlooking the impact of structural heterogeneity on individual behavior. Here we employ complex networks to represent the population structure of swarms and propose a selectively-informed PSO (SIPSO), in which the particles choose different learning strategies based on their connections: a densely-connected hub particle gets full information from all of its neighbors while a non-hub particle with few connections can only follow a single yet best-performed neighbor. Extensive numerical experiments on widely-used benchmark functions show that our SIPSO algorithm remarkably outperforms the PSO and its existing variants in success rate, solution quality, and convergence speed. We also explore the evolution process from a microscopic point of view, leading to the discovery of different roles that the particles play in optimization. The hub particles guide the optimization process towards correct directions while the non-hub particles maintain the necessary population diversity, resulting in the optimum overall performance of SIPSO. These findings deepen our understanding of swarm intelligence and may shed light on the underlying mechanism of information exchange in natural swarm and flocking behaviors.
| S-EPMC4365407 | biostudies-other
Project description:The improvement and development of blood-contacting devices, such as mechanical circulatory support systems, is a life saving endeavor. These devices must be designed in such a way that they ensure the highest hemocompatibility. Therefore, in-silico trials (flow simulations) offer a quick and cost-effective way to analyze and optimize the hemocompatibility and performance of medical devices. In that regard, the prediction of blood trauma, such as hemolysis, is the key element to ensure the hemocompatibility of a device. But, despite decades of research related to numerical hemolysis models, their accuracy and reliability leaves much to be desired. This study proposes a novel optimization path, which is capable of improving existing models and aid in the development of future hemolysis models. First, flow simulations of three, turbulent blood flow test cases (capillary tube, FDA nozzle, FDA pump) were performed and hemolysis was numerically predicted by the widely-applied stress-based hemolysis models. Afterward, a multiple-objective particles swarm optimization (MOPSO) was performed to tie the physiological stresses of the simulated flow field to the measured hemolysis using an equivalent of over one million numerically determined hemolysis predictions. The results show that our optimization is capable of improving upon existing hemolysis models. However, it also unveils some deficiencies and limits of hemolysis prediction with stress-based models, which will need to be addressed in order to improve its reliability.
| S-EPMC10097800 | biostudies-literature
Project description:The recently proposed multiobjective particle swarm optimization algorithm based on competition mechanism algorithm cannot effectively deal with many-objective optimization problems, which is characterized by relatively poor convergence and diversity, and long computing runtime. In this paper, a novel multi/many-objective particle swarm optimization algorithm based on competition mechanism is proposed, which maintains population diversity by the maximum and minimum angle between ordinary and extreme individuals. And the recently proposed θ-dominance is adopted to further enhance the performance of the algorithm. The proposed algorithm is evaluated on the standard benchmark problems DTLZ, WFG, and UF1-9 and compared with the four recently proposed multiobjective particle swarm optimization algorithms and four state-of-the-art many-objective evolutionary optimization algorithms. The experimental results indicate that the proposed algorithm has better convergence and diversity, and its performance is superior to other comparative algorithms on most test instances.
| S-EPMC7063896 | biostudies-literature