<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="en"><front><journal-meta><journal-id journal-id-type="publisher-id">gesj</journal-id><journal-title-group><journal-title xml:lang="en">GEOGRAPHY, ENVIRONMENT, SUSTAINABILITY</journal-title><trans-title-group xml:lang="ru"><trans-title>GEOGRAPHY, ENVIRONMENT, SUSTAINABILITY</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">2071-9388</issn><issn pub-type="epub">2542-1565</issn><publisher><publisher-name>Russian Geographical Society</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.24057/2071-9388-2026-4068</article-id><article-id custom-type="elpub" pub-id-type="custom">gesj-4624</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="en"><subject>RESEARCH PAPER</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>Статьи</subject></subj-group></article-categories><title-group><article-title>Geospatial Modeling of Walking Routes Combing On-road and Off-road Movements</article-title><trans-title-group xml:lang="ru"><trans-title></trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="western" xml:lang="en"><surname>Zaslavskaya</surname><given-names>Elena S.</given-names></name></name-alternatives><bio xml:lang="en"><p>Geography faculty, Department of cartography and geoinformatics.</p><p>Leninskie Gory 1, Moscow, 119991</p></bio><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="western" xml:lang="en"><surname>Karpachevskiy</surname><given-names>Andrey M.</given-names></name></name-alternatives><bio xml:lang="en"><p>Geography faculty, Department of cartography and geoinformatics.</p><p>Leninskie Gory 1, Moscow, 119991</p></bio><email xlink:type="simple">karpach-am@yandex.ru</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff xml:lang="en" id="aff-1"><institution>Lomonosov Moscow State University</institution><country>Russian Federation</country></aff><pub-date pub-type="collection"><year>2026</year></pub-date><pub-date pub-type="epub"><day>31</day><month>03</month><year>2026</year></pub-date><volume>19</volume><issue>1</issue><fpage>130</fpage><lpage>138</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Zaslavskaya E.S., Karpachevskiy A.M., 2026</copyright-statement><copyright-year>2026</copyright-year><copyright-holder xml:lang="ru">Zaslavskaya E.S., Karpachevskiy A.M.</copyright-holder><copyright-holder xml:lang="en">Zaslavskaya E.S., Karpachevskiy A.M.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://ges.rgo.ru/jour/article/view/4624">https://ges.rgo.ru/jour/article/view/4624</self-uri><abstract><p>This paper presents a geographic information system (GIS)-based methodology for the automated planning of walking routes in areas with sparse road networks. This approach overcomes the limitations of traditional routing methods that rely solely on either vector road graphs or raster-based cost surfaces by combining both types of representations into a single flexible model. This combined model supports routing on both roads and off-road terrain, taking into account land cover, slope, and movement direction. A hierarchy of network edges prioritizes more passable segments, such as paved roads, while still allowing transitions to natural surfaces where necessary. The methodology has been implemented in ArcGIS Pro and tested using field data from the Satino educational station in the Kaluga region. Three types of regular grid-based network models (square with queen and knight adjacency, and hexagonal) were compared, and routing was simulated under different weather conditions using variable edge weights. The results demonstrate that the square grid with queen adjacency provides the best balance between accuracy and computational efficiency. Compared to the traditional least-cost path (LCP) method, the proposed approach reduces raster-induced distortions and allows for greater adaptability to user preferences. This methodology has practical applications in tourism, environmental research, and emergency route planning, particularly in regions with limited formal transportation infrastructure.</p></abstract><kwd-group xml:lang="en"><kwd>least cost path</kwd><kwd>irregular network model</kwd><kwd>land cover passability</kwd><kwd>hiking routes modeling</kwd><kwd>Satino</kwd></kwd-group><funding-group><funding-statement xml:lang="en">The study was supported by the state task of the Department of Cartography and Geoinformatics of the Lomonosov Moscow State University “Digital technologies and methods of cartography, geoinformatics and remote sensing in geographical research”</funding-statement></funding-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Antikainen H. (2013). Comparison of different strategies for determining raster-based least-cost paths with a minimum amount of distortion. Transactions in GIS, 17(1), 96-108, DOI: 10.1111/j.1467-9671.2012.01355.x.</mixed-citation><mixed-citation xml:lang="en">Antikainen H. (2013). Comparison of different strategies for determining raster-based least-cost paths with a minimum amount of distortion. Transactions in GIS, 17(1), 96-108, DOI: 10.1111/j.1467-9671.2012.01355.x.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Ashish D.D.V.S., Munjal S., Mani M., Srivastava S. (2021). Path finding algorithms. In: Emerging Technologies in Data Mining and Information Security. Proceedings of IEMIS 2020, 1, 331-338. Advances in Intelligent Systems and Computing, DOI: 10.1007/978-981-15-9927-9_33.</mixed-citation><mixed-citation xml:lang="en">Ashish D.D.V.S., Munjal S., Mani M., Srivastava S. (2021). Path finding algorithms. In: Emerging Technologies in Data Mining and Information Security. Proceedings of IEMIS 2020, 1, 331-338. Advances in Intelligent Systems and Computing, DOI: 10.1007/978-981-15-9927-9_33.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Bagli S., Geneletti D., Orsi F. (2011). Routing of power lines through least-cost path analysis and multicriteria evaluation to minimize environmental impacts. Environmental Impact Assessment Review, 31, 234-239, DOI: 10.1016/j.eiar.2010.10.003.</mixed-citation><mixed-citation xml:lang="en">Bagli S., Geneletti D., Orsi F. (2011). Routing of power lines through least-cost path analysis and multicriteria evaluation to minimize environmental impacts. Environmental Impact Assessment Review, 31, 234-239, DOI: 10.1016/j.eiar.2010.10.003.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Balstrøm T. (2002). On identifying the most time-saving walking route in a trackless mountainous terrain. Geografisk Tidsskrift, 102, 51-58, DOI: 10.1080/00167223.2002.10649465.</mixed-citation><mixed-citation xml:lang="en">Balstrøm T. (2002). On identifying the most time-saving walking route in a trackless mountainous terrain. Geografisk Tidsskrift, 102, 51-58, DOI: 10.1080/00167223.2002.10649465.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Bemmelen J., Quak W., Hekken M., Oosterom P. (1993). Vector vs. raster-based algorithms for cross country movement planning. Proceedings of Auto-Carto, 11, 50-59.</mixed-citation><mixed-citation xml:lang="en">Bemmelen J., Quak W., Hekken M., Oosterom P. (1993). Vector vs. raster-based algorithms for cross country movement planning. Proceedings of Auto-Carto, 11, 50-59.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Choi Y., Park H.-D., Sunwoo C., Clarke K. (2009). Multi-criteria evaluation and least-cost path analysis for optimal haulage routing of dump trucks in large scale open-pit mines. International Journal of Geographical Information Science, 23, 1541-1567, DOI: 10.1080/13658810802385245.</mixed-citation><mixed-citation xml:lang="en">Choi Y., Park H.-D., Sunwoo C., Clarke K. (2009). Multi-criteria evaluation and least-cost path analysis for optimal haulage routing of dump trucks in large scale open-pit mines. International Journal of Geographical Information Science, 23, 1541-1567, DOI: 10.1080/13658810802385245.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Choi Y., Um J.G., Park M.H. (2013). Finding least-cost paths across a continuous raster surface with discrete vector networks. Cartography and Geographic Information Science, 41(1), 75-85, DOI: 10.1080/15230406.2013.850837.</mixed-citation><mixed-citation xml:lang="en">Choi Y., Um J.G., Park M.H. (2013). Finding least-cost paths across a continuous raster surface with discrete vector networks. Cartography and Geographic Information Science, 41(1), 75-85, DOI: 10.1080/15230406.2013.850837.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Collischonn W., Pilar J.V. (2000). A direction dependent least-cost-path algorithm for roads and canals. International Journal of Geographical Information Science, 14, 397-406, DOI: 10.1080/13658810050024304.</mixed-citation><mixed-citation xml:lang="en">Collischonn W., Pilar J.V. (2000). A direction dependent least-cost-path algorithm for roads and canals. International Journal of Geographical Information Science, 14, 397-406, DOI: 10.1080/13658810050024304.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">ESRI (1991). Performing analysis with GRID: Cell-based modeling with GRID. ARC/INFO User’s Guide 6.0. Redlands, CA: Environmental Systems Research Institute.</mixed-citation><mixed-citation xml:lang="en">ESRI (1991). Performing analysis with GRID: Cell-based modeling with GRID. ARC/INFO User’s Guide 6.0. Redlands, CA: Environmental Systems Research Institute.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">ESRI (2005). Hierarchical routes in ArcGIS Network Analyst. ESRI White Paper. Redlands, CA: ESRI.</mixed-citation><mixed-citation xml:lang="en">ESRI (2005). Hierarchical routes in ArcGIS Network Analyst. ESRI White Paper. Redlands, CA: ESRI.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Goodchild M.F. (1977). An evaluation of lattice solutions to the problem of corridor location. Environment and Planning A, 9, 727-738, DOI: 10.1068/a090727.</mixed-citation><mixed-citation xml:lang="en">Goodchild M.F. (1977). An evaluation of lattice solutions to the problem of corridor location. Environment and Planning A, 9, 727-738, DOI: 10.1068/a090727.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Kourtz P.H., O’Regan W.G. (1971). A model for a small forest fire to simulate burned and burning areas for use in a detection model. Forest Science, 17(2), 163–169, DOI: 10.1093/forestscience/17.2.163.</mixed-citation><mixed-citation xml:lang="en">Kourtz P.H., O’Regan W.G. (1971). A model for a small forest fire to simulate burned and burning areas for use in a detection model. Forest Science, 17(2), 163–169, DOI: 10.1093/forestscience/17.2.163.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Miller H., Shaw S.-L. (2001). Geographic Information Systems for Transportation. Oxford: Oxford University Press.</mixed-citation><mixed-citation xml:lang="en">Miller H., Shaw S.-L. (2001). Geographic Information Systems for Transportation. Oxford: Oxford University Press.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Novakovsky B.A., Kargashin P.E., Karpachevskiy A.M. (2017). Geoinformation analysis of territory for automated selection of power line routing. Geoinformatics, (2), 30-38 (in Russian with English summary).</mixed-citation><mixed-citation xml:lang="en">Novakovsky B.A., Kargashin P.E., Karpachevskiy A.M. (2017). Geoinformation analysis of territory for automated selection of power line routing. Geoinformatics, (2), 30-38 (in Russian with English summary).</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Pokonieczny K. (2020). The methodology of creating variable resolution maps based on the example of passability maps. ISPRS International Journal of Geo-Information, 9(12), 738, DOI: 10.3390/ijgi9120738.</mixed-citation><mixed-citation xml:lang="en">Pokonieczny K. (2020). The methodology of creating variable resolution maps based on the example of passability maps. ISPRS International Journal of Geo-Information, 9(12), 738, DOI: 10.3390/ijgi9120738.</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">Rees W.G. (2004). Least-cost paths in mountainous terrain. Computers &amp; Geosciences, 30, 203-209, DOI: 10.1016/j.cageo.2003.11.001.</mixed-citation><mixed-citation xml:lang="en">Rees W.G. (2004). Least-cost paths in mountainous terrain. Computers &amp; Geosciences, 30, 203-209, DOI: 10.1016/j.cageo.2003.11.001.</mixed-citation></citation-alternatives></ref><ref id="cit17"><label>17</label><citation-alternatives><mixed-citation xml:lang="ru">Rylsky I.A. (2009). The influence of geographical environment factors on automated pipeline routing. Moscow: MAX Press, 192 p. (in Russian).</mixed-citation><mixed-citation xml:lang="en">Rylsky I.A. (2009). The influence of geographical environment factors on automated pipeline routing. Moscow: MAX Press, 192 p. (in Russian).</mixed-citation></citation-alternatives></ref><ref id="cit18"><label>18</label><citation-alternatives><mixed-citation xml:lang="ru">Seegmiller L., Shirabe T., Tomlin C. (2020). A method for finding least-cost corridors with reduced distortion in raster space. International Journal of Geographical Information Science, 35, 1-22, DOI: 10.1080/13658816.2020.1850734.</mixed-citation><mixed-citation xml:lang="en">Seegmiller L., Shirabe T., Tomlin C. (2020). A method for finding least-cost corridors with reduced distortion in raster space. International Journal of Geographical Information Science, 35, 1-22, DOI: 10.1080/13658816.2020.1850734.</mixed-citation></citation-alternatives></ref><ref id="cit19"><label>19</label><citation-alternatives><mixed-citation xml:lang="ru">Susanto A. (2021). Performance comparison of Dijkstra, A*, and Floyd–Warshall algorithms in shortest path problems. Journal of Applied Mathematics and Computation, 5(2), 89-98.</mixed-citation><mixed-citation xml:lang="en">Susanto A. (2021). Performance comparison of Dijkstra, A*, and Floyd–Warshall algorithms in shortest path problems. Journal of Applied Mathematics and Computation, 5(2), 89-98.</mixed-citation></citation-alternatives></ref><ref id="cit20"><label>20</label><citation-alternatives><mixed-citation xml:lang="ru">Tobler W. (1993). Three presentations on geographical analysis and modeling. Santa Barbara, CA: National Center for Geographic Information and Analysis.</mixed-citation><mixed-citation xml:lang="en">Tobler W. (1993). Three presentations on geographical analysis and modeling. Santa Barbara, CA: National Center for Geographic Information and Analysis.</mixed-citation></citation-alternatives></ref><ref id="cit21"><label>21</label><citation-alternatives><mixed-citation xml:lang="ru">Tomlin C.D. (1990). Geographic Information Systems and Cartographic Modeling. Englewood Cliffs, NJ: Prentice-Hall.</mixed-citation><mixed-citation xml:lang="en">Tomlin C.D. (1990). Geographic Information Systems and Cartographic Modeling. Englewood Cliffs, NJ: Prentice-Hall.</mixed-citation></citation-alternatives></ref><ref id="cit22"><label>22</label><citation-alternatives><mixed-citation xml:lang="ru">Warntz W. (1957). Transportation, social physics, and the law of refraction. The Professional Geographer, 9(4), 2-7, DOI: 10.1111/j.0033-0124.1957.094_2.x.</mixed-citation><mixed-citation xml:lang="en">Warntz W. (1957). Transportation, social physics, and the law of refraction. The Professional Geographer, 9(4), 2-7, DOI: 10.1111/j.0033-0124.1957.094_2.x.</mixed-citation></citation-alternatives></ref><ref id="cit23"><label>23</label><citation-alternatives><mixed-citation xml:lang="ru">Yu C., Lee J., Munro-Stasiuk M.J. (2010). Extensions to least-cost path algorithms for roadway planning. International Journal of Geographical Information Science, 17, 361-376, DOI: 10.1080/1365881031000072645.</mixed-citation><mixed-citation xml:lang="en">Yu C., Lee J., Munro-Stasiuk M.J. (2010). Extensions to least-cost path algorithms for roadway planning. International Journal of Geographical Information Science, 17, 361-376, DOI: 10.1080/1365881031000072645.</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
