加权
稳健性(进化)
计算机科学
缩小
理论(学习稳定性)
优化算法
算法
数学优化
功能(生物学)
迭代法
a计权
多目标优化
最优化问题
工作(物理)
数据挖掘
算法设计
摘要
Traditional route optimization frameworks often suffer from “spatial blindness,” addressing the problem through abstract matrices devoid of geographical context. To address this fundamental methodological gap, this study proposes the Iterative Score Propagation Algorithm (ISPA), a transparent, GNN-inspired framework that reframes optimization as a holistic corridor problem. ISPA’s robustness and superiority were tested against established Multi-Criteria Decision-Making (MCDM) methods (WLC, TOPSIS, VIKOR) across three diverse engineering scenarios (Rural Highway, Pipeline, Trekking Trail) and two distinct weighting philosophies (Entropy and AHP). The holistic analysis reveals that ISPA achieves the highest final score (0.815) across all six test conditions, demonstrating both the highest overall mean performance (0.629) and the greatest stability (1.000). Furthermore, its flexible cost function successfully modeled unconventional objectives, such as a “climbing reward,” enabling a paradigm shift from cost minimization to experience maximization. ISPA’s superior performance stems from its structural advantage in contextualizing spatial data. This work introduces a new, spatially-aware approach that transforms route planning from a static calculation into a dynamic design and scenario analysis tool for planners and engineers.
科研通智能强力驱动
Strongly Powered by AbleSci AI