论线性地物的优化地理空间冲突模型之间的理论联系

IF 2.8 3区 地球科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS
Zhen Lei, Zhangshun Yuan, Ting L. Lei
{"title":"论线性地物的优化地理空间冲突模型之间的理论联系","authors":"Zhen Lei, Zhangshun Yuan, Ting L. Lei","doi":"10.3390/ijgi13090310","DOIUrl":null,"url":null,"abstract":"Geospatial data conflation involves matching and combining two maps to create a new map. It has received increased research attention in recent years due to its wide range of applications in GIS (Geographic Information System) data production and analysis. The map assignment problem (conceptualized in the 1980s) is one of the earliest conflation methods, in which GIS features from two maps are matched by minimizing their total discrepancy or distance. Recently, more flexible optimization models have been proposed. This includes conflation models based on the network flow problem and new models based on Mixed Integer Linear Programming (MILP). A natural question is: how are these models related or different, and how do they compare? In this study, an analytic review of major optimized conflation models in the literature is conducted and the structural linkages between them are identified. Moreover, a MILP model (the base-matching problem) and its bi-matching version are presented as a common basis. Our analysis shows that the assignment problem and all other optimized conflation models in the literature can be viewed or reformulated as variants of the base models. For network-flow based models, proof is presented that the base-matching problem is equivalent to the network-flow based fixed-charge-matching model. The equivalence of the MILP reformulation is also verified experimentally. For the existing MILP-based models, common notation is established and used to demonstrate that they are extensions of the base models in straight-forward ways. The contributions of this study are threefold. Firstly, it helps the analyst to understand the structural commonalities and differences of current conflation models and to choose different models. Secondly, by reformulating the network-flow models (and therefore, all current models) using MILP, the presented work eases the practical application of conflation by leveraging the many off-the-shelf MILP solvers. Thirdly, the base models can serve as a common ground for studying and writing new conflation models by allowing a modular and incremental way of model development.","PeriodicalId":48738,"journal":{"name":"ISPRS International Journal of Geo-Information","volume":"165 1","pages":""},"PeriodicalIF":2.8000,"publicationDate":"2024-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the Theoretical Link between Optimized Geospatial Conflation Models for Linear Features\",\"authors\":\"Zhen Lei, Zhangshun Yuan, Ting L. Lei\",\"doi\":\"10.3390/ijgi13090310\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Geospatial data conflation involves matching and combining two maps to create a new map. It has received increased research attention in recent years due to its wide range of applications in GIS (Geographic Information System) data production and analysis. The map assignment problem (conceptualized in the 1980s) is one of the earliest conflation methods, in which GIS features from two maps are matched by minimizing their total discrepancy or distance. Recently, more flexible optimization models have been proposed. This includes conflation models based on the network flow problem and new models based on Mixed Integer Linear Programming (MILP). A natural question is: how are these models related or different, and how do they compare? In this study, an analytic review of major optimized conflation models in the literature is conducted and the structural linkages between them are identified. Moreover, a MILP model (the base-matching problem) and its bi-matching version are presented as a common basis. Our analysis shows that the assignment problem and all other optimized conflation models in the literature can be viewed or reformulated as variants of the base models. For network-flow based models, proof is presented that the base-matching problem is equivalent to the network-flow based fixed-charge-matching model. The equivalence of the MILP reformulation is also verified experimentally. For the existing MILP-based models, common notation is established and used to demonstrate that they are extensions of the base models in straight-forward ways. The contributions of this study are threefold. Firstly, it helps the analyst to understand the structural commonalities and differences of current conflation models and to choose different models. Secondly, by reformulating the network-flow models (and therefore, all current models) using MILP, the presented work eases the practical application of conflation by leveraging the many off-the-shelf MILP solvers. Thirdly, the base models can serve as a common ground for studying and writing new conflation models by allowing a modular and incremental way of model development.\",\"PeriodicalId\":48738,\"journal\":{\"name\":\"ISPRS International Journal of Geo-Information\",\"volume\":\"165 1\",\"pages\":\"\"},\"PeriodicalIF\":2.8000,\"publicationDate\":\"2024-08-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ISPRS International Journal of Geo-Information\",\"FirstCategoryId\":\"89\",\"ListUrlMain\":\"https://doi.org/10.3390/ijgi13090310\",\"RegionNum\":3,\"RegionCategory\":\"地球科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ISPRS International Journal of Geo-Information","FirstCategoryId":"89","ListUrlMain":"https://doi.org/10.3390/ijgi13090310","RegionNum":3,"RegionCategory":"地球科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

地理空间数据混合涉及将两幅地图进行匹配和组合,以创建一幅新地图。近年来,由于其在 GIS(地理信息系统)数据生产和分析中的广泛应用,它受到了越来越多的研究关注。地图分配问题(20 世纪 80 年代提出的概念)是最早的合并方法之一,在该方法中,来自两张地图的 GIS 特征通过最小化它们的总差异或距离来进行匹配。最近,人们提出了更灵活的优化模型。其中包括基于网络流问题的混合模型和基于混合整数线性规划(MILP)的新模型。一个自然而然的问题是:这些模型之间有什么联系或区别,它们之间如何比较?在本研究中,我们对文献中的主要优化混合模型进行了分析回顾,并确定了它们之间的结构联系。此外,还提出了一个 MILP 模型(基匹配问题)及其双匹配版本作为共同基础。我们的分析表明,分配问题和文献中的所有其他优化混淆模型都可以看作是基础模型的变体或重新表述。对于基于网络流的模型,证明了基础匹配问题等同于基于网络流的固定费用匹配模型。MILP 重构的等价性也得到了实验验证。对于现有的基于 MILP 的模型,建立了通用符号,并用直截了当的方法证明它们是基础模型的扩展。本研究有三方面的贡献。首先,它有助于分析人员了解当前混淆模型的结构共性和差异,并选择不同的模型。其次,通过使用 MILP 对网络流模型(以及所有现有模型)进行重新表述,本研究利用许多现成的 MILP 求解器,简化了混淆的实际应用。第三,通过模块化和增量式的模型开发方式,基础模型可以作为研究和编写新的混合模型的共同基础。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
On the Theoretical Link between Optimized Geospatial Conflation Models for Linear Features
Geospatial data conflation involves matching and combining two maps to create a new map. It has received increased research attention in recent years due to its wide range of applications in GIS (Geographic Information System) data production and analysis. The map assignment problem (conceptualized in the 1980s) is one of the earliest conflation methods, in which GIS features from two maps are matched by minimizing their total discrepancy or distance. Recently, more flexible optimization models have been proposed. This includes conflation models based on the network flow problem and new models based on Mixed Integer Linear Programming (MILP). A natural question is: how are these models related or different, and how do they compare? In this study, an analytic review of major optimized conflation models in the literature is conducted and the structural linkages between them are identified. Moreover, a MILP model (the base-matching problem) and its bi-matching version are presented as a common basis. Our analysis shows that the assignment problem and all other optimized conflation models in the literature can be viewed or reformulated as variants of the base models. For network-flow based models, proof is presented that the base-matching problem is equivalent to the network-flow based fixed-charge-matching model. The equivalence of the MILP reformulation is also verified experimentally. For the existing MILP-based models, common notation is established and used to demonstrate that they are extensions of the base models in straight-forward ways. The contributions of this study are threefold. Firstly, it helps the analyst to understand the structural commonalities and differences of current conflation models and to choose different models. Secondly, by reformulating the network-flow models (and therefore, all current models) using MILP, the presented work eases the practical application of conflation by leveraging the many off-the-shelf MILP solvers. Thirdly, the base models can serve as a common ground for studying and writing new conflation models by allowing a modular and incremental way of model development.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
ISPRS International Journal of Geo-Information
ISPRS International Journal of Geo-Information GEOGRAPHY, PHYSICALREMOTE SENSING&nb-REMOTE SENSING
CiteScore
6.90
自引率
11.80%
发文量
520
审稿时长
19.87 days
期刊介绍: ISPRS International Journal of Geo-Information (ISSN 2220-9964) provides an advanced forum for the science and technology of geographic information. ISPRS International Journal of Geo-Information publishes regular research papers, reviews and communications. Our aim is to encourage scientists to publish their experimental and theoretical results in as much detail as possible. There is no restriction on the length of the papers. The full experimental details must be provided so that the results can be reproduced. The 2018 IJGI Outstanding Reviewer Award has been launched! This award acknowledge those who have generously dedicated their time to review manuscripts submitted to IJGI. See full details at http://www.mdpi.com/journal/ijgi/awards.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信