Access the full text.
Sign up today, get DeepDyve free for 14 days.
F. Jordán (2000)
A reliability-theory approach to corridor designEcological Modelling, 128
J. Hof, M. Bevers (1998)
Spatial Optimization for Managed Ecosystems
Jens Finke, M. Sonnenschein (2007)
Simulation and Optimization of Habitat Network Permeability
D. Bertsekas, J. Tsitsiklis (2002)
Introduction to Probability
Milind Sohoni (2019)
Introduction to OptimizationEngineering Optimization Theory and Practice
Madan Shrestha, A. Golan‐Goldhirsh, D. Ward (2002)
Population genetic structure and the conservation of isolated populations of Acacia raddiana in the Negev DesertBiological Conservation, 108
CPLEX
ILOG CPLEX 10.2.0 Reference Manual
J. Hof, M. Bevers (2002)
Spatial optimization in ecological applications
R. Fourer, B. Kernighan (1993)
AMPL: A Modeling Language for Mathematical Programming
T. Sargent, J. Stachurski (1960)
Finite Markov chains
Justin Williams (1998)
Delineating protected wildlife corridors with multi‐objective programmingEnvironmental Modeling & Assessment, 3
Andres Weintraub, C. Romero, YJ Springer, Marcel Asseldonk, KlYOTADA Hayashi, H. Boughanmi, J. Gómez‐Limón, R. Arnason, Daniel Lane, E. Gunn, Richard Church, Alan Murray, David Martell, P. Lohmander, David Lee (2007)
HANDBOOK OF OPERATIONS RESEARCH IN NATURAL RESOURCES
S. Onn (2021)
Integer ProgrammingOperations Research
S. Bell, D. Apostol (2007)
Designing sustainable forest landscapes
H. Salkin, K. Mathur (1989)
Foundations of integer programming
Purpose – Negative effects of habitat isolation that arise from landscape fragmentation can be mitigated, by connecting natural areas through a network of habitat corridors. To increase the permeability of a given network, i.e. to decrease the resistance to animal movements through this network, often many developments can be made. The available financial resources being limited, the most effective developments must be chosen. This optimization problem, suggested in Finke and Sonnenschein, can be treated by heuristics and simulation approaches, but the method is heavy and the obtained solutions are sub‐optimal. The aim of the paper is to show that the problem can be efficiently solved to optimality by mathematical programming. Design/methodology/approach – The moves of the individual in the network are modeled by an absorbing Markov chain and the development problem is formulated as a mixed‐integer quadratic program, then this program is linearized, and the best developments to make are determined by mixed‐integer linear programming. Findings – First, the approach allows the development problem to be solved to optimality contrary to other methods. Second, the definition of the mathematical program is relatively simple, and its implementation is immediate by using standard, commercially available, software. Third, as it is well known with mixed‐integer linear programming formulation it is possible to add new constraints easily if they are linear (or can be linearized). Research limitations/implications – With a view to propose a simple and efficient tool to solve a difficult combinatorial optimization problem arising in the improvement of permeability across habitat networks, the approach has been tested on simulated habitat networks. The research does not include the study of some precise species movements in a real network. Practical implications – The results provide a simple and efficient decision‐aid tool to try to improve the permeability of habitat networks. Originality/value – The joint use of mathematical programming techniques and Markov chain theory is used to try to lessen the negative effects of landscape fragmentation.
Management of Environmental Quality An International Journal – Emerald Publishing
Published: Aug 10, 2010
Keywords: Markov processes; Simulation; Mathematical programming; Linear programming
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.