A multimodal tourist trip planner integrating road and pedestrian networks

TL;DR

This paper presents a novel multimodal trip planning method that integrates road and pedestrian networks, optimizing sightseeing routes with constraints like time windows and attraction hours, demonstrated on large-scale instances.

Contribution

It introduces a new variant of the Tourist Trip Design Problem with multimodal mobility and develops an efficient feasibility evaluation method and an iterated local search algorithm.

Findings

Handles instances with up to 3643 points of interest

Feasibility evaluation runs in constant time

Produces solutions in a few seconds for large instances

Abstract

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.