Open AccessA Method of Finding Shortest Paths for Bumblebees
Author(s) -
Guyang Yu,
Huajun Shi
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1748/4/042045
Subject(s) - travelling salesman problem , bumblebee , simple (philosophy) , computer science , mathematical optimization , mathematics , biology , ecology , pollination , pollinator , pollen , philosophy , epistemology
In October 2010, a new British study said that bumblebees fluttering from flower to flower showed the ability to easily solve the “traveler salesman problem.” There is no good explanation for how the bumblebee solved the problem. In this paper, a simple and efficient algorithm is proposed to explain how bumblebee solves the traveling salesman problem.