Tagged articles
metaheuristic
13 articles · Page 1 of 1
This article explains the natural inspiration behind Ant Colony Optimization, its core principles, mathematical modeling, pheromone update rules, convergence behavior, and step‑by‑step workflow, illustrating how simple local interactions enable efficient solutions to combinatorial optimization challenges like the traveling salesman problem.
ant colony optimizationmetaheuristicoptimization
0 likes · 8 min read

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.
Operations ResearchVRPTWVehicle Routing
0 likes · 13 min read

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.
AI AlgorithmsExploration-ExploitationHarris Hawks Optimization
0 likes · 6 min read

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.
PSOParticle Swarm Optimizationartificial intelligence
0 likes · 12 min read

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 Optimizationgenetic algorithmmetaheuristic
0 likes · 14 min read

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.
Traveling Salesmanevolutionary computationgenetic algorithm
0 likes · 14 min read

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.
Butterfly Optimization AlgorithmPythonartificial intelligence
0 likes · 15 min read

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.
PythonSeagull Optimization Algorithmmetaheuristic
0 likes · 10 min read

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.
PythonTLBOmetaheuristic
0 likes · 10 min read

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.
Evolutionary Algorithmsglobal optimizationinertia weight
0 likes · 9 min read

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.
boltzmann distributionmetaheuristicoptimization
0 likes · 5 min read

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.
metaheuristicobjective functionoptimization algorithm
0 likes · 4 min read


ITPUBApr 24, 2017 · Artificial Intelligence
This article explains the hill‑climbing greedy search, introduces the simulated annealing meta‑heuristic with its probabilistic acceptance rule and temperature schedule, provides full pseudocode, and demonstrates how to apply it to obtain near‑optimal solutions for the NP‑complete Traveling Salesman Problem.
hill climbingmetaheuristicsimulated annealing
0 likes · 7 min read
