论文标题
一个多式联运的旅游计划者，整合了道路和行人网络
A multimodal tourist trip planner integrating road and pedestrian networks
论文作者
论文摘要
旅游旅行设计问题旨在开出一个观光计划，同时考虑到许多参数和约束，例如感兴趣的点之间的距离，每次访问的预期持续时间，每个景点的开放时间，每天可用的时间。在本文中，我们处理了一个问题的变体，其中移动性环境由行人网络和道路网络组成。因此，一个计划包括一场汽车之旅，其中有许多停靠站，从该景点到景点（每个都有自己的时间窗）离开。我们研究问题并开发一种评估解决方案在恒定时间内可行性的方法，以加快搜索的速度。该结果用于设计临时迭代的本地搜索。实验结果表明，我们的方法可以在几秒钟内处理最多3643点（在七天的计划范围内）的现实实例。
The Tourist Trip Design Problem aims to prescribe a sightseeing plan that maximizes tourist satisfaction while taking into account a multitude of parameters and constraints, such as the distances among points of interest, the expected duration of each visit, the opening hours of each attraction, the time available daily. In this article we deal with a variant of the problem in which the mobility environment consists of a pedestrian network and a road network. So, one plan includes a car tour with a number of stops from which pedestrian subtours to attractions (each with its own time windows) depart. We study the problem and develop a method to evaluate the feasibility of solutions in constant time, to speed up the search. This result is used to devise an ad-hoc iterated local search. Experimental results show that our approach can handle realistic instances with up to 3643 points of interest (over a seven day planning horizon) in few seconds.
