Designing Single Origin-destination Itineraries for Several Classes of Cycle-tourists

Abstract

This study concerns the optimal design of cycle tourist itineraries considering several classes of users. It builds upon a recent work which first introduced the problem of designing the most attractive itinerary for cycle tourists connecting a given origin to a given destination, subject to a budget and a time constraint. Starting from a network made of existing cycle-trails, gravel paths, and unsurfaced field roads, local administrators face the problem of selecting a budget-compliant set of edges to be reconditioned and turned into paved bike trails. Indeed, investing in enhancing cycle tourism infrastructures proved to be effective in fostering sustainable development but decision support tools are needed to support decision makers in optimizing scarce public resources spending. The key issue in this problem is the objective function, namely the route attractiveness. Each node and each edge of the network yields a reward each time it is traversed, related to the pleasure of cycling along it. Additional pleasure usually decreases when traversing the same edge or node one more time but it may still be positive. Therefore, the optimal route may contain cycles, which is a special feature of this problem. In previous studies attractiveness was computed on the basis of each point of interest located on the edges and at the nodes of the route, and the route maximizing total attractiveness was searched for. The focus was on the generalist cycle tourist, without thematic preferences. This study takes a more realistic view and proposes a model where different classes of cycle tourist are considered individually, each one with its own preferences, like the cultural oriented tourist, the gastronomic fan, or the one fond of wild life and nature. This new perspective yields a new network design problem in the field of vehicle routing problems with profits, generalizing the Orienteering Problem, that we call the multi-commodity orienteering problem with network design (MOP-ND): it consists of designing a set of itineraries, one for each user class, sharing the same origin and the same destination and potentially any edge of the network, so that each itinerary satisfies a maximum duration constraint and the cost of the whole infrastructure is budget compliant. The objective is to maximize the sum on all user classes of the attractiveness of the itinerary selected for that class. In this paper we provide a mathematical model for MOP-ND, test it on realistic data, and compare with the generalist model

Tourist trip design with heterogeneous preferences, transport mode selection and environmental considerations

“…Several variants are considered when modeling real problems (Ruiz-Meza et al, 2020 ), such as time windows (Garcia et al, 2009 ; Souffiau et al, 2009 ), time-dependency (Garcia et al, 2010a , 2010b ), arc score (Arc Orienteering Problem -AOP) (Verbeeck et al, 2014 ), arc and POI scores (Mixed OP-AOP) (Gavalas et al, , 2016 , 2017 ; Malucelli et al, 2015 ), multi-commodity (Malucelli et al, 2015 ), multiple periods (Kotiloglu et al, 2017 ), time-based user interest (Lim et al, 2017 ) multiple constraints (Sylejmani et al, 2012 ), heterogeneous preferences (Malucelli et al, 2015 ; Zheng & Liao, 2019 ), uncertain travel times (Hasuike et al, 2013 ), previous tourist experiences (Zheng et al, 2017 ), time-dependent stochasticity (Liao & Zheng, 2018 ), hotel selection (Zheng et al, 2020 ), electric vehicles (EV) for tourism (Wang et al, 2018 ), scores and travel fuzzy times (Expósito et al, 2019a , 2019b ), and Clustered POIs, when POIs of different types of tourism are identified and grouped according to their class (Expósito et al, 2019a ).…”

“…About TTPD with heterogeneous preferences, the literature is very limited. Malucelli et al ( 2015 ) proposed a new combinatorial optimization problem called the Multi-Commodity Orienteering Problem with Network Design (MOP-ND). Their approach satisfies the individual preferences of a group of tourists with the same origin–destination, maximizing the profit of each tourist.…”

“…This problem also includes the time windows to access the different POIs. This approach is more realistic in contrast to previous works from the literature (i.e., Malucelli et al, 2015 ; Sylejmani et al, 2017 ; Zheng & Liao, 2019 ), in the sense that, on the route, the tourist can use different transport modes. This can be translated as a potential scheme to support sustainability (Tawfik & Limbourg, 2019 ).…”

Multi-Objective Fuzzy Tourist Trip Design Problem with Heterogeneous Preferences and Sustainable Itineraries

“…This type of TTDP variant is called TTDP with heterogeneous preferences [29], and some works are available in the literature. Malucelli et al [73] develop an extension of the OP called multi-commodity orienteering problem with network design (MOP-ND) to model the route design problem for various cycle-tourists. The model considers the preferences of each tourist who incorporates different benefits on the same route.…”

Orienteering Problem: A survey of recent variants, solution approaches and applications

“…The objective is to determine a closed path that maximizes the total collected score. Malucelli et al (2015) study the problem of designing the most attractive itineraries for a single origin-destination pair for different classes of users. The problem is formalized as an integer programming model underlining common features with the OP and the Multicommodity Minimum Cost Flow with Network Design Problem, namely the Multi-commodity OP with Network Design (MOP-ND).…”