.png){kind=icon}
返回
Spatial coverage in routing and path planning problems
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2022.02.031.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Routing and path planning problems that involve spatial coverage have received increasing attention in recent years in different application areas. Spatial coverage refers to the possibility of considering nodes that are not directly served by a vehicle as visited for the purpose of the objective function or constraints. Despite similarities between the underlying problems, solution approaches have been developed in dif-ferent disciplines independently, leading to different terminologies and solution techniques. This paper proposes a unified view of the approaches: Based on a formal introduction of the concept of spatial cov-erage in vehicle routing, it presents a classification scheme for core problem features and summarizes problem variants and solution concepts developed in the domains of operations research and robotics. The connections between these related problem classes offer insights into common underlying structures and open possibilities for developing new applications and algorithms.(c) 2022 The Author(s). Published by Elsevier B.V.This is an open access article under the CC BY-NC-ND license ( http://creativecommons.org/licenses/by-nc-nd/4.0/ )
Keyword:
Vehicle routing problem
Informative path planning
Orienteering problem
Covering tour problem
Close -enough vehicle routing
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
Variable neighborhood tabu search and its application to the median cycle problem变邻域禁忌搜索及其在中环问题中的应用
.png){kind=icon}
PREAI
分享收藏Exact methods for mono-objective and Bi-Objective Multi-Vehicle Covering Tour Problems单目标和双目标多车辆覆盖游览问题的精确方法OAAI
OAAI分享收藏分享收藏
查看更多内容