1997
DOI: 10.1139/cjfr-27-1-11
|View full text |Cite
|
Sign up to set email alerts
|

Finding optimal routes for networks of harvest site access roads using GIS-based techniques

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
43
0

Year Published

2002
2002
2017
2017

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 23 publications
(43 citation statements)
references
References 0 publications
0
43
0
Order By: Relevance
“…On the other hand, a good model for road planning and choosing between alternative routes should incorporate the knowledge of the road engineer and be simple and easy to understand and use. Dean (1997), Huang et al (2003 and Murthy (2003) used the Least Cost Path model for route selection. Although the path tool minimized the cost, it could not restrict passing through infeasible gradients.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…On the other hand, a good model for road planning and choosing between alternative routes should incorporate the knowledge of the road engineer and be simple and easy to understand and use. Dean (1997), Huang et al (2003 and Murthy (2003) used the Least Cost Path model for route selection. Although the path tool minimized the cost, it could not restrict passing through infeasible gradients.…”
Section: Resultsmentioning
confidence: 99%
“…The viability and profitability of operational forest management plans is very much influenced by road costs as well as road network structure (Kirby et al 1986). Given the importance of these costs, finding cost effective paths for new road networks is highly desirable (Dean 1997). Road networks are often developed by engineers using contour and thematic maps (Liu, Sessions 1993;Rogers 2005;Picard et al 2006).…”
mentioning
confidence: 99%
“…A cost surface map created (cost) values assigned as resistance in order to determine the environmentally sound of the forest road route in each pixel (Figure 4). Forest road route with the lowest total construction costs is not always the best solution from an environmental point of view (Liu and Sessions 1993;Dean 1997;Chung and Sessions 2001;Aruga 2005;Akay 2006;Hayati et al 2013).…”
Section: Rezultati I Raspravamentioning
confidence: 99%
“…Several well-known network flow problems that use graph representations include the shortest path, maximum flow, minimum cost flow, and multicommodity flow problems [1]. Graph representations of roads have been used in GIS-based routing for a variety of applications, including choosing optimal roads to reach timber stands in forests and routing the collection of solid waste in India by Ghose et al [6], [18]. Extensions and manipulations to the traditional road graph model have been made in GIS applications in order to capture road topology.…”
Section: Road Network Representationmentioning
confidence: 99%