Despite all distortions and incompleteness present in Sketch maps, they can be used for different purposes such as collecting and searching spatial data and organizing the spatial knowledge of individuals. Since the prerequisite for all of these cases is matching sketches with existing data in spatial databases or metric maps, several studies have been conducted in this field. These studies generally focus on the relationships between routes, landmarks, and regions, while data sources do not necessarily contain all of these data. Also, the subject of the incompleteness of data and evaluation of the results has been less considered in previous studies. Therefore, in this paper, a new solution for matching routes from sketches to metric maps is presented. The proposed solution uses the Genetic Algorithm to measure the similarities between routes in two phases, and in each phase, a set of geometric/topological criteria is considered to improve the matching. The proposed algorithm is implemented to match routes of 25 sketches with the routes in a metric map. The average \(F_{{{\text{Measure}}}}\) of matching is 45.59%. The results show that by considering the specific conditions (not availability of descriptive data of routes and geometric/descriptive information of landmarks), this paper has been able to take an important step toward finding an acceptable solution for the matching problem. The proposed methods can be used to deal with the incompleteness of the thematic information in metric maps.

尽管草图中存在所有失真和不完整之处，但它们可用于不同目的，例如收集和搜索空间数据以及组织个人的空间知识。由于所有这些情况的先决条件是将草图与空间数据库或度量图中的现有数据进行匹配，因此在该领域已进行了一些研究。这些研究通常集中于路线，地标和区域之间的关系，而数据源不一定包含所有这些数据。同样，在先前的研究中，数据不完整和结果评估的主题也较少被考虑。因此，本文提出了一种从草图到度量图的匹配路线的新解决方案。所提出的解决方案使用遗传算法在两个阶段中测量路线之间的相似性，并且在每个阶段中，都考虑使用一组几何/拓扑标准来提高匹配度。所提出的算法被实现为将25个草图的路线与度量图中的路线进行匹配。平均\（F _ {{{\ text {Measure}}}}} \的匹配度是45.59％。结果表明，通过考虑特定条件（不是可用的路线描述数据和地标的几何/描述信息），本文已经朝着找到可接受的匹配问题解决方案迈出了重要的一步。所提出的方法可用于处理公制地图中主题信息的不完整。