.png){kind=icon}
返回
The multiple shortest path problem with path deconfliction
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2020.11.033.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
To address the increasingly relevant challenge of routing autonomous agents within contested environments, this research formulates and examines the Multiple Shortest Path Problem with Path Deconfliction (MSPP-PD) to balance agent routing efficiency with group vulnerability. Within the general model formulation, multiple agents are routed between respective source and terminus nodes while minimizing both the total distance travelled and a measure of path conflict, where path conflict occurs for any instance of more than one agent traversing an arc and/or node. Within this modeling structure, this research presents and inspects a set of alternative, conceptually-motivated penalty metrics to inhibit path conflict between agents. Illustrative testing demonstrates the distinguishability of different MSPP-PD variants as they relate to optimal agent routing solutions, as well as the non-dominated solutions attainable via different relative priorities over the objective functions. Subsequent empirical testing over a set of synthetic instances demonstrates the effect of different penalty function metrics on both optimal solutions and the computational effort required to identify them. Concluding the work are recommendations about the utility of the MSPP-PD model variants, both individually and collectively. Published by Elsevier B.V.
Keyword:
Routing
Shortest path problem
Path deconfliction
Multi-objective optimization
Multi-agent
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
.png){kind=icon}
A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks在城市多式联运网络中寻找多目标最短路径的效用度量
PREAI
分享收藏分享收藏Metaheuristics for the risk-constrained cash-in-transit vehicle routing problem风险约束的现金在途车辆路径问题的元启发式
OAAI
OAAI分享收藏
查看更多内容