scholarly journals Compact Sine Cosine Algorithm with Multigroup and Multistrategy for Dispatching System of Public Transit Vehicles

2021 ◽  
Vol 2021 ◽  
pp. 1-16
Author(s):  
Minghui Zhu ◽  
Shu-Chuan Chu ◽  
Qingyong Yang ◽  
Wei Li ◽  
Jeng-Shyang Pan
Keyword(s):  
Public Transit ◽  
Fundamental Problem ◽  
Wide Spectrum ◽  
Optimal Solution ◽  
Communication Strategy ◽  
Local Optimum ◽  
Intergroup Communication ◽  
Grouping Strategy ◽  
Dispatch System ◽  
Sine Cosine Algorithm

This paper studies the problem of intelligence optimization, a fundamental problem in analyzing the optimal solution in a wide spectrum of applications such as transportation and wireless sensor network (WSN). To achieve better optimization capability, we propose a multigroup Multistrategy Compact Sine Cosine Algorithm (MCSCA) by using the compact strategy and grouping strategy, which makes the initialized randomly generated value no longer an individual in the population and avoids falling into the local optimum. New evolution formulas are proposed for the intergroup communication strategy. Performance studies on the CEC2013 benchmark demonstrate the effectiveness of our new approach regarding convergence speed and accuracy. Finally, we apply MCSCA to solve the dispatch system of public transit vehicles. Experimental results show that MCSCA can achieve better optimization.

scholarly journals Improved Adaptive Holonic Particle Swarm Optimization

2019 ◽  
Vol 2019 ◽  
pp. 1-22 ◽  
Author(s):  
Hao Li ◽  
Hongbin Jin ◽  
Hanzhong Wang ◽  
Yanyan Ma
Keyword(s):  
Particle Swarm Optimization ◽  
Particle Swarm ◽  
Optimal Solution ◽  
Pso Algorithm ◽  
Standard Test ◽  
Local Optimum ◽  
Swarm Optimization ◽  
State Switching ◽  
Grouping Strategy ◽  
Number Of Iterations

For the first time , the Holonic Particle Swarm Optimization (HPSO ) algorithm applies multiagent theory about the improvement in the PSO algorithm and achieved good results. In order to further improve the performance of the algorithm, this paper proposes an improved Adaptive Holonic Particle Swarm Optimization (AHPSO) algorithm. Firstly, a brief review of the HPSO algorithm is carried out, and the HPSO algorithm can be further studied in three aspects: grouping strategy, iteration number setting, and state switching discrimination. The HPSO algorithm uses an approximately uniform grouping strategy that is the simplest but does not consider the connections between particles. And if the particles with larger or smaller differences are grouped together in different search stages, the search efficiency will be improved. Therefore, this paper proposes a grouping strategy based on information entropy and system clustering and combines two grouping strategies with corresponding search methods. The performance of the HPSO algorithm depends on the setting of the number of iterations. If it is too small, it is difficult to search for the optimal and it wastes so many computing resources. Therefore, this paper constructs an adaptive termination condition that causes the particles to terminate spontaneously after convergence. The HPSO algorithm only performs a conversion from extensive search to exact search and still has the potential to fall into local optimum. This paper proposes a state switching condition to improve the probability that the algorithm jumps out of the local optimum. Finally, AHPSO and HPSO are compared by using 22 groups of standard test functions. AHPSO is faster in convergence than HPSO, and the number of iterations of AHPSO convergence is employed in HPSO. At this point, there exists a large gap between HPSO and the optimal solution, i.e., AHPSO can have better algorithm efficiency without setting the number of iterations.

Research on Power Load Forecasting Model Based on Hybrid Algorithm Optimizing BP Neural Network

2014 ◽  
Vol 8 (1) ◽  
pp. 723-728 ◽  
Author(s):  
Chenhao Niu ◽  
Xiaomin Xu ◽  
Yan Lu ◽  
Mian Xing
Keyword(s):  
Neural Network ◽  
Optimization Algorithm ◽  
Load Forecasting ◽  
Optimal Solution ◽  
Electric Power System ◽  
Local Optimum ◽  
Good Prediction ◽  
Ant Colony Optimization Algorithm ◽  
The Neural Network ◽  
Power Load

