Travel optimization by foraging bumblebees through readjustments of traplines after discovery of new feeding locations. / Lihoreau, Mathieu; Chittka, Lars; Raine, N. E.

In: American Naturalist, Vol. 176, No. 6, 12.2010, p. 744-757.

Research output: Contribution to journalArticle

Published

Documents

Links

Abstract

Animals collecting resources that replenish over time often visit patches in predictable sequences called traplines. Despite the widespread nature of this strategy, we still know little about how spatial memory develops and guides individuals toward suitable routes. Here, we investigate whether flower visitation sequences by bumblebees Bombus terrestris simply reflect the order in which flowers were discovered or whether they result from more complex navigational
strategies enabling bees to optimize their foraging routes. We analyzed bee flight movements in an array of four artificial flowers maximizing interfloral distances. Starting from a single patch, we sequentially added three new patches so that if bees visited them in the order in which they originally encountered flowers, they would follow a long (suboptimal) route. Bees’ tendency to visit patches in their discovery order decreased with experience. Instead, they optimized their flight distances by rearranging flower visitation sequences.
This resulted in the development of a primary route (trapline) and two or three less frequently used secondary routes. Bees consistently used these routes after overnight breaks while occasionally exploring novel possibilities. We discuss how maintaining some level of route flexibility could allow traplining animals to cope with dynamic routing problems, analogous to the well-known traveling
salesman problem.
Original languageEnglish
Pages (from-to)744-757
Number of pages14
JournalAmerican Naturalist
Volume176
Issue number6
Early online date25 Oct 2010
DOIs
StatePublished - Dec 2010
This open access research output is licenced under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.

ID: 1198003