Introduction 177
glowworms glow at an intensity approximately proportional to the function
value being optimized. It is assumed that agents glowing that are brighter
attract those that glow with lower intensity. In the algorithm, each glowworm
selects, using a probabilistic mechanism, a neighbor that has a luciferin value
higher than its own and moves toward it.
A critical aspect of the GSO algorithm is that it incorporates an adaptive
neighborhood range by which the effect of distant glowworms is discounted
when a glowworm has a sufficient number of neighbors with brighter glow or
when the range to a neighboring agent goes beyond the maximum range of
perception. These movements, based only on local information and selective
neighbor interaction, enable ...