arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2207.00097math.OC
收藏

整合道路网络与行人网络的多模态游客行程规划器

A multimodal tourist trip planner integrating road and pedestrian networks

Tommaso Adamo, Lucio Colizzi, Giovanni Dimauro, Gianpaolo Ghiani, Emanuela Guerriero

AI总结:

针对由道路与行人网络构成的多模态游客行程设计问题,本文提出常数时间可行性评估方法,并据此设计迭代局部搜索,可在数秒内求解含3643个兴趣点的七天现实实例。

摘要:

游客行程设计问题旨在制定一个使游客满意度最大化的观光计划,同时考虑大量参数和约束,例如兴趣点之间的距离、每次游览的预计时长、每个景点的开放时间以及每日可用时间。在本文中,我们研究该问题的一个变体,其中移动环境由行人网络和道路网络组成。因此,一个计划包含一条带有若干停靠点的汽车游览路线,并从这些停靠点出发,形成前往各景点(每个景点都有自己的时间窗)的行人子游览。我们研究了该问题,并开发了一种能够在常数时间内评估解可行性的方法,以加速搜索。该结果被用于设计一种专门的迭代局部搜索。实验结果表明,我们的方法能够在几秒内处理包含多达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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