The Traveling Salesman Problem (TSP) is a good known routing problem. The TSP asks: "Given a listing of destinations, what is the shortest possible road that visits each finish precisely 1 time as well as returns to the master copy starting point?"
The Brooding Goose Problem (BGP) is a piddling known routing problem. The BGP asks: "Given a listing of places to avoid what is the shortest possible road from H5N1 to B which doesn't see whatever of the places to avoid."
In its simplest assort the BGP tin survive expressed as:
- How create y'all teach from H5N1 to B, spell avoiding C.
- Where C = geese.
An event of the Brooding Goose Problem would survive a academy alongside a publish of aggressive nesting geese dotted simply about the campus. In jump these brooding geese oft teach aggressively protective of their nests as well as tin survive known to ready on students as well as staff who wander every moment good close a nest. The academy thus needs an interactive routing map which tin assist students navigate simply about campus spell avoiding the said brooding geese.
Back inwards 2013 the University of Waterloo devised an interactive map that included a solution to the Brooding Goose Problem. Their map allowed students to uncovering the quickest road betwixt 2 locations on campus spell avoiding the known locations of all nesting geese.
The University of Waterloo's GooseWatch is straightaway dorsum for the 6th consecutive year. This year's map shows the locations of all known nesting geese. It also allows y'all to sentiment the locations where geese induce got been known to nest inwards previous years. At the middle of the interactive map is the BGP routing engine which helps y'all avoid the brooding geese. The search engine fifty-fifty allows y'all to define how scared of geese y'all are - which it as well as so takes into consideration when suggesting a requested road simply about campus.
