# Ant colony optimization algorithms ## MicroSim spec - **Recommended sim type:** agent-based - **Microsimmability score:** 86/100 - **Layout:** drawing region (canvas) on top; control region (sliders/buttons) below. ### Parameters (tunable controls) - `Number of ants` - `Pheromone evaporation` - `Pheromone weight` ### What animates Ants lay and follow pheromone until a shortest path emerges as evaporation and weighting change. ### Learning objective Show how pheromone trails let a colony find short paths. ## Links (Wikipedia order) <!-- injected from _registry/childlinks/Ant_colony_optimization_algorithms.json (2026-07-30T02:09:12Z) --> `Active-set_method` · `Active_matter` · `Affine_scaling` · [[Agent-based_model]] · `Agent-based_model_in_biology` · [[Algorithm]] · `Allee_effect` · `Altitudinal_migration` · `Animal_migration` · `Animal_migration_tracking` · `Animal_navigation` · `Ant` · `Ant_colony` · `Ant_mill` · `Ant_robotics` · `Approximation_algorithm` · `Artificial_immune_system` · `Augmented_Lagrangian_method` · `BIO-LGCA` · `Bait_ball` · `Bankruptcy_prediction` · `Barrier_function` · `Bees_algorithm` · `Bellman–Ford_algorithm` · `Berndt–Hall–Hall–Hausman_algorithm` · `Bird_migration` · `Boids` · `Borůvka's_algorithm` · `Branch_and_bound` · `Branch_and_cut` · `Broyden–Fletcher–Goldfarb–Shanno_algorithm` · `Cell_migration` · `Classification` · `Clustering_of_self-propelled_particles` · `Coded_wire_tag` · `Collective_animal_behavior` · [[Collective_behavior]] · [[Collective_intelligence]] · `Collective_motion` · [[Combinatorial_optimization]] · [[Comparison_of_optimization_software]] · [[Computer_science]] · `Constraint_satisfaction` · `Convex_optimization` · `Criss-cross_algorithm` · `Cross-entropy_method` · `Crowd_simulation` · `Cutting-plane_method` · `Data_mining` · `Davidon–Fletcher–Powell_formula` · `Decentralised_system` · `Diel_vertical_migration` · `Dijkstra's_algorithm` · `Dinic's_algorithm` · `Distributed_computing` · `Droving` · [[Dynamic_programming]] · `Edge_detection` · `Edmonds–Karp_algorithm` · `Electronic_circuit_design` · `Ellipsoid_method` · `Estimation_of_distribution_algorithm` · `Eusociality` · `Evolutionary_algorithm` · `Feeding_frenzy` · `Fish_migration` · `Flock_(birds)` · `Flow_network` · `Floyd–Warshall_algorithm` · `Ford–Fulkerson_algorithm` · `Frank–Wolfe_algorithm` · `Function_(mathematics)` · `Gauss–Newton_algorithm` · `Generalized_assignment_problem` · [[Genetic_algorithm]] · `Golden-section_search` · `Gradient` · `Gradient_descent` · `Graph_(discrete_mathematics)` · `Greedy_algorithm` · `Group_size_measures` · `Herd` · `Herd_behavior` · `Hessian_matrix` · `Hill_climbing` · `History_of_wildlife_tracking_technology` · `Homing_(biology)` · `Honey_bee` · `Humanoid_ant_algorithm` · `Information_retrieval` · `Insect_migration` · `Integer_programming` · `Iteration` · `Iterative_method` · `Jean-Baptiste_Waldner` · `Job-shop_scheduling` · `Karmarkar's_algorithm` · `Knapsack_problem` · `Kruskal's_algorithm` · `Lecture_Notes_in_Computer_Science` · `Lemke's_algorithm` · `Lepidoptera_migration` · `Lessepsian_migration` · `Levenberg–Marquardt_algorithm` · `Limit_of_a_sequence` · `Limited-memory_BFGS` · `Line_search` · `Linear_programming` · `Local_convergence` · `Local_search_(optimization)` · `Locust` · `Luca_Maria_Gambardella` · `M._Grazia_Speranza` · `MATLAB` · `Marco_Dorigo` · [[Mathematical_optimization]] · `Matroid` · `Metaheuristic` · `Microbial_intelligence` · `Microbotics` · `Minimum_spanning_tree` · `Mirror_descent` · `Mixed-species_foraging_flock` · `Mobbing_(animal_behavior)` · `Monarch_butterfly_migration` · `Mutualism_(biology)` · `Nanorobotics` · `Natal_homing` · `Nelder–Mead_method` · `Newton's_method_in_optimization` · `Nonlinear_conjugate_gradient_method` · `Nonlinear_programming` · `Open-shop_scheduling` · [[Operations_research]] · `Otsu's_method` · `Pack_(canine)` · `Pack_hunter` · `Parallel_computing` · `Parallel_metaheuristic` · `Parameter_space` · [[Particle_swarm_optimization]] · `Partition_problem` · `Patterns_of_self-organization_in_ants` · `Penalty_method` · `People` · `Pheromone` · `Philopatry` · `Pierre-Paul_Grassé` · `Pixel` · [[Positive_feedback]] · `Powell's_dog_leg_method` · `Powell's_method` · `Predator_satiation` · `Prim's_algorithm` · [[Probability]] · `Probability_distribution` · `Protein` · `Protein_folding` · `Push–relabel_maximum_flow_algorithm` · `Quadratic_assignment_problem` · `Quadratic_programming` · `Quasi-Newton_method` · [[Quorum_sensing]] · `Rainer_Schulin` · `Reverse_migration_(birds)` · `Revised_simplex_method` · `Routing` · `Salmon_run` · `Sardine_run` · `Sea_turtle_migration` · `Self-propelled_particles` · `Sequential_quadratic_programming` · `Set_cover_problem` · `Shoaling_and_schooling` · `Shortest_path_problem` · `Simplex_algorithm` · `Simulated_annealing` · `Sort_sol` · `Spatial_organization` · `Spiral_optimization_algorithm` · `Stigmergy` · `Stochastic` · `Stochastic_diffusion_search` · `Stochastic_gradient_descent` · `Subgradient_method` · `Successive_linear_programming` · `Successive_parabolic_interpolation` · `Swarm_(simulation)` · [[Swarm_behaviour]] · `Swarm_intelligence` · `Swarm_robotics` · `Swarming_(honey_bee)` · `Swarming_(military)` · `Swarming_motility` · `Symbrion` · `Symmetric_rank-one` · `Symmetry_breaking_of_escaping_ants` · `Tabu_search` · [[Telecommunications]] · `Toshihide_Ibaraki` · `Transmission_Control_Protocol` · `Travelling_salesman_problem` · `Truncated_Newton_method` · `Trust_region` · `Vehicle_routing_problem` · `Vicsek_model` · [[Wayback_Machine]] · `Wolfe_conditions` > p5.js MicroSim stub · part of Systems Thinking · [Wikipedia source](https://en.wikipedia.org/wiki/Ant_colony_optimization_algorithms) > Relation: subfield of systems thinking. ## Concept summary In [[Computer_science|computer science]] and [[Operations_research|operations research]], the ant colony optimization [[Algorithm|algorithm]] (ACO) is a probabilistic technique for solving computational problems that can be reduced to finding good paths through graphs. Artificial ants represent multi-agent methods inspired by the behavior of real ants. ## Build checklist - [ ] Claim it: set `status: in-progress` + `lease` + `leased_at` - [ ] Write the child page explaining the concept (tie it back to systems thinking) - [ ] Finalize parameter ranges and defaults - [ ] Implement the p5.js sketch (drawing + control regions) - [ ] Add caption + the learning objective on the page - [ ] Set `status: done` ## p5.js sketch ```javascript // MicroSim: Ant colony optimization algorithms let controls = {}; function setup() { // createCanvas(...); create sliders for the parameters above. } function draw() { // background(...); read controls; render agent-based; respond live. } ``` --- Back to Systems Thinking · Wikipedia: [Ant colony optimization algorithms](https://en.wikipedia.org/wiki/Ant_colony_optimization_algorithms) --- <!-- SEMIOTIC-PROFILE:START --> ## Semiotic profile > *The semiotic universals this article invokes, machine-derived from the crossref — **unverified** (born so). Populated 2026-07-06 for the Systems room.* **Universals (4):** 🟢 optimization (16) · 🟡 system (10) · 🟡 science (7) · 🟢 network (3) **Enter by sign:** Systems Semiotic Gateway · Alphabetum · Icon Registry · ← Systems Portal <!-- SEMIOTIC-PROFILE:END --> ## Wikipedia : Wikitube **Strict pair:** [Wikipedia](https://en.wikipedia.org/wiki/Ant_colony_optimization_algorithms) : [Wikitube](https://en.wikitube.io/wiki/Ant_colony_optimization_algorithms) ## Previous hub tags Tree parents: [[Agent-based_model]] · [[Complex_system]] · [[Cybernetics]] · [[Emergence]] · [[Feedback]] · [[Self-organization]] · [[Systems_science]] · [[Systems_theory]]. Legacy hubs: none. --- *Sources: 2 legacy notes. Minted wave 1, 2026-07-30 (v1.6 order).*