1 / 9

Optimal Patch Choice

Optimal Patch Choice. MacArthur, R.H. & Pianka, E.R. 1966. American Naturalist 100:603-609. Insectivorous Birds, Mixed Forest Tree Spp Differ as Food Sources Tree: Patch of Habitat Type Consumer: visit how many patch types?. Optimal Patch Choice. Strategy Set: Rank Patch Types 1, 2, …

sorena
Download Presentation

Optimal Patch Choice

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Optimal Patch Choice MacArthur, R.H. & Pianka, E.R. 1966. American Naturalist 100:603-609. Insectivorous Birds, Mixed Forest Tree Spp Differ as Food Sources Tree: Patch of Habitat Type Consumer: visit how many patch types?

  2. Optimal Patch Choice Strategy Set: Rank Patch Types 1, 2, … by Mean Hunting Time per Item in Patch Search, Capture, Consumption Decision Set: {1}, {1, 2}, {1,2 3}, etc. Identify by N, Number Patch Types

  3. Optimal Patch Choice Constraints Mean Time/Item Consumed N N = TN + HN for {1, 2, 3 …, N} TN Travel Time/Item Consumed HN Hunting time/Item Consumed

  4. Optimal Patch Choice Exploit {1, 2, …, N}; Add (N + 1)? Objective Function: Total Time per Item Consumed Minimize N

  5. Optimal Patch Choice HypothesizeN : Currency of Fitness Reduced Total Time/Item Consumed  Increased Fitness Could Advance Survival, Reproduction

  6. Optimal Patch Choice N+1 = TN+1 + HN+1 N = TN + HN  N = N+1 - N = TN + HN Better Strategy if  N < 0 Optimal N*: First N where  N > 0

  7. Optimal Patch Choice Assume Patch Types Equally Abundant TN < 0 Travel Reduced, Use More Types HN > 0 Add Lower-ranked Types Add (N + 1) if  TN  > HN Otherwise N Optimal

  8. Optimal Patch Choice

  9. Optimal Patch Choice Prediction Same Patch Quality (HN), Larger Patches  TN and TN Smaller Increased Patch Size Should Decrease Range of Patch Types Exploited

More Related