<!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>International Workshop on Process Management in the AI Era, August</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Utilizing Language Models for Tour Itinerary Recommendation</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Ngai Lam Ho</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Kwan Hui Lim</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Information Systems Technology and Design Pillar, Singapore University of Technology and Design</institution>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2022</year>
      </pub-date>
      <volume>29</volume>
      <issue>2023</issue>
      <fpage>0000</fpage>
      <lpage>0003</lpage>
      <abstract>
        <p>Tour itinerary recommendation involves planning a sequence of relevant Point-of-Interest (POIs), which combines challenges from the fields of both Operations Research (OR) and Recommendation Systems (RS). As an OR problem, there is the need to maximize a certain utility (e.g., popularity of POIs in the tour) while adhering to some constraints (e.g., maximum time for the tour). As a RS problem, it is heavily related to problem or filtering or ranking a subset of POIs that are relevant to a user and recommending it as part of an itinerary. In this paper, we explore the use of language models for the task of tour itinerary recommendation and planning. This task has the unique requirement of recommending personalized POIs relevant to users and planning these POIs as an itinerary that satisfies various constraints. We discuss some approaches in this area, such as using word embedding techniques like Word2Vec and GloVe for learning POI embeddings and transformer-based techniques like BERT for generating itineraries.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Tour Recommendation</kwd>
        <kwd>Itinerary Planning</kwd>
        <kwd>Language Models</kwd>
        <kwd>Natural Language Processing</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        The tour itinerary recommendation is a popular and challenging problem, with significant
