{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T20:04:10Z","timestamp":1782849850231,"version":"3.54.5"},"reference-count":43,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2024,4,14]],"date-time":"2024-04-14T00:00:00Z","timestamp":1713052800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IJGI"],"abstract":"<jats:p>Creating routes across open areas is challenging due to the absence of a defined routing network and the complexity of the environment, in which multiple criteria may affect route choice. In the context of urban environments, research has found Visibility and Spider-Grid subgraphs to be effective approaches that generate realistic routes. However, the case studies presented typically focus on plazas or parks with defined entry and exit points; little work has been carried out to date on creating routes across open areas in rural settings, which are complex environments with varying terrain and obstacles and undefined entry or exit points. To address this gap, this study proposes a method for routing across open areas based on a Spider-Grid subgraph using queen contiguity. The method leverages a Weighted Sum\u2013Dijkstra\u2019s algorithm to allow multiple criteria such as surface condition, total time, and gradient to be considered when creating routes. The method is tested on the problem of routing across two areas of Dartmoor National Park, United Kingdom. The generated routes are compared with benchmark algorithms and real paths created by users of the Ordnance Survey\u2019s Maps App. The generated routes are found to be more realistic than those of the benchmark methods and closer to the real paths. Furthermore, the routes are able to bypass hazards and obstacles while still providing realistic and flexible routes to the user.<\/jats:p>","DOI":"10.3390\/ijgi13040130","type":"journal-article","created":{"date-parts":[[2024,4,15]],"date-time":"2024-04-15T03:56:13Z","timestamp":1713153373000},"page":"130","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Multi-Criteria Framework for Routing on Access Land: A Case Study on Dartmoor National Park"],"prefix":"10.3390","volume":"13","author":[{"given":"Rafael Felipe","family":"Sprent","sequence":"first","affiliation":[{"name":"SpaceTimeLab, Department of Civil, Environmental and Geomatic Engineering, University College London (UCL), Gower Street, London WC1E 6BT, UK"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9506-4266","authenticated-orcid":false,"given":"James","family":"Haworth","sequence":"additional","affiliation":[{"name":"SpaceTimeLab, Department of Civil, Environmental and Geomatic Engineering, University College London (UCL), Gower Street, London WC1E 6BT, UK"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3575-0365","authenticated-orcid":false,"given":"Stefano","family":"Cavazzi","sequence":"additional","affiliation":[{"name":"Ordnance Survey, Adanac Drive, Southampton SO16 0AS, UK"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-7082-7122","authenticated-orcid":false,"given":"Ilya","family":"Ilyankou","sequence":"additional","affiliation":[{"name":"SpaceTimeLab, Department of Civil, Environmental and Geomatic Engineering, University College London (UCL), Gower Street, London WC1E 6BT, UK"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2024,4,14]]},"reference":[{"key":"ref_1","unstructured":"Ramblers (2022, August 24). Access to Open Countryside\u2014Ramblers, 2020. Available online: https:\/\/www.ramblers.org.uk\/policy\/england\/access\/access-to-wild-open-countryside-or-the-right-to-roam.aspx."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"87","DOI":"10.70252\/BURA5885","article-title":"Objective and subjective assessments of normal walking pace, in comparison with that recommended for moderate intensity physical activity","volume":"3","author":"Taylor","year":"2010","journal-title":"Int. J. Exerc. Sci."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"706","DOI":"10.1152\/jappl.1972.32.5.706","article-title":"Terrain coefficients for energy cost prediction","volume":"32","author":"Soule","year":"1972","journal-title":"J. Appl. Physiol."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"759","DOI":"10.15666\/aeer\/1701_759779","article-title":"Determination forest road routes via GIS-based spatial multi-criterion decision methods","volume":"17","author":"Bediroglu","year":"2019","journal-title":"Appl. Ecol. Environ. Res."},{"key":"ref_5","first-page":"1","article-title":"Towards Realistic Pedestrian Route Planning","volume":"Volume 48","author":"Italiano","year":"2015","journal-title":"Proceedings of the 15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015)"},{"key":"ref_6","first-page":"107","article-title":"Weighted Sum-Dijkstra\u2019s Algorithm in Best Path Identification based on Multiple Criteria","volume":"8","author":"Abdullah","year":"2018","journal-title":"J. Comput. Sci. Comput. Math."},{"key":"ref_7","first-page":"583","article-title":"Planning of environmentally sound forest road route using GIS & S-MCDM","volume":"141","year":"2017","journal-title":"\u0160umarski List"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1080\/10095020.2017.1399675","article-title":"Routing through open spaces\u2014A performance comparison of algorithms","volume":"21","author":"Hahmann","year":"2018","journal-title":"Geo-Spat. Inf. Sci."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1553\/giscience2016_01_s217","article-title":"Integrating Open Spaces into OpenStreetMap Routing Graphs for Realistic Crossing Behaviour in Pedestrian Navigation","volume":"1","author":"Graser","year":"2016","journal-title":"GI_Forum"},{"key":"ref_10","first-page":"21","article-title":"An Approach for Generating Pedestrian Network Based on Improved Navigation Graph","volume":"10","author":"Chen","year":"2017","journal-title":"Int. J. Hybrid Inf. Technol."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"131","DOI":"10.31181\/dmame1802138e","article-title":"Optimization of dangerous goods transport in urban zone","volume":"1","author":"Ebrahimi","year":"2018","journal-title":"Decis. Mak. Appl. Manag. Eng."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/j.eiar.2015.09.002","article-title":"Transport spatial model for the definition of green routes for city logistics centers","volume":"56","year":"2016","journal-title":"Environ. Impact Assess. Rev."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1016\/j.procs.2019.11.136","article-title":"Implementation of Dijkstra Algorithm and Multi-Criteria Decision-Making for Optimal Route Distribution","volume":"161","author":"Rosita","year":"2019","journal-title":"Procedia Comput. Sci."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1111\/1467-9671.00035","article-title":"On the Use of Weighted Linear Combination Method in GIS: Common and Best Practice Approaches","volume":"4","author":"Malczewski","year":"2000","journal-title":"Trans. GIS"},{"key":"ref_15","unstructured":"Lakshmi, M.T.M., Vetriselvi, K., Anand, A.J., and Venkatesan, D.V.P. (2016). A Study on Different Types of Normalization Methods in Adaptive Technique for Order Preference by Similarity to Ideal Solution (TOPSIS). Int. J. Eng. Res., 4, Available online: https:\/\/www.ijert.org\/research\/a-study-on-different-types-of-normalization-methods-in-adaptive-technique-for-order-preference-by-similarity-to-ideal-solution-topsis-IJERTCONV4IS05004.pdf."},{"key":"ref_16","first-page":"1449","article-title":"Weighting methods for multi-criteria decision making technique","volume":"23","author":"Odu","year":"2019","journal-title":"J. Appl. Sci. Environ. Manag."},{"key":"ref_17","unstructured":"Glynn, C. (2022, August 02). OrdnanceSurvey\/OS-British-National-Grids: A Free Set of Grids at Various Resolutions for Ordnance Survey\u2019s National Grid. Available online: https:\/\/github.com\/OrdnanceSurvey\/OS-British-National-Grids."},{"key":"ref_18","unstructured":"Ordnance Survey (2022, August 02). Os-Detailed-Path-Network-Product-Guide, 2017. Available online: https:\/\/www.ordnancesurvey.co.uk\/products\/os-detailed-path-network."},{"key":"ref_19","unstructured":"Ordnance Survey (2022, August 02). Os-Mastermap-Topography-Layer-Technical-Specification, 2017. Available online: https:\/\/www.ordnancesurvey.co.uk\/products\/os-mastermap-topography-layer."},{"key":"ref_20","unstructured":"Ordnance Survey (GB) (2022, August 02). OS MasterMap \u00ae Topography Layer [GeoPackage Geospatial Data], 2021. Available online: https:\/\/digimap.edina.ac.uk."},{"key":"ref_21","unstructured":"Ordnance Survey (2022, August 02). Os-Terrain-5-User-Guide, 2017. Available online: https:\/\/www.ordnancesurvey.co.uk\/products\/os-terrain-5."},{"key":"ref_22","unstructured":"Ware, G. (2022, September 30). Access Land & Dartmoor Commons, 2017. Available online: https:\/\/data-dcc.opendata.arcgis.com\/datasets\/access-land-dartmoor-commons."},{"key":"ref_23","unstructured":"Ramblers (2022, September 24). Access Land in England and Wales\u2014Ramblers, 2022. Available online: https:\/\/www.ramblers.org.uk\/accessguide."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"e12162","DOI":"10.1002\/2688-8319.12162","article-title":"An operational land cover and land cover change toolbox: Processing open-source data with open-source software","volume":"3","author":"Gatis","year":"2022","journal-title":"Ecol. Solut. Evid."},{"key":"ref_25","first-page":"135","article-title":"Cruach Ardran, Stobinian, and Ben More","volume":"2","author":"Naismith","year":"1892","journal-title":"Scott. Mt. Club"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"jeb.185447","DOI":"10.1242\/jeb.185447","article-title":"Preferred walking speed on rough terrain; is it all about energetics?","volume":"222","author":"Gast","year":"2019","journal-title":"J. Exp. Biol."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1152\/jappl.1971.30.3.429","article-title":"Predicting metabolic energy cost","volume":"30","author":"Givoni","year":"1971","journal-title":"J. Appl. Physiol."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1152\/jappl.1977.43.4.577","article-title":"Predicting energy expenditure with loads while standing or walking very slowly","volume":"43","author":"Pandolf","year":"1977","journal-title":"J. Appl. Physiol."},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"de Gruchy, M., Caswell, E., and Edwards, J. (2017). Velocity-Based Terrain Coefficients for Time-Based Models of Human Movement. Internet Archaeol., 45.","DOI":"10.11141\/ia.45.4"},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Herzog, I. (2022, September 05). Least-Cost Paths\u2014Some Methodological Issues, 2014. Available online: https:\/\/intarch.ac.uk\/journal\/issue36\/5\/5-3.html.","DOI":"10.11141\/ia.36.5"},{"key":"ref_31","unstructured":"Butcher, B. (2022, August 01). UK Habitat Classification\u2014Habitat Definitions, 2018. Available online: https:\/\/ecountability.co.uk\/wp-content\/uploads\/2018\/05\/UK-Habitat-Classification-Habitat-Definitions-V1.0-May-2018-1.pdf."},{"key":"ref_32","unstructured":"European Commission (2022, October 05). Forest Observations, 2015. Available online: https:\/\/forobs.jrc.ec.europa.eu\/products\/gam\/sources.php."},{"key":"ref_33","unstructured":"John, T. (2022, August 31). Gorse, 2016. Available online: https:\/\/dartmoorlinks.co.uk\/api\/content\/916d1ba6-54d5-11e6-ae0d-12955eaaf839\/."},{"key":"ref_34","unstructured":"Gourisetti, S.N.G., Mylrea, M., and Patangia, H. (2019, January 7\u20139). Application of Rank-Weight Methods to Blockchain Cybersecurity Vulnerability Assessment Framework. Proceedings of the 2019 IEEE 9th Annual Computing and Communication Workshop and Conference (CCWC), Las Vegas, NV, USA."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"14","DOI":"10.15290\/ose.2013.05.65.02","article-title":"Rank Ordering Criteria Weighting Methods\u2014A Comparative Overview","volume":"5","author":"Roszkowska","year":"2013","journal-title":"Optimum. Econ. Stud."},{"key":"ref_36","unstructured":"Ordnance Survey (2022, August 03). Technical Difficulties, 2022. Available online: https:\/\/osmaps.com\/technical-difficulties."},{"key":"ref_37","unstructured":"Renzel, P. (2022, August 01). Ramblers Cymru\u2014Key facts Report, 2018. Available online: https:\/\/www.ramblers.org.uk\/-\/media\/Files\/Wales%20microsite\/Ramblers%20Cymru%20-%20Key%20Facts%20Report%202018.ashx."},{"key":"ref_38","unstructured":"Komoot (2022, August 02). Off-Grid Tour Planning Outside of Komoot\u2019s Routing Network, 2022. Available online: https:\/\/support.komoot.com\/hc\/en-us\/articles\/360024733651-Off-grid-Tour-planning-outside-of-komoot-s-routing-network."},{"key":"ref_39","unstructured":"den Bossche, J.V., Fleischmann, M., and Jordahl, K. (2024, March 16). Geopandas\/Geopandas: Python Tools for Geographic Data, 2022. Available online: https:\/\/github.com\/geopandas\/geopandas."},{"key":"ref_40","unstructured":"Shavit, A., Snow, A.D., Rubiales, A., and Adair, A. (2024, March 16). Shapely\u2014Shapely 2.0.3 Documentation, 2024. Available online: https:\/\/shapely.readthedocs.io\/en\/stable\/index.html."},{"key":"ref_41","unstructured":"Gillies, S. (2024, March 16). Introduction\u2014Rasterio Documentation, 2021. Available online: https:\/\/rasterio.readthedocs.io\/en\/stable\/intro.html."},{"key":"ref_42","unstructured":"Hagberg, A., Schult, D., and Swart, P. (2024, March 16). NetworkX\u2014NetworkX Documentation, 2023. Available online: https:\/\/networkx.org\/."},{"key":"ref_43","unstructured":"Reksten-Monsen, C.A. (2024, March 16). TaipanRex\/Pyvisgraph: Given a List of Simple Obstacle Polygons, Build the Visibility Graph and Find the Shortest Path between Two Points, 2016. Available online: https:\/\/github.com\/TaipanRex\/pyvisgraph."}],"container-title":["ISPRS International Journal of Geo-Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2220-9964\/13\/4\/130\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T14:27:55Z","timestamp":1760106475000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2220-9964\/13\/4\/130"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,14]]},"references-count":43,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2024,4]]}},"alternative-id":["ijgi13040130"],"URL":"https:\/\/doi.org\/10.3390\/ijgi13040130","relation":{},"ISSN":["2220-9964"],"issn-type":[{"value":"2220-9964","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4,14]]}}}