Advertisement

< Back to Article

Radar Tracking and Motion-Sensitive Cameras on Flowers Reveal the Development of Pollinator Multi-Destination Routes over Large Spatial Scales

Figure 5

rinciple of the iterative improvement heuristic for flight path optimization.

At each stage, a model bee chooses to move between flowers according to six assumptions: (1) the bee can uniquely identify each flower; (2) the bee has a finite probability of using transition vectors joining each pair of flowers; (3) the initial probability of using a vector depends on the distance between the two flowers (in our simulations nearest neighbour flowers are visited with a probability = 0.6 and more distant locations are visited with a probability = 0.1); (4) the bee computes the net length of the route travelled by summing the distances of all vectors comprising the flower visit sequence; (5) having completed a route passing through all the flowers at least once, the bee compares the net length of the current route to the net length of the shortest route experienced so far; (6) if the new route is shorter, the probabilities of using the vectors forming this new route in the next foraging bout are increased by a common factor (in our simulation, a factor of 2). The figure illustrates a late stage of trapline development between five flowers arranged in a regular pentagon (where three different paths starting and finishing at the nest-box have been selected over time (N12354N, N13245N, N12345N)). Strengthening the vectors forming the shortest route (N12345N) makes this route more “attractive” (the thickness of the arrow is proportional to the probability of the vector being used). As the bee is more likely to take the shortest route, longer routes will be gradually abandoned (see simulations in Figure S3).

Figure 5

doi: https://doi.org/10.1371/journal.pbio.1001392.g005