scholarly journals Business Intelligence for Paintball Tournament Matchmaking Using Particle Swarm Optimization

2018 ◽  
Vol 11 (2) ◽  
pp. 599
Author(s):  
M.T. Mishan ◽  
A.F.A. Fadzil ◽  
K.A.F.A. Samah ◽  
N.F. Baharin ◽  
N. Anuar
Keyword(s):  
Particle Swarm Optimization ◽  
Swarm Intelligence ◽  
Business Intelligence ◽  
Management System ◽  
Particle Swarm ◽  
Speed Of Convergence ◽  
Swarm Optimization ◽  
Intelligence Algorithm ◽  
Swarm Intelligence Algorithm

Paintball has gained a huge popularity in Malaysia with growing number of tournaments organized nationwide. Currently, Ideal Pro Event, one of the paintball organizer found difficulties to pair a suitable opponent to against one another in a tournament. This is largely due to the manual matchmaking method that only randomly matches one team with another. Consequently, it is crucial to ensure a balanced tournament bracket where eventual winners and losers not facing one another in the very first round. This study proposes an intelligent matchmaking using Particle Swarm Optimization (PSO) and tournament management system for paintball organizers. PSO is a swarm intelligence algorithm that optimizes problems by gradually improving its current solutions, therefore countenancing the tournament bracket to be continually improved until the best is produced. Indirectly, through the development of the system, it is consider as an intelligence business idea since it able to save time and enhance the company productivity. This algorithm has been tested using 3 size of population; 100, 1000 and 10,000. As a result, the speed of convergence is consistent and has not been affected through big population.

scholarly journals Refined Heuristic Swarm Intelligence Algorithm

2020 ◽  
pp. 267-275
Author(s):  
I. I. Aina ◽  
C. N. Ejieji
Keyword(s):  
Particle Swarm Optimization ◽  
Swarm Intelligence ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Metaheuristic Algorithm ◽  
Swarm Optimization ◽  
Inertia Weight ◽  
Intelligence Algorithm ◽  
Swarm Intelligence Algorithm

In this paper, a new metaheuristic algorithm named refined heuristic intelligence swarm (RHIS) algorithm is developed from an existing particle swarm optimization (PSO) algorithm by introducing a disturbing term to the velocity of PSO and modifying the inertia weight, in which the comparison between the two algorithms is also addressed.

scholarly journals REAL POWER LOSS REDUCTION & VOLTAGE STABILITY AMPLIFICATION BY HYBRIDIZATION OF RESTARTED SIMULATED ANNEALING WITH PARTICLE SWARM OPTIMIZATION ALGORITHM

2018 ◽  
Vol 6 (9) ◽  
pp. 246-258
Author(s):  
K. Lenin
Keyword(s):  
Particle Swarm Optimization ◽  
Simulated Annealing ◽  
Swarm Intelligence ◽  
Optimization Algorithm ◽  
Voltage Stability ◽  
Reactive Power ◽  
Particle Swarm ◽  
Swarm Optimization ◽  
Intelligence Algorithm ◽  
Swarm Intelligence Algorithm

This paper presents an algorithm for solving the multi-objective reactive power dispatch problem in a power system. Modal analysis of the system is used for static voltage stability assessment. Loss minimization and maximization of voltage stability margin are taken as the objectives. Generator terminal voltages, reactive power generation of the capacitor banks and tap changing transformer setting are taken as the optimization variables. Evolutionary algorithm and Swarm Intelligence algorithm (EA, SI), a part of Bio inspired optimization algorithm, have been widely used to solve numerous optimization problem in various science and engineering domains. Particle swarm optimization (PSO) is a population-based swarm intelligence algorithm that shares many similarities with evolutionary computation techniques. However, the PSO is driven by the simulation of a social psychological metaphor motivated by collective behaviors of bird and other social organisms instead of the survival of the fittest individual. The Simulated Annealing (SA) algorithm is a probabilistic hill-climbing technique that is based on the annealing/cooling process of metals. In total, most moves may be accepted at initial stages, but at the final stage only improving ones are likely to be allowed. This can help the procedure jump out of a local minimum. However, sometimes it is better to move back to a former solution that was significantly better rather than always moving from the current state. This process is called “restarting” of SA & called as Restarted Simulated Annealing (RSA). In this paper we proposed a hybridized restarted simulated annealing particle swarm optimization (RSAPSO) technique to find global minima more efficiently and robustly. The proposed RSAPSO combines the global search ability of PSO and the local search ability of RSA, and offsets the weaknesses of each other. In order to evaluate the proposed algorithm, it has been tested on IEEE 30 bus system and compared to other reported algorithms.

Pigeon-inspired optimization and lateral inhibition for image matching of autonomous aerial refueling

2017 ◽  
Vol 232 (8) ◽  
pp. 1571-1583 ◽  
Author(s):  
Yongbin Sun ◽  
Haibin Duan
Keyword(s):  
Particle Swarm Optimization ◽  
Lateral Inhibition ◽  
Image Matching ◽  
Hybrid Algorithm ◽  
Particle Swarm ◽  
Matching Problem ◽  
Aerial Refueling ◽  
Swarm Optimization ◽  
Swarm Intelligence Algorithm ◽  
Computation Speed

Autonomous aerial refueling (AAR) is an essential application of unmanned aerial vehicles for both military and civilian domains. In this paper, a hybrid algorithm of the pigeon-inspired optimization (PIO) and lateral inhibition (LI), called LI-PIO, is proposed for image matching problem of AAR. LI is adopted for image pre-processing to enhance the edges and contrast of images. PIO, inspired from the homing characteristics of pigeons, is a novel bio-inspired swarm intelligence algorithm. To demonstrate the effectiveness and feasibility of our proposed algorithm, we make extensive comparative experiments with particle swarm optimization (PSO), particle swarm optimization based on lateral inhibition (LI-PSO), and PIO. It can be concluded from the experimental results that our proposed LI-PIO has excellent performances for image matching problem of AAR, especially in convergent rate and computation speed.

