In this work we introduce the parking warden tour problem (PWTP), a new arc routing problem arising in irregular parking detection to model the maximization of the fines collected by a team of parking wardens. The peculiarity of the PWTP is that the arc revenue depends on the time elapsed from the previous inspection of a warden, since the revenue on a road link slumps to zero if a warden has just visited the link. For this new arc routing problem and a variant of it, we propose two mixed integer linear program formulations, a simple but effective matheuristic based on them and a bounding procedure. All the solution approaches have been tested and compared on both real instances generated on a road network area of Milano, through a survey and on real‐like random instances.

中文翻译：

---

停车督导员游览问题

在这项工作中，我们介绍了停车守望者巡回问题（PWTP），这是在不规则停车检测中出现的新弧路由问题，用于模拟由一组停车管理员收集的罚款的最大化。PWTP的特殊之处在于，电弧收益取决于从前一次看守的检查所经过的时间，因为如果看守刚刚访问过路段，道路链接上的收入就会降至零。对于这个新的弧线布线问题及其变体，我们提出了两种混合整数线性程序公式，一种基于它们的简单但有效的数学方法，以及一个边界程序。所有的解决方案方法均已通过调查在米兰的道路网区域生成的两个真实实例进行了测试和比较，并与真实的随机实例进行了比较。