A variable neighborhood search method for the orienteering problem with hotel selection

Divsalar, Ali; Vansteenwegen, Pieter; Cattrysse, Dirk

doi:10.1016/j.ijpe.2013.01.010

Cited by 60 publications

(43 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Accordingly, the itinerary of a CBT can be formulated as an optimization problem whose objective is the minimization of the total traveling time. Generally speaking, this problem can have very rich and diverse applications, such as robotic surveillance [18,57], detection of forest fires [58], tourist trip planning [59] and police crime response [60].…”

Section: The City Bus Tour (Cbt) Alternativementioning

confidence: 99%

A multi-user decision support system for online city bus tour planning

et al. 2017

View full text Add to dashboard Cite

Tourism is rapidly becoming a sustainable pathway toward economic prosperity for host countries and communities. Recent advances in information and communications technology, the smartphone, the Internet and Wi-Fi have given a boost to the tourism industry. The city bus tour (CBT) service is one of the most successful businesses in the tourism industry. However, there exists no smart decision support system determining the most efficient way to plan the itinerary of a CBT. In this research, we report on the ongoing development of a mobile application (app) and a website for tourists, hoteliers and travel agents to connect with city bus operators and book/purchase the best CBT both in terms of cost and time. Firstly, the CBT problem is formulated as an asymmetric sequential three-stage arc routing problem. All places of interest (PoI) and pickup/dropout points are identified with arcs of the network (instead of nodes), each of which can be visited at least once (instead of exactly once). Secondly, the resulting pure integer programming (IP) problem is solved using a leading optimization software known as General Algebraic Modeling System (GAMS). The GAMS code developed for this project returns: (1) the exact optimal solution identifying the footprints of the city bus relative to all the arcs forming the minimal cost network; (2) the augmenting paths corresponding to the pickup stage, the PoI visiting stage and the drop-off stage. Finally, we demonstrate the applicability of the mobile app/website via a pilot study in the city of Melbourne (Australia). All the computations relative to the initial tests show that the ability of the app to answer users' inquiries in a fraction of a minute.

show abstract

Section: The City Bus Tour (Cbt) Alternativementioning

confidence: 99%

A multi-user decision support system for online city bus tour planning

et al. 2017

View full text Add to dashboard Cite

show abstract

“…In Divsalar et al [34] and Divsalar et al [35] respectively a VNS and a memetic algorithm are proposed for the orienteering problem with hotel selection. The goal for this variant is to determine a fixed number of connected trips that visits some vertices and maximizes the sum of the collected rewards.…”

Section: -11mentioning

confidence: 99%

Optimizing practical orienteering problems with stochastic time-dependent travel times: towards congestion free routes

Verbeeck¹

2016

4OR-Q J Oper Res

View full text Add to dashboard Cite

“…The main idea of this trajectorybased method is to improve the incumbent solution by examining solutions belonging to different neighborhoods (intensification or local search part), and sometimes letting, temporarily, the objective function to deteriorate in order to escape from locally optimal solutions (diversification or shaking part). VNS has already been successfully used for solving various combinatorial and global optimization problems (Divsalar et al, 2013;Hanafi et al, in press;Sifaleras et al, 2012;Urošević, 2014).…”

Section: Novel Vns Schemes For Solving Elsrpmentioning

confidence: 99%