Local Best Particle Swarm Optimization Using Crown Jewel Defense Strategy

2018 ◽  
pp. 27-52 ◽  
Author(s):  
Jiarui Zhou ◽  
Junshan Yang ◽  
Ling Lin ◽  
Zexuan Zhu ◽  
Zhen Ji
Keyword(s):  
Particle Swarm Optimization ◽  
High Efficiency ◽  
Particle Swarm ◽  
Global Optimum ◽  
Population Diversity ◽  
Local Optimum ◽  
Swarm Optimization ◽  
Local Optima ◽  
Von Neumann ◽  
Swarm Intelligence Algorithm

Particle swarm optimization (PSO) is a swarm intelligence algorithm well known for its simplicity and high efficiency on various problems. Conventional PSO suffers from premature convergence due to the rapid convergence speed and lack of population diversity. It is easy to get trapped in local optima. For this reason, improvements are made to detect stagnation during the optimization and reactivate the swarm to search towards the global optimum. This chapter imposes the reflecting bound-handling scheme and von Neumann topology on PSO to increase the population diversity. A novel crown jewel defense (CJD) strategy is introduced to restart the swarm when it is trapped in a local optimum region. The resultant algorithm named LCJDPSO-rfl is tested on a group of unimodal and multimodal benchmark functions with rotation and shifting. Experimental results suggest that the LCJDPSO-rfl outperforms state-of-the-art PSO variants on most of the functions.

Population Diversity of Particle Swarm Optimization Algorithm on Solving Single and Multi-Objective Problems

2020 ◽  
pp. 312-344
Author(s):  
Shi Cheng ◽  
Yuhui Shi ◽  
Quande Qin
Keyword(s):  
Particle Swarm Optimization ◽  
Swarm Intelligence ◽  
Optimization Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Population Diversity ◽  
Exploration And Exploitation ◽  
Swarm Optimization ◽  
Diversity Measures ◽  
Computational Resources ◽  
Swarm Intelligence Algorithm

Premature convergence occurs in swarm intelligence algorithms searching for optima. A swarm intelligence algorithm has two kinds of abilities: the exploration of new possibilities and the exploitation of old certainties. The exploration ability means that an algorithm can explore more search places to increase the possibility that the algorithm can find good enough solutions. In contrast, the exploitation ability means that an algorithm focuses on the refinement of found promising areas. An algorithm should have a balance between exploration and exploitation, that is, the allocation of computational resources should be optimized to ensure that an algorithm can find good enough solutions effectively. The diversity measures the distribution of individuals' information. From the observation of the distribution and diversity change, the degree of exploration and exploitation can be obtained.

From Optimization to Clustering

2015 ◽  
pp. 594-619 ◽  
Author(s):  
Megha Vora ◽  
T. T. Mirnalinee
Keyword(s):  
Particle Swarm Optimization ◽  
Swarm Intelligence ◽  
Optimization Algorithm ◽  
Efficient Solution ◽  
Optimization Problems ◽  
Particle Swarm ◽  
Optimization Techniques ◽  
Ant Colony Optimization Algorithm ◽  
Swarm Optimization ◽  
Insight Into

In the past two decades, Swarm Intelligence (SI)-based optimization techniques have drawn the attention of many researchers for finding an efficient solution to optimization problems. Swarm intelligence techniques are characterized by their decentralized way of working that mimics the behavior of colony of ants, swarm of bees, flock of birds, or school of fishes. Algorithmic simplicity and effectiveness of swarm intelligence techniques have made it a powerful tool for solving global optimization problems. Simulation studies of the graceful, but unpredictable, choreography of bird flocks led to the design of the particle swarm optimization algorithm. Studies of the foraging behavior of ants resulted in the development of ant colony optimization algorithm. This chapter provides insight into swarm intelligence techniques, specifically particle swarm optimization and its variants. The objective of this chapter is twofold: First, it describes how swarm intelligence techniques are employed to solve various optimization problems. Second, it describes how swarm intelligence techniques are efficiently applied for clustering, by imposing clustering as an optimization problem.

From Optimization to Clustering

2016 ◽  
pp. 1519-1544 ◽  
Author(s):  
Megha Vora ◽  
T. T. Mirnalinee
Keyword(s):  
Particle Swarm Optimization ◽  
Swarm Intelligence ◽  
Optimization Algorithm ◽  
Efficient Solution ◽  
Optimization Problems ◽  
Particle Swarm ◽  
Optimization Techniques ◽  
Ant Colony Optimization Algorithm ◽  
Swarm Optimization ◽  
Insight Into

In the past two decades, Swarm Intelligence (SI)-based optimization techniques have drawn the attention of many researchers for finding an efficient solution to optimization problems. Swarm intelligence techniques are characterized by their decentralized way of working that mimics the behavior of colony of ants, swarm of bees, flock of birds, or school of fishes. Algorithmic simplicity and effectiveness of swarm intelligence techniques have made it a powerful tool for solving global optimization problems. Simulation studies of the graceful, but unpredictable, choreography of bird flocks led to the design of the particle swarm optimization algorithm. Studies of the foraging behavior of ants resulted in the development of ant colony optimization algorithm. This chapter provides insight into swarm intelligence techniques, specifically particle swarm optimization and its variants. The objective of this chapter is twofold: First, it describes how swarm intelligence techniques are employed to solve various optimization problems. Second, it describes how swarm intelligence techniques are efficiently applied for clustering, by imposing clustering as an optimization problem.

Sign in / Sign up

Export Citation Format

Share Document