Definition
In computer science and operations research, the ant colony optimization 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. The pheromone-based communication of biological ants is often the predominant paradigm used. Combinations of artificial ants and local search algorithms have become a preferred method for numerous optimization tasks involving some sort of graph, e.g., vehicle routing and internet routing.
Related concepts
4-connected neighborhood8-connectedActive-set methodActive matterAffine scalingAgent-based modelAgent-based model in biologyAlgorithmAlgorithms to estimate distributionAllee effectAltitudinal migrationAmbient networksAnimal migrationAnimal migration trackingAnimal navigationAntAnt colonyAnt colony optimization algorithmAnt millAnt roboticsAntsApproximation algorithmArtificial immune systemAugmented Lagrangian methodBIO-LGCABait ballBankruptcy predictionBarrier functionBees algorithmBellman–Ford algorithmBerndt–Hall–Hall–Hausman algorithmBird migrationBoidsBorůvka's algorithmBranch and boundBranch and cutBroyden–Fletcher–Goldfarb–Shanno algorithmCell migrationClassificationClustering of self-propelled particlesCoded wire tagCollective animal behaviorCollective behaviorCollective intelligenceCollective motionCombinatorial optimizationComparison of optimization softwareComputer scienceConstraint satisfactionConvex minimizationConvex optimizationCriss-cross algorithmCross-entropy methodCrowd simulationCutting-plane methodData miningDavidon–Fletcher–Powell formulaDecentralised systemDiel vertical migrationDijkstra's algorithmDinic's algorithmDistributed computingDrovingDynamic programmingEdge detectionEdmonds–Karp algorithmElectronic circuit designEllipsoid methodEstimation of distribution algorithmEusocialityEvolutionary algorithmExchange algorithmFeeding frenzyFish migrationFlock (birds)Flocking (behavior)Flow networkFloyd–Warshall algorithmFord–Fulkerson algorithmFrank–Wolfe algorithmFrequency assignment problemFunction (mathematics)Gauss–Newton algorithmGeneralized assignment problemGenetic algorithmGolden-section searchGradientGradient descentGraph (discrete mathematics)Graph algorithmGreedy algorithmGroup size measuresHerdHerd behaviorHessian matrixHeuristic algorithmHill climbingHistory of wildlife tracking technologyHoming (biology)Honey beeHumanoid ant algorithmISTE LtdInformation retrievalInsect migrationInteger programmingIntelligent Water DropsIterationIterative methodJean-Baptiste WaldnerJob-shop schedulingJohn Wiley & SonsKarmarkar's algorithmKnapsack problemKruskal's algorithmLecture Notes in Computer ScienceLemke's algorithmLepidoptera migrationLessepsian migrationLevenberg–Marquardt algorithmLimit of a sequenceLimited-memory BFGSLine searchLinear programmingLocal convergenceLocal search (optimization)LocustLuca Maria GambardellaM. Grazia SperanzaMATLABMarco DorigoMathematical optimizationMatroidMetaheuristicMetaheuristicsMicrobial intelligenceMicroboticsMinimum spanning treeMirror descentMixed-species foraging flockMobbing (animal behavior)Monarch butterfly migrationMulti-agentMutualism (biology)NanoroboticsNatal homingNelder–Mead methodNetwork routingNewton's method in optimizationNonlinear conjugate gradient methodNonlinear programmingOpen-pit minesOpen-shop schedulingOperations researchOptimization (computer science)Optimization algorithmOtsu's methodPack (canine)Pack hunterParallel computingParallel metaheuristicParameter spaceParticle swarm optimizationPartition problemPatterns of self-organization in antsPenalty methodPeoplePheromonePhilopatryPierre-Paul GrasséPixelPositive feedbackPowell's dog leg methodPowell's methodPredator satiationPrim's algorithmProbabilisticProbabilityProbability distributionProteinProtein foldingProtein protein interactionPush–relabel maximum flow algorithmQuadratic assignment problemQuadratic programmingQuasi-Newton methodQuorum sensingRainer SchulinRandomRedundancy allocation problemReverse migration (birds)Revised simplex methodRoutingS. P. M. van HoeselSalmon runSardine runScheduling algorithmSea turtle migrationSelf-propelled particlesSequential ordering problemSequential quadratic programmingSet cover problemShoaling and schoolingShortest Path Faster AlgorithmShortest path problemSimplex algorithmSimulated annealingSocial insectsSort solSpatial organizationSpiral optimization algorithmStigmergyStochasticStochastic diffusion searchStochastic gradient descentSubgradient methodSuccessive linear programmingSuccessive parabolic interpolationSwarm (simulation)Swarm behaviourSwarm intelligenceSwarm roboticsSwarming (honey bee)Swarming (military)Swarming motilitySymbrionSymmetric rank-oneSymmetry breaking of escaping antsTabu searchTask allocation and partitioning of social insectsTelecommunicationTelecommunicationsTermitesToshihide IbarakiTransmission Control ProtocolTravelling salesman problemTruncated Newton methodTrust regionVehicle routing problemVicsek modelWolfe conditions
18 concepts already in your glossary