Short time load forecasting is essential for daily planning and operation of electric power system. It is the important basis for economic dispatching, scheduling and safe operation. Neural network, which has strong nonlinear fitting capability, is widely used in the load forecasting and obtains good prediction effect in nonlinear chaotic time series forecasting. However, the neural network is easy to fall in local optimum, unable to find the global optimal solution. This paper will integrate the traditional optimization algorithm and propose the hybrid intelligent optimization algorithm based on particle swarm optimization algorithm and ant colony optimization algorithm (ACO-PSO) to improve the generalization of the neural network. In the empirical analysis, we select electricity consumption in a certain area for validation. Compared with the traditional BP neutral network and statistical methods, the experimental results demonstrate that the performance of the improved model with more precise results and stronger generalization ability is much better than the traditional methods.

scholarly journals Multi-Searcher Optimization for the Optimal Energy Dispatch of Combined Heat and Power-Thermal-Wind-Photovoltaic Systems

2019 ◽  
Vol 9 (3) ◽  
pp. 537 ◽  
Author(s):  
Jianlin Tang ◽  
Tao Yu ◽  
Xiaoshun Zhang ◽  
Zhuohuan Li ◽  
Junbin Chen
Keyword(s):  
Heuristic Algorithms ◽  
Optimal Solution ◽  
Energy System ◽  
Combined Heat And Power ◽  
Superior Performance ◽  
Local Optimum ◽  
Photovoltaic Systems ◽  
Thermal Wind ◽  
Optimal Energy ◽  
Highly Nonlinear

This paper proposes a novel multi-searcher optimization (MSO) algorithm for the optimal energy dispatch (OED) of combined heat and power-thermal-wind-photovoltaic systems. The available power of wind turbine (WT) units and photovoltaic (PV) units is approximated with the probability density functions of wind speed and solar irradiance, respectively. The chaos theory is used to implement a wide global search, which can effectively avoid a low-quality local optimum for OED. Besides, a double-layer searcher is designed to guarantee fast convergence to a high-quality optimal solution. Finally, three benchmark functions and an energy system with 27 units are used for testing the performance of the MSO compared with nine other frequently used heuristic algorithms. The simulation results demonstrate that the proposed technique not only can solve the highly nonlinear, non-smooth, and non-convex OED problem of an energy system, but can also achieve a superior performance for the convergence speed and the optimum quality.

Terrorism and Intergroup Communication

2017 ◽  
Author(s):  
Allison E. Betus ◽  
Michael K. Jablonski ◽  
Anthony F. Lemieux
Keyword(s):  
Social Media ◽  
Media Coverage ◽  
Word Of Mouth ◽  
Communication Strategy ◽  
Intergroup Communication ◽  
Additional Information ◽  
Operational Capabilities ◽  
Foreign Countries ◽  
Violent Acts

Terrorism employs violence or the threat of violence to diffuse and amplify messages to an audience beyond the immediate target or victim of an attack. Violent acts initiate media coverage, as well as word-of-mouth transmission, functioning as a gateway that draws attention to the terror group and its messages in a manner that increases the salience of the communication; then media provides additional information contextualizing the original act. Media coverage may make the group initiating the communication look more dangerous or powerful than is warranted. Terrorist communication strategy involves a noteworthy violent act, or threat thereof, that secondarily communicates with multiple audience groups. One audience may be supporters of the terror group who construct identity from the violent act as well as from grievances that the group seeks to advertise. Another may be outgroups sympathetic with the substance of communicated messages. Still another may be foreign countries, which may provide a sense of legitimacy to the actions of the group. A violent group successfully portrayed as victimized will solidify ingroup cohesion and outgroup hostility while justifying the use of violence as a moral consequence of circumstances. Terrorists often dehumanize the outgroup by stereotyping them in ways they argue will justify violence. People sympathetic with the dehumanization of the outgroup may provide support without actually joining in the perpetration of terror. Some may be radicalized by communication produced by terrorists, such as on social media, to become actors themselves. Counter-terror tactics may disrupt intergroup communication, thus interfering with recruitment or operational capabilities of those supporting or engaging in terrorism.

scholarly journals A novel pigeon-inspired optimization with QUasi-Affine TRansformation evolutionary algorithm for DV-Hop in wireless sensor networks

