摘要：Normal 0 21 false false false FI X-NONE X-NONE /* Style Definitions */ table.MsoNormalTable {mso-style-name:"Table Normal"; mso-tstyle-rowband-size:0; mso-tstyle-colband-size:0; mso-style-noshow:yes; mso-style-priority:99; mso-style-parent:""; mso-padding-alt:0cm 5.4pt 0cm 5.4pt; mso-para-margin:0cm; mso-para-margin-bottom:.0001pt; mso-pagination:widow-orphan; font-size:10.0pt; font-family:"Times New Roman","serif";} In recent decades, routing based on Geographic Information Systems (GIS) has become a major branch of technology, which has been used especially in applications related to transport and logistics. However, in terms of the development of methods, routing in a cross-country environment is more difficult, and hence research into it has been relatively scarce. This is particularly true in the context of complex routing problems involving visits to several locations. A typical example of a problem of this kind is field inventory, which is a data collection procedure used in many application areas, particularly those related to environmental research and the management of natural resources. This study presents a problem in which an efficient inventory route is determined for an areal object, such that the area visible from the route meets a prescribed threshold, while maintaining the shortest possible route. Although this problem, referred to here as the Areal Inventory Problem (AIP), is closely related to a multitude of routing and location allocation methods known in the context of GIS, none of them is very well-suited for solving the AIP. This study describes a general solution procedure for the AIP, and introduces an implementation of a heuristic algorithm that can be used to solve a real-world AIP within a reasonable time frame. The proposed approach is demonstrated with actual data related to field inventory practices carried out by the Finnish Forest Centre.
关键词：Finland;inventory of forest resources;Areal Inventory Problem;route optimization;location allocation;maximum coverage
