Algorithms for Multi-objective Optimization Problems in Geodesy

大地测量学中多目标优化问题的算法

• 批准号: 498567099
• 负责人: Professor Dr. Heiko Röglin
• 金额: --
• 依托单位: Institut für Informatik
• 依托单位国家: 德国
• 项目类别: Research Units
• 资助国家: 德国
• 项目状态: 未结题
• 来源: https://gepris.dfg.de/gepris/projekt/498567099?language=en
• 关键词: Algorithms; Multi; objective; Optimization; Problems

In geodesy, multi-objective optimization problems are ubiquitous. An example from project C1 are clustering and aggregation problems in cartography where one has to cluster areas and aggregate them into larger regions and there are multiple objectives one wants to optimize. Another example from project C2 comes from satellite radar altimetry of the sea surface where one wants to estimate both the sea surface height (SSH) and the significant wave height (SWH) from satellite data, which leads to a multi-objective shortest path problem.A common approach to handle multi-objective optimization problems is to combine the different criteria into a single objective by taking a weighted sum. This weighting is often artificial and can result in a loss of information. We will make use of the full potential of multi-objective optimization and study in particular the set of Pareto-optimal solutions. We will develop algorithms for efficiently computing or approximating this set for the problems mentioned above and other problems motivated by applications from geodesy. We will collaborate with A2,B1, B2, and C1 on multi-objective clustering and aggregation problems, with C1 and C2 on multi-objective triangulations, and with B2, C1, and C2 on multi-objective shortest path problems. Our algorithms will be analyzed theoretically but also implemented and tested in cooperation with projects C1 and C2 as well as B2. This will lead to both improved solutions in practice and novel theoretical results.

在大地测量学中，多目标优化问题是普遍存在的。项目C1的一个例子是制图中的聚类和聚合问题，其中必须将区域聚类并将其聚合为更大的区域，并且有多个目标需要优化。另一个来自项目C2的例子是卫星雷达测高，需要从卫星数据中同时估计海面高度（SSH）和有效波高（SWH），这导致了多目标最短路径问题，处理多目标优化问题的常用方法是通过加权和将不同的准则组合成一个目标。这种加权通常是人为的，可能导致信息丢失。我们将充分利用多目标优化的潜力，特别是研究帕累托最优解的集合。我们将开发算法，有效地计算或近似这一套上述问题和其他问题的动机应用大地测量。我们将与A2，B1，B2和C1合作解决多目标聚类和聚合问题，与C1和C2合作解决多目标三角剖分问题，与B2，C1和C2合作解决多目标最短路径问题。我们的算法将进行理论分析，但也将与项目C1和C2以及B2合作实施和测试。这将导致在实践中改进的解决方案和新的理论结果。