2020 ◽  
Vol 16 (6) ◽  
pp. 155014772093274 ◽  
Author(s):  
Xiao-Xue Sun ◽  
Jeng-Shyang Pan ◽  
Shu-Chuan Chu ◽  
Pei Hu ◽  
Ai-Qing Tian
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Evolutionary Algorithm ◽  
Optimization Algorithm ◽  
Affine Transformation ◽  
Optimal Solution ◽  
Wireless Sensor ◽  
Local Optimum ◽  
Search Range ◽  
Homing Behavior

In modern times, swarm intelligence has played an increasingly important role in finding an optimal solution within a search range. This study comes up with a novel solution algorithm named QUasi-Affine TRansformation-Pigeon-Inspired Optimization Algorithm, which uses an evolutionary matrix in QUasi-Affine TRansformation Evolutionary Algorithm for the Pigeon-Inspired Optimization Algorithm that was designed using the homing behavior of pigeon. We abstract the pigeons into particles of no quality and improve the learning strategy of the particles. Having different update strategies, the particles get more scientific movement and space exploration on account of adopting the matrix of the QUasi-Affine TRansformation Evolutionary algorithm. It increases the versatility of the Pigeon-Inspired Optimization algorithm and makes the Pigeon-Inspired Optimization less simple. This new algorithm effectively improves the shortcoming that is liable to fall into local optimum. Under a number of benchmark functions, our algorithm exhibits good optimization performance. In wireless sensor networks, there are still some problems that need to be optimized, for example, the error of node positioning can be further reduced. Hence, we attempt to apply the proposed optimization algorithm in terms of positioning, that is, integrating the QUasi-Affine TRansformation-Pigeon-Inspired Optimization algorithm into the Distance Vector–Hop algorithm. Simultaneously, the algorithm verifies its optimization ability by node location. According to the experimental results, they demonstrate that it is more outstanding than the Pigeon-Inspired Optimization algorithm, the QUasi-Affine TRansformation Evolutionary algorithm, and particle swarm optimization algorithm. Furthermore, this algorithm shows up minor errors and embodies a much more accurate location.

Optimal Reactive Power Dispatch Based on Mixed Bacterial Chemotaxis Algorithm

2014 ◽  
Vol 494-495 ◽  
pp. 1849-1852 ◽  
Author(s):  
Xiao Ying Zhang ◽  
Chen Li ◽  
Zhen Li
Keyword(s):  
Reactive Power ◽  
Power Optimization ◽  
Bacterial Chemotaxis ◽  
Optimal Solution ◽  
Pso Algorithm ◽  
Premature Convergence ◽  
Local Optimum ◽  
Reactive Power Optimization ◽  
Optimal Reactive Power Dispatch ◽  
Elite Strategy

Particle Swarm Optimization (PSO) algorithm converges fast but it is easy to fall into local optimum, and bacterial chemotaxis (BC) algorithm prevents premature convergence and prevents falling into local optimum, so a new mixed bacterial chemotaxis (MBC) algorithm is proposed by combining the PSO with BC. The novel algorithm is applied to reactive power optimization on power system. First the PSO is used to find best solution, then BC is used to find the optimal solution among the selected area of previous step, the reserving elite strategy is introduced to enhance the efficiency of the algorithm, and then the optimal solution is obtained. Through the comparison with PSO and BCC in the reactive power optimization of IEEE30-bus system, the results indicate that MBC not only prevents premature convergence to a large extent, but also keeps a more rapid convergence rate than PSO and BCC.

scholarly journals An Entropy-Based Position Projection Algorithm for Motif Discovery

2016 ◽  
Vol 2016 ◽  
pp. 1-11 ◽  
Author(s):  
Yipu Zhang ◽  
Ping Wang ◽  
Maode Yan
Keyword(s):  
Dna Sequences ◽  
Motif Discovery ◽  
Optimal Solution ◽  
Training Model ◽  
Projection Algorithm ◽  
Local Optimum ◽  
The Past ◽  
Local Optimal Solution ◽  
And Function ◽  
Discovery Algorithms

Motif discovery problem is crucial for understanding the structure and function of gene expression. Over the past decades, many attempts using consensus and probability training model for motif finding are successful. However, the most existing motif discovery algorithms are still time-consuming or easily trapped in a local optimum. To overcome these shortcomings, in this paper, we propose an entropy-based position projection algorithm, called EPP, which designs a projection process to divide the dataset and explores the best local optimal solution. The experimental results on real DNA sequences, Tompa data, and ChIP-seq data show that EPP is advantageous in dealing with the motif discovery problem and outperforms current widely used algorithms.