impact for tourism and other domains such as transportation and logistics [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. The tour itinerary
recommendation problem has garnered immense interest in both academia and industry. This
problem contains both aspects of an recommendation problem as well as a planning problem.
From the recommendation perspective, there are elements of top-K item recommendation and
learning to rank, where we aim to recommend a subset of most relevant POIs to a user in the form
of an itinerary. From the operation research perspective, it is akin to a constrained optimization
problem, where we need to maximize the utility that a user obtains from the planned itinerary
while ensuring that the itinerary adheres to certain time and location constraints.
      </p>
      <p>In this paper, we discuss the tour itinerary recommendation problem from both perspectives
of a recommendation and operation research problem, particularly on how recent advances on
natural language processing have advanced research in this area. In particular, we discuss how
language models have been adapted for the task of tour itinerary recommendation such as how
word embedding techniques like Word2Vec and GloVe are used for POI representation learning
and transformer-based models like BERT are used for next POI and itinerary recommendation.
Figure 1 provides an overview of potential applications of such a framework.</p>
      <sec id="sec-1-1">
        <title>POIs</title>
      </sec>
      <sec id="sec-1-2">
        <title>Sentence 1</title>
      </sec>
      <sec id="sec-1-3">
        <title>Itinerary 1</title>
      </sec>
      <sec id="sec-1-4">
        <title>Sentence 2</title>
      </sec>
      <sec id="sec-1-5">
        <title>Itinerary 2</title>
        <p>I
are
having</p>
        <p>dinner Input
am
feeling
hungry</p>
        <p>Input
(a)
Let’s
watch
a
movie</p>
        <p>Continuous</p>
        <p>Bag-of-Words
Word Embedding / Skip-gram</p>
        <p>Models
(e.g., Word2Vec)</p>
        <p>Transformerbased Models
(e.g., BERT)
(b)</p>
        <p>Masked
Language
Model
Next
Sentence
Prediction</p>
        <p>POI Embeddings</p>
        <p>Iterative POI
Recommendation</p>
        <p>
          Next Itinerary
Recommendation
(c)
2. Tour Itinerary Recommendation Problem
There are various variants of the tour itinerary recommendation and a popular formulation is
based on the Orienteering problem [
          <xref ref-type="bibr" rid="ref2 ref3">2, 3</xref>
          ], which we briefly discuss.
        </p>
        <p>Given a set of POIs  , our main objective is to plan for a tour itinerary  = (1, ...,  ) that:
 
  ∑︁ ∑︁ , ()
 
(1)
where , = 1 is the itinerary includes a travelling path from POI  to  , and , = 0
otherwise. () is the utility score that a user  benefits from based on this tour itinerary  .</p>
        <p>
          Variants of this problem difer in various aspects, mainly in terms of the definition of the
utility score used and the types of constraints being implemented. For example, the utility
score is typically a global score such as POI popularity for the OR community, while a more
personalized interest or relevance score is used for the RS community. Similarly, the two
communities might difer in terms of the type and range of constraints from simple ones such
as having a fixed number of POIs in a tour itinerary to more diverse constraints such as the
need to start/end the tour itinerary at specific locations, complete the tour itinerary within
specific time limits or budget constraints, and other unique considerations.
3. Language Models and Tour Recommendation
Natural Language Processing (NLP) and particularly large language models have seen rapid
progress in recent years with developments ranging from word embedding techniques like
Word2Vec [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ] and GloVe [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ] to the more recent foundation models like BERT [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ], GPT [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ] and
their variants.
        </p>
        <p>Word embedding techniques aim to find appropriate dense vector representation at the word
level, by using techniques such as the Continuous Bag of Words and Skip-gram Models that are
used in Word2Vec. Both model uses a simple neural network with a single hidden layer and
difer in terms of the task. Continuous Bag of Words is used to predict a single target word given
the context of its neighbouring words, where Skip-gram does the opposite and tries to predict
the neighbouring words that surround a given input word. Thereafter, the weights learned by
the hidden layer are used as the word embedding for the specific word, where the number of
neurons/nodes in the hidden layer corresponds to the dimension size of the word embedding.</p>
        <p>Foundation models like BERT and GPT utilizes the transformer architecture with self-attention
and are now commonly used for many downstream NLP tasks from standard text classification
to text generation. Models like BERT and its variants uses a self-supervised approach to training
and typically use the Mask Language Modelling and Next Sentence Prediction tasks on top of
the Transformer architecture. Given a sentence, the Mask Language Modelling task involves
hiding a subset of words in the sentence and training the model to predict those words. For
Next Sentence Prediction, it is to predict the following sentence given the earlier sentence.</p>
        <p>
          POI Embedding Models. Word embedding models have increasingly been used for
generating POI embedding. To adapt language models for POI representation learning, the set of POIs
in a city can be treated as the vocabulary of words where each POI is akin to an individual word
or token. Similar to sentences in NLP, past itineraries or sequences of POI visits are used as a
proxy of sentences made up of a series of words. Thereafter, models such as Continuous Bag
of Words and Skip-gram are used to learn the vector representation of POIs. Similar models
and variants that are adapted for learning latent attributes relating to geographic and temporal
factors have been proposed in recent years [
          <xref ref-type="bibr" rid="ref10 ref8 ref9">8, 9, 10</xref>
          ].
        </p>
        <p>
          Transformer-based Models. More recently, Transformer-based models have gained
popularity for not just NLP tasks but increasingly for various types of next POI prediction and
tour itinerary recommendation tasks. Similarly, past itineraries comprising sequences of POI
visits can be modelled in the same context as sentences that are made up of a series of words.
For example, [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ] used the BERT model trained on past POI visit sequences, coupled with an
iterative process for generating intermediate POIs for recommending tour itineraries. Others
like [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ] have used Transformers for the POI recommendation problem with joint training on
the task of next POI prediction and queuing time prediction. More generally, Transformer-based
architectures have seen numerous applications for various sequence-related recommendation
tasks [
          <xref ref-type="bibr" rid="ref13 ref14 ref15">13, 14, 15</xref>
          ].
        </p>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>4. Conclusion</title>
      <p>In this paper, we discussed the problem of tour itinerary recommendation and highlighted its
relation to both fields of OR and RS in its consideration of trip constraints and user-relevant
recommendation. Following which, we provided an overview of popular techniques used in a
variety of NLP tasks and discussed how these NLP techniques, such as word embedding and
Transformers, have been adapted to the tour itinerary recommendation task.
Acknowledgments. This research is funded in part by the Singapore University of Technology
and Design under grant RS-MEFAI-00005-R0201.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>K. H.</given-names>
            <surname>Lim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Chan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Karunasekera</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Leckie</surname>
          </string-name>
          ,
          <article-title>Tour recommendation and trip planning using location-based social media: A survey</article-title>
          ,
          <source>Knowledge and Information Systems</source>
          <volume>60</volume>
          (
          <year>2019</year>
          )
          <fpage>1247</fpage>
          -
          <lpage>1275</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>B. L.</given-names>
            <surname>Golden</surname>
          </string-name>
          ,
          <string-name>
            <surname>L. Levy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Vohra</surname>
          </string-name>
          ,
          <article-title>The orienteering problem</article-title>
          ,
          <source>Naval Research Logistics (NRL) 34</source>
          (
          <year>1987</year>
          )
          <fpage>307</fpage>
          -
          <lpage>318</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <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>
          ,
          <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>
          <volume>255</volume>
          (
          <year>2016</year>
          )
          <fpage>315</fpage>
          -
          <lpage>332</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>T.</given-names>
            <surname>Mikolov</surname>
          </string-name>
          , I. Sutskever,
          <string-name>
            <given-names>K.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. S.</given-names>
            <surname>Corrado</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Dean</surname>
          </string-name>
          ,
          <article-title>Distributed representations of words and phrases and their compositionality</article-title>
          ,
          <source>Proceedings of NeurIPS'13</source>
          <volume>26</volume>
          (
          <year>2013</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>J.</given-names>
            <surname>Pennington</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Socher</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. D.</given-names>
            <surname>Manning</surname>
          </string-name>
          , Glove:
          <article-title>Global vectors for word representation</article-title>
          ,
          <source>in: Proceedings of EMNLP'14</source>
          ,
          <year>2014</year>
          , pp.
          <fpage>1532</fpage>
          -
          <lpage>1543</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>J.</given-names>
            <surname>Devlin</surname>
          </string-name>
          , M.-
          <string-name>
            <given-names>W.</given-names>
            <surname>Chang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Toutanova</surname>
          </string-name>
          , Bert:
          <article-title>Pre-training of deep bidirectional transformers for language understanding</article-title>
          ,
          <source>in: Proceedings of NAACL'19</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>4171</fpage>
          -
          <lpage>4186</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>T.</given-names>
            <surname>Brown</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Mann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Ryder</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Subbiah</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. D.</given-names>
            <surname>Kaplan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Dhariwal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Neelakantan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Shyam</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Sastry</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Askell</surname>
          </string-name>
          , et al.,
          <article-title>Language models are few-shot learners</article-title>
          ,
          <source>Proceedings of NeurIPS'20</source>
          <volume>33</volume>
          (
          <year>2020</year>
          )
          <fpage>1877</fpage>
          -
          <lpage>1901</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>S.</given-names>
            <surname>Feng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Cong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>An</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y. M.</given-names>
            <surname>Chee</surname>
          </string-name>
          ,
          <article-title>Poi2vec: Geographical latent representation for predicting future visitors</article-title>
          ,
          <source>in: Proceedings of AAAI'17</source>
          , volume
          <volume>31</volume>
          ,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>B.</given-names>
            <surname>Chang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Park</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Park</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Kim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Kang</surname>
          </string-name>
          ,
          <article-title>Content-aware hierarchical point-of-interest embedding model for successive poi recommendation</article-title>
          .,
          <source>in: Proceedings of IJCAI'18</source>
          , volume
          <year>2018</year>
          ,
          <year>2018</year>
          , p.
          <fpage>27th</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>N. L.</given-names>
            <surname>Ho</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K. H.</given-names>
            <surname>Lim</surname>
          </string-name>
          ,
          <article-title>User preferential tour recommendation based on poi-embedding methods</article-title>
          ,
          <source>in: Proceedings of IUI'21 Companion</source>
          ,
          <year>2021</year>
          , pp.
          <fpage>46</fpage>
          -
          <lpage>48</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>N. L.</given-names>
            <surname>Ho</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K. H.</given-names>
            <surname>Lim</surname>
          </string-name>
          ,
          <article-title>Poibert: A transformer-based model for the tour recommendation problem</article-title>
          ,
          <source>Proceedings of BigData'22</source>
          (
          <year>2022</year>
          )
          <fpage>5925</fpage>
          -
          <lpage>5933</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>S.</given-names>
            <surname>Halder</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K. H.</given-names>
            <surname>Lim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Chan</surname>
          </string-name>
          ,
          <string-name>
            <surname>X. Zhang,</surname>
          </string-name>
          <article-title>Poi recommendation with queuing time and user interest awareness</article-title>
          ,
          <source>Data Mining and Knowledge Discovery</source>
          <volume>36</volume>
          (
          <year>2022</year>
          )
          <fpage>2379</fpage>
          -
          <lpage>2409</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>F.</given-names>
            <surname>Sun</surname>
          </string-name>
          , J. Liu,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Pei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Ou</surname>
          </string-name>
          , P. Jiang,
          <article-title>Bert4rec: Sequential recommendation with bidirectional encoder representations from transformer</article-title>
          ,
          <source>in: Proceedings of CIKM'19</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>1441</fpage>
          -
          <lpage>1450</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>L.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.-J.</given-names>
            <surname>Hsieh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Sharpnack</surname>
          </string-name>
          , Sse-pt:
          <article-title>Sequential recommendation via personalized transformer</article-title>
          ,
          <source>in: Proceedings of RecSys'20</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>328</fpage>
          -
          <lpage>337</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>Q.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Huang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Ou</surname>
          </string-name>
          ,
          <article-title>Behavior sequence transformer for e-commerce recommendation in alibaba</article-title>
          ,
          <source>in: Proceedings of the 1st International Workshop on Deep Learning Practice for High-Dimensional Sparse Data</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>4</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>