New Post

Avascular Necrosis (AVN) || Early Detection, Better Outcomes || ~xRay Pixy

Image
Avascular Necrosis (AVN) is a condition where blood flow to the bone is reduced, causing bone cells to die. This leads to pain, joint damage, and difficulty in movement, especially in the hip. Early diagnosis and proper treatment can prevent permanent bone damage and improve quality of life. Video Chapter: AVN 00:00 Introduction 00:45 What is AVN? 01:55 About Bone Tissue 02:49 AVN Causes 03:38 AVN Symptoms 04:11 AVN Diagnosis 04:56 AVN of femoral head 05:33 How AVN Develops 07:28 Conclusions #optimization #algorithm #metaheuristic #robotics #deeplearning #ArtificialIntelligence #MachineLearning #computervision #research #projects #thesis #Python #optimizationproblem #optimizationalgorithms 

Firefly Optimization Algorithm

Firefly algorithm is a swarm-based metaheuristic algorithm that was introduced by Yang. Firefly Algorithm is inspired by the FLASHING Behavior of Fireflies. 

Assumptions

  • Fireflies are attracted to each other.
  • Attractiveness is proportional to BRIGHTNESS. 
  • Less Brighter Firefly is attracted to the Brighter Firefly.
  • Attractiveness decrease as the distance between 2 fireflies increase.
  • If brightness for both is the same, fireflies move randomly.
  • New Solutions are generated by Random walks & the Attraction of fireflies.

Firefly Optimization Algorithm Steps
  1. Initialize Parameters.
  2. Generate Population of n Fireflies.
  3. Calculate Fitness Value for Each Firefly.
  4. Check stopping criteria if (CurrentIteration := 1 to MaximumIteration ).
  5.  Update Position and Light Intensity for Each Firefly.
  6. Report the Best Solution.
Initialize Parameters, Population of Fire Fly Swarm.
Population Size (n) = 20;
Maximum Iteration (Maxt) = 50;
Dimension (d) = 10;
Upper Bound [UB] = 100;
Lower Bound [LB] = -100;

Calculate Fitness Value [Light Intensity] for Each FireFly.
The light intensity of Firefly (i.e., 𝐼_𝑖) at 𝑥_𝑖 is computed by the Value of the Objective Function.

Firefly Position Updated as:
For i = 1 to n -1;
For j = i + 1 to n;
  IF ( 𝑰_𝒋 > 𝑰_𝒊 )
      Update Position. [move Firefly i towards Firefly j ];
    End IF
  End For
 End For

Comments

Popular Post

PARTICLE SWARM OPTIMIZATION ALGORITHM NUMERICAL EXAMPLE

Cuckoo Search Algorithm for Optimization Problems

PSO (Particle Swarm Optimization) Example Step-by-Step

Particle Swarm Optimization (PSO)

PSO Python Code || Particle Swarm Optimization in Python || ~xRay Pixy

how is the LBP |Local Binary Pattern| values calculated? Step-by-Step with Example

Whale Optimization Algorithm Code Implementation || WOA CODE || ~xRay Pixy

Grey Wolf Optimization Algorithm

Grey Wolf Optimization Algorithm Numerical Example

GWO Python Code || Grey Wolf Optimizer in Python || ~xRay Pixy