ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Acta biotheoretica 48 (2000), S. 207-218 
    ISSN: 1572-8358
    Keywords: Dynamical population ; fishing efforts ; metapopulation ; time scales ; aggregation method ; equilibrium ; stability
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology
    Notes: Abstract This work presents a specific stock-effort dynamical model. The stocks correspond to two populations of fish moving and growing between two fishery zones. They are harvested by two different fleets. The effort represents the number of fishing boats of the two fleets that operate in the two fishing zones. The bioeconomical model is a set of four ODE's governing the fishing efforts and the stocks in the two fishing areas. Furthermore, the migration of the fish between the two patches is assumed to be faster than the growth of the harvested stock. The displacement of the fleets is also faster than the variation in the number of fishing boats resulting from the investment of the fishing income. So, there are two time scales: a fast one corresponding to the migration between the two patches, and a slow time scale corresponding to growth. We use aggregation methods that allow us to reduce the dimension of the model and to obtain an aggregated model for the total fishing effort and fish stock of the two fishing zones. The mathematical analysis of the model is shown. Under some conditions, we obtain a stable equilibrium, which is a desired situation, as it leads to a sustainable harvesting equilibrium, keeping the stock at exploitable densities.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...