<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta>
      <journal-title-group>
        <journal-title>ACM Conference on Recommender Systems (RecSys),
September</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Exploiting Item Dependencies to Improve Tourist Trip Recommendations</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Daniel Herzog</string-name>
          <email>herzogd@in.tum.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Wolfgang Wörndl</string-name>
          <email>woerndl@in.tum.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Informatics, Technical University of Munich</institution>
          ,
          <addr-line>Boltzmannstr. 3, 85748 Garching</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2016</year>
      </pub-date>
      <volume>15</volume>
      <issue>2016</issue>
      <abstract>
        <p>Combining multiple points of interest (POIs) to attractive and reasonable tourist trips is a challenge in the eld of Recommender Systems (RSs). Even if a user likes going to restaurants, a trip composed of too many restaurants will not be appreciated. In this position paper, we present our ideas how to improve tourist trip recommendations by focusing more on user satisfaction. We introduce the concept of item dependencies describing how POIs in uence the value of other POIs in the same trip when recommending tourist trips. Besides background information and related work in the eld of tourist trip recommendations, we present ideas to iteratively learn dependencies between items and to integrate them into the recommendation process.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. INTRODUCTION AND MOTIVATION</title>
      <p>
        Optimizing sequences of recommendations is an ongoing
challenge in the research of Recommender Systems (RSs)
[
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]. One example of sequential recommendations are tourist
trips composed of multiple points of interest (POIs) such
as restaurants, museums or monuments. Finding the right
combination of POIs for a tourist trip is a complex task.
Combining the highest rated POIs into a sequence does not
guarantee the highest possible user satisfaction when one
POI has a negative in uence on another POI or the trip
itself. For example, a person who likes going to restaurants
will most likely prefer daily trips including one or two
restaurants but every additional restaurant may be less appealing.
      </p>
      <p>
        On the other side, a craft market might be more appreciated
after visiting a related folk museum [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ]. The examples show
that the total value of a trip is not the sum of the predicted
ratings of the POIs. Instead, the value of a POI for a user
is in uenced by other POIs in the same trip. We call this
in uence item dependencies. Such item dependencies can
follow a general pattern (e.g., limiting restaurants in a trip
to a reasonable number) but usually di er between users
because of personal preferences.
      </p>
      <p>In order to integrate item dependencies into the
recommendation process, the user's preferences and the relevant
item dependencies for the user have to be collected.
Advanced user interfaces and interaction options help to achieve
this goal. Thus, we want to tackle the described problem
from two perspectives: recommendation algorithms and the
user's perspective. We de ne the following two research
questions:
RQ 1 How can existing algorithms be extended to consider
item dependencies when recommending POI sequences?
RQ 2 How can user interfaces support the users in providing
feedback on mobile devices with regard to appreciated
combinations of POIs?</p>
      <p>In order to nd answers to these research questions, we
will develop novel algorithms, implement them in a real
working RS and evaluate their performance in large user
studies. In this position paper, we start our research by
presenting background information and related work. We
introduce item dependencies in tourist trips and suggest a
framework for sequential POI recommendations with the
focus on nding the best combinations of POIs. In the end,
we give an outlook on experiments we want to conduct to
evaluate our work and we provide a short conclusion.
2.</p>
    </sec>
    <sec id="sec-2">
      <title>BACKGROUND AND RELATED WORK</title>
      <p>In this section, we provide an introduction to the topic of
tourist trip recommendations. We brie y summarize
important related work in this eld and introduce the extension
of item dependencies.
2.1</p>
    </sec>
    <sec id="sec-3">
      <title>Related Tourist Trip Design Problems</title>
      <p>
        The problem of combining POIs to attractive and
reasonable routes is called the Tourist Trip Design Problem
(TTDP) [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ]. In its simplest speci cation, the TTDP is
identical to the Orienteering Problem (OP): every location
which can be visited has a value but a time budget and the
known travel time between the points restricts the number
of possible routes [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ]. The OP aims to nd a route which
includes some of the points to maximize the overall value for
the traveler while not exceeding the time budget.
      </p>
      <p>
        Over the past years, di erent extensions of the OP have
