Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Shortest Path Algorithms: An Evaluation Using Real Road Networks
Transportation Science
Parallelizing the Dual Simplex Method
INFORMS Journal on Computing
Two fast algorithms for all-pairs shortest paths
Computers and Operations Research
A model for spatio-temporal network planning
Computers & Geosciences
A kernel density estimation method for networks, its computational method and a GIS-based tool
International Journal of Geographical Information Science
| Hi-index | 0.00 |
Conserving habitat for migratory birds presents a unique set of challenges, because multiple reserves distributed across space are required for complete protection of single species. We developed the Flight Leg Allocation Problem (FLAP), a distance-constrained shortest path problem, to identify optimal configurations of stopover habitats for migratory bird conservation. FLAP is based on a relational network topology model, where stopovers are represented as nodes and potential pathways by links. FLAP finds the optimal migratory pathway that consists of the fewest number of stops in the shortest distance, given that flocks of birds are limited by maximum daily flight capabilities and constrained by carrying capacities of individual habitats. We first present the FLAP model formulation and describe results of an empirical test for a large wetland dataset under different climatic conditions. Our results illustrate how migratory birds might respond to changes in both the temporal and spatial distribution of available stopovers. We also discuss conservation implications for using FLAP to identify priority sites for migratory birds in nature reserve networks. Additionally, the methods presented in this paper may be useful for modelling other types of spatially and temporally dynamic networks.