BestHub
Sign in
Tagged articles
8 articles
Page 1 of 1
Model Perspective
Model Perspective
Feb 28, 2023 · Artificial Intelligence

Master Simulated Annealing, Genetic Algorithm, and PSO with Python

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
Master Simulated Annealing, Genetic Algorithm, and PSO with Python
Model Perspective
Model Perspective
Nov 7, 2022 · Fundamentals

How Simulated Annealing Mimics Physical Annealing to Find Global Optima

Simulated Annealing, inspired by the physical annealing of solids, uses a Monte‑Carlo based stochastic search that gradually lowers temperature to probabilistically accept worse solutions, enabling it to escape local minima and effectively solve combinatorial optimization problems such as TSP, knapsack, and graph coloring.

Monte Carlocombinatorial optimizationoptimization
0 likes · 5 min read
How Simulated Annealing Mimics Physical Annealing to Find Global Optima
Model Perspective
Model Perspective
Oct 2, 2022 · Artificial Intelligence

Modeling Human Growth with Heuristic Algorithms: Simulated Annealing, GA, PSO

When multivariate functions are hard to solve analytically, heuristic methods such as simulated annealing, genetic algorithms, particle swarm and bee algorithms—drawn from physical and biological processes—can approximate optimal solutions and even simulate complex phenomena like a student’s multidimensional development over time.

Modelinggenetic algorithmheuristic algorithms
0 likes · 3 min read
Modeling Human Growth with Heuristic Algorithms: Simulated Annealing, GA, PSO
Model Perspective
Model Perspective
May 31, 2022 · Fundamentals

How Simulated Annealing Finds Global Optima: From Physics to Optimization

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
How Simulated Annealing Finds Global Optima: From Physics to Optimization
Model Perspective
Model Perspective
May 31, 2022 · Fundamentals

How Simulated Annealing Finds High‑Quality Solutions: A Step‑by‑Step Guide

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
How Simulated Annealing Finds High‑Quality Solutions: A Step‑by‑Step Guide
21CTO
21CTO
Aug 27, 2018 · Artificial Intelligence

Can Evolutionary Algorithms Rival Physical Models? A Deep Dive into DNA as Code

This extensive essay critiques the book "Proving Darwin" while exploring configuration spaces, genetic and simulated‑annealing algorithms, their computational complexities, and how they compare to physical models, then delves into information theory, Turing machines, and philosophical reflections on evolution, life, and the universe.

Evolutionary Computationcomplexity analysisgenetic algorithms
0 likes · 31 min read
Can Evolutionary Algorithms Rival Physical Models? A Deep Dive into DNA as Code
Tencent Cloud Developer
Tencent Cloud Developer
Jun 27, 2018 · Artificial Intelligence

Search and Optimization Algorithms in Game AI

Game AI relies on a variety of search techniques—ranging from uninformed breadth‑first and depth‑first methods to heuristic‑driven A*, minimax with alpha‑beta pruning, and Monte Carlo Tree Search—as well as optimization approaches such as hill climbing, simulated annealing, genetic and evolution strategies, multi‑objective evolutionary algorithms, and neuroevolutionary methods like NEAT to generate intelligent, balanced, and adaptable game behavior.

A* algorithmMCTSMiniMax
0 likes · 20 min read
Search and Optimization Algorithms in Game AI
ITPUB
ITPUB
Apr 24, 2017 · Artificial Intelligence

How Simulated Annealing Beats Hill Climbing for Solving the Traveling Salesman Problem

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
How Simulated Annealing Beats Hill Climbing for Solving the Traveling Salesman Problem