多车辆覆盖巡回问题：城市巡逻路线的建立
The multi-vehicle covering tour problem: building routes for urban patrolling
摘要：
本文研究的是城市社区警务的一个特殊方面：日常巡逻路线规划。我们寻求保证能见度的路线，因为这对社区感知的安全有相当大的影响，允许快速应急响应并提供对选定地点的监视（例如，医院、学校）。规划仅限于车辆的可用性，并努力实现平衡的路线。我们研究的适应模型的多车辆覆盖旅游问题，其中一组位置必须访问，而另一个子集必须足够接近规划的路线。这是一个NP完全整数规划问题。次优的解决方案，获得了几个eclistics，一些改编自文献和其他我们开发的。我们解决了一些改编的例子从TSPLIB和一个实例与实际数据，前者与文献中的结果进行比较，后者与经验数据进行比较。
英文摘要：
In this paper we study a particular aspect of the urban community policing: routine patrol route planning. We seek routes that guarantee visibility, as this has a sizable impact on the community perceived safety, allowing quick emergency responses and providing surveillance of selected sites (e.g., hospitals, schools). The planning is restricted to the availability of vehicles and strives to achieve balanced routes. We study an adaptation of the model for the multi-vehicle covering tour problem, in which a set of locations must be visited, whereas another subset must be close enough to the planned routes. It constitutes an NP-complete integer programming problem. Suboptimal solutions are obtained with several heuristics, some adapted from the literature and others developed by us. We solve some adapted instances from TSPLIB and an instance with real data, the former being compared with results from literature, and latter being compared with empirical data.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