scholarly journals Spacecraft Multiple-Impulse Trajectory Optimization Using Differential Evolution Algorithm with Combined Mutation Strategies and Boundary-Handling Schemes

2015 ◽  
Vol 2015 ◽  
pp. 1-13 ◽  
Author(s):  
Yuehe Zhu ◽  
Hua Wang ◽  
Jin Zhang
Keyword(s):  
Differential Evolution ◽  
Trajectory Optimization ◽  
Optimization Problems ◽  
Differential Evolution Algorithm ◽  
Optimal Solution ◽  
Global Optimum ◽  
Local Optimum ◽  
Local Optima ◽  
Trial Vector ◽  
Mutation Strategies

Since most spacecraft multiple-impulse trajectory optimization problems are complex multimodal problems with boundary constraint, finding the global optimal solution based on the traditional differential evolution (DE) algorithms becomes so difficult due to the deception of many local optima and the probable existence of a bias towards suboptimal solution. In order to overcome this issue and enhance the global searching ability, an improved DE algorithm with combined mutation strategies and boundary-handling schemes is proposed. In the first stage, multiple mutation strategies are utilized, and each strategy creates a mutant vector. In the second stage, multiple boundary-handling schemes are used to simultaneously address the same infeasible trial vector. Two typical spacecraft multiple-impulse trajectory optimization problems are studied and optimized using the proposed DE method. The experimental results demonstrate that the proposed DE method efficiently overcomes the problem created by the convergence to a local optimum and obtains the global optimum with a higher reliability and convergence rate compared with some other popular evolutionary methods.

Improved Method of Hybrid Genetic Algorithm

2014 ◽  
Vol 556-562 ◽  
pp. 4014-4017
Author(s):  
Lei Ding ◽  
Yong Jun Luo ◽  
Yang Yang Wang ◽  
Zheng Li ◽  
Bing Yin Yao
Keyword(s):  
Genetic Algorithm ◽  
Conjugate Gradient Method ◽  
Conjugate Gradient ◽  
Gradient Method ◽  
Hybrid Genetic Algorithm ◽  
Optimal Solution ◽  
Local Optimum ◽  
Global Optimal Solution ◽  
Global Optimal ◽  
Better Than

On account of low convergence of the traditional genetic algorithm in the late,a hybrid genetic algorithm based on conjugate gradient method and genetic algorithm is proposed.This hybrid algorithm takes advantage of Conjugate Gradient’s certainty, but also the use of genetic algorithms in order to avoid falling into local optimum, so it can quickly converge to the exact global optimal solution. Using Two test functions for testing, shows that performance of this hybrid genetic algorithm is better than single conjugate gradient method and genetic algorithm and have achieved good results.

scholarly journals SOLVING INTEGER PROGRAMMING PROBLEMS BY USING POPULATION-BASED BEETLE ANTENNAE SEARCH ALGORITHM

2021 ◽  
Vol 9 (3-4) ◽  
pp. 89-99
Author(s):  
Ivona Brajević ◽  
Miodrag Brzaković ◽  
Goran Jocić
Keyword(s):  
Integer Programming ◽  
Optimization Problems ◽  
Mechanical Design ◽  
Search Algorithm ◽  
Optimal Solution ◽  
Search Space ◽  
Population Based ◽  
Local Optimum ◽  
Integer Programming Problems ◽  
Metaheuristic Techniques

Beetle antennae search (BAS) algorithm is a newly proposed single-solution based metaheuristic technique inspired by the beetle preying process. Although BAS algorithm has shown good search abilities, it can be easily trapped into local optimum when it is used to solve hard optimization problems. With the intention to overcome this drawback, this paper presents a population-based beetle antennae search (PBAS) algorithm for solving integer programming problems.  This method employs the population's capability to search diverse regions of the search space to provide better guarantee for finding the optimal solution. The PBAS method was tested on nine integer programming problems and one mechanical design problem. The proposed algorithm was compared to other state-of-the-art metaheuristic techniques. The comparisons show that the proposed PBAS algorithm produces better results for majority of tested problems.  

Sign in / Sign up

Export Citation Format

Share Document