1 views collected around this technical thread.
This article explains how a luxury‑goods pickup service transformed manual order assignment for four engineers and 24 orders into an automated, cost‑effective dispatch system using VRPTW modeling, algorithm selection, and a genetic algorithm that balances travel time and order distribution.
The Harris Hawks Optimization (HHO) algorithm, inspired by the coordinated hunting tactics of Harris hawks, models exploration and exploitation phases to tackle complex optimization challenges, illustrated through a traffic signal timing case study that demonstrates its effectiveness and limitations.
This article provides a comprehensive overview of Particle Swarm Optimization, covering its biological inspiration, abstract modeling of bird foraging behavior, key concepts, algorithmic workflow, velocity update formulas, practical tips, and references for further study.
Explore three powerful optimization techniques—Simulated Annealing, Genetic Algorithm, and Particle Swarm Optimization—through clear explanations, step-by-step procedures, and complete Python implementations that demonstrate how to find global minima of complex functions in practice and compare their performance.
Particle Swarm Optimization (PSO), inspired by bird flocking behavior, is a simple yet powerful evolutionary computation technique that updates particle positions and velocities using personal and global bests, offering fast convergence, parallelism, and wide applications across function optimization, neural networks, pattern recognition, and robotics.
This article introduces genetic algorithms, explains their biological inspiration, outlines key concepts and operators, details the step-by-step optimization process, and demonstrates their application to a traveling‑salesman case with Python code, highlighting encoding, selection, crossover, mutation, and fitness evaluation.
This article explains the Butterfly Optimization Algorithm (BOA), covering its biological inspiration, core concepts such as scent-based global and local search, key parameters, iteration process, and provides a complete Python implementation with example usage and visualisation of convergence.
The article explains the Artificial Bee Colony (ABC) algorithm, its biological inspiration, core components, and detailed steps—including employed, onlooker, and scout bee phases—followed by a complete Python implementation applied to a pressure‑vessel design optimization problem.
This article introduces the Seagull Optimization Algorithm (SOA), explains how it mimics seagull migration and attack behaviors to solve optimization problems, details its migration and prey‑attack phases, outlines the step‑by‑step workflow, and provides a full Python implementation with code examples.
This article explains the teaching-learning based optimization (TLBO) algorithm, its teaching and learning phases, provides a complete Python implementation, and demonstrates its performance on minimizing a simple quadratic function with visualized convergence.
Particle Swarm Optimization (PSO), inspired by bird flocking behavior, is a simple yet powerful population‑based metaheuristic that updates particle velocities and positions using individual and global bests, offering fast convergence, robustness, and wide applications across function optimization, neural networks, classification, and robotics.
This article outlines the step‑by‑step procedure of the Simulated Annealing algorithm, covering initialization, new‑solution generation, incremental objective‑difference calculation, Metropolis acceptance, solution replacement, temperature updating, and includes a concise pseudocode illustration to help practitioners implement the method effectively.
Simulated Annealing, inspired by the physical annealing process and formalized by Metropolis and later Kirkpatrick, is a Monte‑Carlo based stochastic optimization method that probabilistically accepts worse solutions to escape local minima, with applications ranging from TSP and knapsack problems to graph coloring and scheduling.