been researched. The team orienteering problem (TOP)
aims at nding multiple routes at the same time while
avoiding overlaps [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. In the (T)OP with time windows (TOPTW),
each location can only be visited within a de ned time
window (e.g., the opening hours of that POI) [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ]. Further
variants allow the integration of inter-modal transportation
into the trip planning [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] or add multiple constraints [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ].
      </p>
      <p>
        A few variants of the OP pursue similar goals to our work.
Little attention has been given to the Generalized
Orienteering Problem (GOP) which can be applied to, for example,
reduce the value of a trip if it contains many equal
attractions. The main di erence between the OP and the GOP
is that every node in the GOP comes with a set of values
representing multiple goals of the visitor [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. Other
variants close to our problem are the OP with variable pro ts
(OPVP) [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], the TOP with decreasing pro ts (DPTOP) [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]
and the Clustered OP (COP) [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. The OPVP assumes that
the node values depend on a number of discrete passes or
the time spent at the node. In the DPTOP the pro t of
each node decreases with time and in the COP the score of
a node can only be gained if all nodes of a group of nodes
are part of the path.
      </p>
      <p>
        Extensive overviews of existing algorithms and heuristics
solving the described problems are presented by
Vansteenwegen et al. [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ], Gavalas et al. [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] and Gunawan et al.
[
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. So far, no existing work considers individual
dependencies between POIs, e.g., the in uence of a restaurant on
another POI. In our work, we want to develop heuristics that
maximize the user satisfaction by incorporating item
dependencies and that can be used for practical applications.
2.2
      </p>
    </sec>
    <sec id="sec-4">
      <title>Existing Tourist Trip Applications</title>
      <p>
        Some applications recommending sequences of items
exist but only a few working prototypes recommend tourist
trips. Vansteenwegen et al. developed the City Trip
Planner, a web application that recommends trips for a requested
number of days [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ]. It respects limitations like opening
hours and can include a lunch break into the trip. An
updated version is available at www.citytripplanner.com. A
similar application for multi-day tourist trips is DailyTRIP
[
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. Worndl and Hefele [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ] developed a web application for
nding city trips. It uses Foursquare to predict POI ratings
for the user and extends Dijkstra's algorithm to generate
routes. Garcia et al. developed a desktop and mobile
prototype for recommending trips in San Sebastian [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. mTrip
(www.mtrip.com/en/travel-guide/) is a mobile tourist guide
available for Android and iOS. Some of these applications
allow basic customization after a trip has been recommended,
e.g., removing single POIs or use more iterative dialogues
between the user and the system to nd travel packages [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ]
[
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]. None of them provides advanced user interfaces to learn
and consider individual dependencies between POIs, which
is an important task when improving the selection of items
in a sequential RS.
      </p>
    </sec>
    <sec id="sec-5">
      <title>Item Dependencies in Tourist Trip Recommendations</title>
      <p>In most of the OP variants, a location is a node with a x
value. As POIs come with certain characteristics (e.g., the
POI type), we claim that the attractiveness of a tourist trip
recommendation can be increased if these values are exible
and dependent on the presence or absence of other POIs in
the same trip.</p>
      <p>Figure 1 shows how considering item dependencies changes
the trip generation process. In this example, the black points
represent restaurants, the white points POIs of other
categories. The predicted ratings are in a range from 1 (lowest
value) to 10 (highest value). Assuming that a user does
not have the time to visit all POIs, the route of the solid
line could be recommended. However, two restaurants in a
trip with three POIs might not be appreciated by the user.
Thus, the rating of the second restaurant perceived by the
user is actually lower than the prediction (1 instead of 8).
Algorithms incorporating item dependencies would therefore
change the trip by the dashed line to generate a more
pleasant route (assuming that including the new POI does not
have any negative in uence on the other POIs of the trip).</p>
      <p>
        The existing TTDP applications presented in Section 2.2
generate feasible routes but they do not consider the
described dependencies between POIs. This is an important,
open task to improve the quality of recommended tourist
trips [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ].
3.
      </p>
    </sec>
    <sec id="sec-6">
      <title>PROPOSED SOLUTION AND NEXT RE</title>
    </sec>
    <sec id="sec-7">
      <title>SEARCH STEPS</title>
      <p>To tackle the described problem, we have to develop novel
algorithms considering dependencies between POIs.
Furthermore, a RS has to provide user interfaces that allow to
learn user preferences and item dependencies and to provide
feedback on recommendations while minimizing user e ort.
3.1</p>
    </sec>
    <sec id="sec-8">
      <title>Extending Existing TTDP Algorithms</title>
      <p>We focus on trip recommendations from a user perspective
and for practical applications. Hence, we will mainly develop
and improve heuristics instead of exact algorithms to ensure
a feasible runtime.</p>
      <p>
        Greedy algorithms choose the locally optimal choice at
each step of the trip generation. One example is Dijkstra's
algorithm which already has been used to recommend tourist
trips [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ]. Such an algorithm can be adapted to use exible
values that change depending on the already visited nodes
of the graph. Other approaches solving the OP start with
nding a path using a greedy algorithm and then update the
path in an iterative manner, i.e., removing or replacing single
nodes of the generated path [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. This is another promising
solution for incorporating item dependencies. After a rst
path has been found, single POIs can be replaced or removed
if this has a positive e ect on other POIs or the trip, as
presented in Figure 1. Another idea is to extend a tabu
search heuristic which already has been applied for more
complex OP variants [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ].
3.2
      </p>
    </sec>
    <sec id="sec-9">
      <title>Creating Routes and Learning Item Dependencies</title>
      <p>User preferences and relevant item dependencies have to
be elicited to improve the outcome of the presented
algorithms. One goal is to reduce user interaction especially
when the user is moving or already on a trip.</p>
      <p>We suggest a conversational recommendation approach.
The idea is to provide dialogues to iteratively create and
update the recommendations and to use the user's feedback
to learn relevant item dependencies. The key activities of
our framework are illustrated in Figure 2. After predicting
ratings for all POIs that come into consideration for
recommendation, two iterative processes generate POI sequences
and update the recommendation if the user's plans change.
The key activities are explained in detail in the following.
The annotations in Figure 2 show which activities aim at
solving the rst (RQ 1) and which the second (RQ 2)
research question.</p>
      <p>
        The framework is composed of three main phases. In the
rating prediction phase, established recommendation
techniques are applied to predict ratings. These ratings
represent the value of the POI for the user regardless of other
POIs. This rating should consider the context of the
recommendation to improve the prediction. For example, an
outdoor POI should receive a lower rating when the weather
is bad. In the next phase, route generation, the RS creates
the rst route including some of the rated POIs. Therefore,
one of the algorithms introduced in Section 3.1 is applied.
In contrast to single-shot recommendations, our framework
generates routes in an iterative manner. For example, the
user can be presented with two or more alternatives for
concrete POI recommendations and can indicate her or his
preferences for one POI over the others. Other options are
suggestions for adding or removing POIs. While some
dependencies are universal (e.g., no need for two restaurants in
a row), these interactions support the RS in learning
further combinations of POIs the user appreciates or rejects.
Nevertheless, the user should not be overwhelmed with
interactions. This is why implicit feedback plays an important
role in our research. If, for example, a user spends a lot of
time at a POI, it is likely that the user is interested in
similar POIs. After each feedback phase, the RS suggests an
optimized sequence based on the user's feedback. Finally, in
the route review phase, the RS observes the user's progress
and updates the rest of the current route when the user's
plans change spontaneously. For example, when the user
spends more time at a POI, visits additional POIs or skips
suggested steps of the trip, the trip should be updated
accordingly [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ]. Again, interfaces allow the user to select her
or his preferences if, for example, another POI should be
added to the trip. The challenge is to update the route
while considering the already visited POIs and their item
dependencies. Furthermore, the system has to inform the
user if a previously chosen POI cannot be visited during the
trip anymore.
3.3
      </p>
    </sec>
    <sec id="sec-10">
      <title>Evaluations and User Studies</title>
      <p>In this section, we brie y want to outline our planned
experiments and user studies for evaluating our work. This
evaluation will be split in two parts: evaluating the
recommendation algorithms and user studies for the developed
user interfaces. In the end, a bigger, comprehensive study
will be conducted to evaluate the RS as a whole.</p>
      <p>
        A big selection of benchmark instances for the OP and its
variants exist [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ] [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. However, our goal is not to nd exact
solutions for the OP with item dependencies. Instead, our
focus are practical applications. This is why we tackle the
problem with heuristics that provide satisfying solution in a
feasible time. Another problem is that our approaches for
solving the OP with item dependencies can not be compared
to the benchmark instances of other variants. In our
problem, the value of a node is exible and depending on other
nodes in the same path. Hence, the maximum total value of
the trip can di er signi cantly. To tackle the described
challenges, we will develop di erent algorithms considering item
dependencies. Like this, we can compare the algorithms with
each other and identify the most promising approaches. For
a comparison with algorithms solving the TTDP without
item dependencies, we will conduct user studies aiming at
measuring the user satisfaction. We will present tourist trips
created by di erent algorithms and let the user evaluate the
quality of the trip and their satisfaction.
      </p>
      <p>
        The second pillar of our experiments are user studies to
measure the usability of the interfaces that support the user
to create and improve tourist trips and to learn personal item
dependencies. These interfaces will be developed in a
iterative, user-centered approach. We will start with
observations and interviews to elicit user requirements. Paper
prototypes will allow us to evaluate the usability of our drafts
before the actual implementation takes place. Di erent
versions can be compared in A/B testing. The user feedback
will be implemented in further developments of a functional
prototype. To measure usability, established questionnaires
like the System Usability Scale (SUS) can be used [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. This
questionnaire consists of ten questions providing a global
view of subjective assessments of usability. Based on the
responses, a SUS score can be calculated to measure usability
and to compare di erent systems.
      </p>
      <p>In the end, the developed interfaces will be integrated into
a working application which will be evaluated in lab and eld
studies with real users.</p>
    </sec>
    <sec id="sec-11">
      <title>CONCLUSION</title>
      <p>In this paper, we targeted the issue of item dependencies
in tourist trips. We presented a framework that can be used
to iteratively generate and improve recommendations. The
framework represents the starting point of our research in
the eld of sequential recommendations. The goal is to use
it for the development of a real working mobile RS. Hence,
our next step is to examine which existing TTDP algorithms
can be extended to consider the in uence of POIs on other
POIs in a tourist trip. As there are no existing solutions
considering dependencies, we have to develop multiple
algorithms and compare them with regard to quality of the
trips, a feasible runtime and user satisfaction.</p>
      <p>The second key aspect of future work is the development
and evaluation of interfaces facilitating the creation of
pleasant sequences. They should allow the user to express her or
his travel preferences and the application to learn relevant
dependencies between POIs. When the user's plans change
spontaneously, dialogues can support the modi cation of the
trip. These dialogues must not be too distracting or
annoying, especially when the user is moving. Thus, implicit
feedback plays an important role.</p>
      <p>The expected outcome of our research is a sequential RS
that outperforms previous solutions with regard to
attractiveness of the trips and usability of the system. We want
to evaluate our algorithms and the conversational RS in
large user studies in a realistic environment. This is why
we will develop a mobile application for recommending POI
sequences.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>H. M.</given-names>
            <surname>Afsar</surname>
          </string-name>
          and
          <string-name>
            <given-names>N.</given-names>
            <surname>Labadie</surname>
          </string-name>
          .
          <article-title>Team orienteering problem with decreasing pro ts</article-title>
          .
          <source>Electronic Notes in Discrete Mathematics</source>
          ,
          <volume>41</volume>
          :
          <fpage>285</fpage>
          {
          <fpage>293</fpage>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>E.</given-names>
            <surname>Angelelli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Archetti</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M.</given-names>
            <surname>Vindigni</surname>
          </string-name>
          .
          <article-title>The clustered orienteering problem</article-title>
          .
          <source>European Journal of Operational Research</source>
          ,
          <volume>238</volume>
          (
          <issue>2</issue>
          ):
          <volume>404</volume>
          {
          <fpage>414</fpage>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>J.</given-names>
            <surname>Brooke</surname>
          </string-name>
          .
          <article-title>SUS-A quick and dirty usability scale. Usability evaluation in industry</article-title>
          , pages
          <volume>189</volume>
          {
          <fpage>194</fpage>
          ,
          <year>1996</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>I.-M.</given-names>
            <surname>Chao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B. L.</given-names>
            <surname>Golden</surname>
          </string-name>
          , and
          <string-name>
            <given-names>E. A.</given-names>
            <surname>Wasil</surname>
          </string-name>
          .
          <article-title>The team orienteering problem</article-title>
          .
          <source>European journal of operational research</source>
          ,
          <volume>88</volume>
          (
          <issue>3</issue>
          ):
          <volume>464</volume>
          {
          <fpage>474</fpage>
          ,
          <year>1996</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>G.</given-names>
            <surname>Erdogan</surname>
          </string-name>
          and
          <string-name>
            <surname>G. Laporte.</surname>
          </string-name>
          <article-title>The orienteering problem with variable pro ts</article-title>
          .
          <source>Networks</source>
          ,
          <volume>61</volume>
          (
          <issue>2</issue>
          ):
          <volume>104</volume>
          {
          <fpage>116</fpage>
          ,
          <string-name>
            <surname>March</surname>
          </string-name>
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>F. V.</given-names>
            <surname>Fomin</surname>
          </string-name>
          and
          <string-name>
            <given-names>A.</given-names>
            <surname>Lingas</surname>
          </string-name>
          .
          <article-title>Approximation algorithms for time-dependent orienteering</article-title>
          .
          <source>Information Processing Letters</source>
          ,
          <volume>83</volume>
          (
          <issue>2</issue>
          ):
          <volume>57</volume>
          {
          <fpage>62</fpage>
          ,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>A.</given-names>
            <surname>Garcia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Arbelaitz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. T.</given-names>
            <surname>Linaza</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Vansteenwegen</surname>
          </string-name>
          , and
          <string-name>
            <surname>W.</surname>
          </string-name>
          <article-title>Sou riau. Personalized tourist route generation</article-title>
          .
          <source>In Proceedings of the 10th International Conference on Current Trends in Web Engineering</source>
          , ICWE'
          <volume>10</volume>
          , pages
          <fpage>486</fpage>
          {
          <fpage>497</fpage>
          , Berlin, Heidelberg,
          <year>2010</year>
          . Springer-Verlag.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>D.</given-names>
            <surname>Gavalas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Kenteris</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Konstantopoulos</surname>
          </string-name>
          , and
          <string-name>
            <surname>G. Pantziou.</surname>
          </string-name>
          <article-title>Web application for recommending personalised mobile tourist routes</article-title>
          .
          <source>Software, IET</source>
          ,
          <volume>6</volume>
          (
          <issue>4</issue>
          ):
          <volume>313</volume>
          {
          <fpage>322</fpage>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>D.</given-names>
            <surname>Gavalas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Konstantopoulos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Mastakas</surname>
          </string-name>
          , and
          <string-name>
            <given-names>G.</given-names>
            <surname>Pantziou</surname>
          </string-name>
          .
          <article-title>A survey on algorithmic approaches for solving tourist trip design problems</article-title>
          .
          <source>Journal of Heuristics</source>
          ,
          <volume>20</volume>
          (
          <issue>3</issue>
          ):
          <volume>291</volume>
          {
          <fpage>328</fpage>
          ,
          <year>June 2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>Z. W.</given-names>
            <surname>Geem</surname>
          </string-name>
          ,
          <string-name>
            <surname>C.-L. Tseng</surname>
            , and
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Park</surname>
          </string-name>
          .
          <article-title>Harmony search for generalized orienteering problem: best touring in china</article-title>
          . In L.
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <string-name>
            <surname>Chen</surname>
          </string-name>
          , and Y. S. Ong, editors,
          <source>Advances in natural computation</source>
          , pages
          <volume>741</volume>
          {
          <fpage>750</fpage>
          . Springer Berlin Heidelberg, Berlin, Heidelberg,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>A.</given-names>
            <surname>Gunawan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H. C.</given-names>
            <surname>Lau</surname>
          </string-name>
          , and
          <string-name>
            <given-names>P.</given-names>
            <surname>Vansteenwegen</surname>
          </string-name>
          .
          <article-title>Orienteering problem: A survey of recent variants, solution approaches and applications</article-title>
          .
          <source>European Journal of Operational Research</source>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>T.</given-names>
            <surname>Mahmood</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Ricci</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Venturini</surname>
          </string-name>
          .
          <article-title>Improving recommendation e ectiveness: Adapting a dialogue strategy in online travel planning</article-title>
          .
          <source>Information Technology &amp; Tourism</source>
          ,
          <volume>11</volume>
          (
          <issue>4</issue>
          ):
          <volume>285</volume>
          {
          <fpage>302</fpage>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>F.</given-names>
            <surname>Ricci</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Rokach</surname>
          </string-name>
          , and
          <string-name>
            <given-names>B.</given-names>
            <surname>Shapira</surname>
          </string-name>
          .
          <article-title>Recommender systems: Introduction and challenges</article-title>
          .
          <source>In Recommender Systems Handbook</source>
          , pages
          <fpage>1</fpage>
          <lpage>{</lpage>
          34. Springer,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>K.</given-names>
            <surname>Sylejmani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Dorn</surname>
          </string-name>
          , and
          <string-name>
            <given-names>N.</given-names>
            <surname>Musliu</surname>
          </string-name>
          .
          <article-title>A tabu search approach for multi constrained team orienteering problem and its application in touristic trip planning</article-title>
          .
          <source>In Hybrid Intelligent Systems (HIS)</source>
          ,
          <year>2012</year>
          12th International Conference on, pages
          <volume>300</volume>
          {
          <fpage>305</fpage>
          ,
          <string-name>
            <surname>Dec</surname>
          </string-name>
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>T.</given-names>
            <surname>Tsiligirides</surname>
          </string-name>
          .
          <article-title>Heuristic methods applied to orienteering</article-title>
          .
          <source>Journal of the Operational Research Society</source>
          , pages
          <fpage>797</fpage>
          {
          <fpage>809</fpage>
          ,
          <year>1984</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>P.</given-names>
            <surname>Vansteenwegen</surname>
          </string-name>
          , W. Sou riau,
          <string-name>
            <given-names>G. V.</given-names>
            <surname>Berghe</surname>
          </string-name>
          , and
          <string-name>
            <given-names>D. V.</given-names>
            <surname>Oudheusden</surname>
          </string-name>
          .
          <article-title>The city trip planner</article-title>
          .
          <source>Expert Syst. Appl.</source>
          ,
          <volume>38</volume>
          (
          <issue>6</issue>
          ):
          <volume>6540</volume>
          {
          <fpage>6546</fpage>
          ,
          <year>June 2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>P.</given-names>
            <surname>Vansteenwegen</surname>
          </string-name>
          , W. Sou riau, and
          <string-name>
            <surname>D. Van Oudheusden.</surname>
          </string-name>
          <article-title>The orienteering problem: A survey</article-title>
          .
          <source>European Journal of Operational Research</source>
          ,
          <volume>209</volume>
          (
          <issue>1</issue>
          ):1{
          <fpage>10</fpage>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>P.</given-names>
            <surname>Vansteenwegen</surname>
          </string-name>
          , W. Sou riau, G. Vanden Berghe, and
          <string-name>
            <given-names>D. Van</given-names>
            <surname>Oudheusden</surname>
          </string-name>
          .
          <article-title>Iterated local search for the team orienteering problem with time windows</article-title>
          .
          <source>Comput. Oper. Res.</source>
          ,
          <volume>36</volume>
          (
          <issue>12</issue>
          ):
          <volume>3281</volume>
          {
          <fpage>3290</fpage>
          ,
          <string-name>
            <surname>Dec</surname>
          </string-name>
          .
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>P.</given-names>
            <surname>Vansteenwegen</surname>
          </string-name>
          and
          <string-name>
            <surname>D. Van Oudheusden.</surname>
          </string-name>
          <article-title>The mobile tourist guide: an or opportunity</article-title>
          .
          <source>OR Insight</source>
          ,
          <volume>20</volume>
          (
          <issue>3</issue>
          ):
          <volume>21</volume>
          {
          <fpage>27</fpage>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>A.</given-names>
            <surname>Venturini</surname>
          </string-name>
          and
          <string-name>
            <given-names>F.</given-names>
            <surname>Ricci</surname>
          </string-name>
          .
          <article-title>Applying trip@dvice recommendation technology to www.visiteurope.com</article-title>
          .
          <source>In Proceedings of the 2006 Conference on ECAI 2006: 17th European Conference on Arti cial Intelligence August 29 { September 1</source>
          ,
          <year>2006</year>
          ,
          <string-name>
            <given-names>Riva</given-names>
            <surname>Del Garda</surname>
          </string-name>
          , Italy, pages
          <volume>607</volume>
          {
          <fpage>611</fpage>
          , Amsterdam, The Netherlands, The Netherlands,
          <year>2006</year>
          . IOS Press.
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>W.</given-names>
            <surname>Wo</surname>
          </string-name>
          <article-title>rndl and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Hefele</surname>
          </string-name>
          .
          <article-title>Generating paths through discovered places-of-interests for city trip planning</article-title>
          .
          <source>In Information and Communication Technologies in Tourism</source>
          <year>2016</year>
          , pages
          <fpage>441</fpage>
          {
          <fpage>453</fpage>
          . Springer,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>