A multiple cyclic-route generation method for strolling based on point-of-interests

Tensei Nishimura, Kazuaki Ishikawa, Toshinori Takayama, Masao Yanagisawa, Nozomu Togawa

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    1 Citation (Scopus)

    Abstract

    With the spread of map applications, route generation has become a familiar function. Most of route generation methods search a rapidly movable route to a destination, but more enjoyable route generation is recently focused on. Particularly, cyclic-route generation for strolling requires to suggest to a user more than one route passing through several POIs (Point-of-Interests), to satisfy the user's preferences as much as possible. In this paper, we propose a multiple cyclic-route generation method for strolling based on POIs. Firstly, our proposed method finds out a set of reference points based on the route length constraint. Secondly, we search a non-cyclic route from one reference point to the next one and finally generate a cyclic route by connecting these non-cyclic routes. Compared with previous methods, our proposed method generates a cyclic route closer to the route length constraint, reduces the number of the same points passing through by more than 80%, and increases the number of passing through POIs to approximately 1.24 times.

    Original languageEnglish
    Title of host publication2018 IEEE 8th International Conference on Consumer Electronics - Berlin, ICCE-Berlin 2018
    PublisherIEEE Computer Society
    Volume2018-September
    ISBN (Electronic)9781538660959
    DOIs
    Publication statusPublished - 2018 Dec 13
    Event8th IEEE International Conference on Consumer Electronics - Berlin, ICCE-Berlin 2018 - Berlin, Germany
    Duration: 2018 Sep 22018 Sep 5

    Other

    Other8th IEEE International Conference on Consumer Electronics - Berlin, ICCE-Berlin 2018
    CountryGermany
    CityBerlin
    Period18/9/218/9/5

    Keywords

    • cyclic-route generation
    • multiple routes
    • Point-of-Interests
    • the route length constraint

    ASJC Scopus subject areas

    • Electrical and Electronic Engineering
    • Industrial and Manufacturing Engineering
    • Media Technology

    Cite this

    Nishimura, T., Ishikawa, K., Takayama, T., Yanagisawa, M., & Togawa, N. (2018). A multiple cyclic-route generation method for strolling based on point-of-interests. In 2018 IEEE 8th International Conference on Consumer Electronics - Berlin, ICCE-Berlin 2018 (Vol. 2018-September). [8576185] IEEE Computer Society. https://doi.org/10.1109/ICCE-Berlin.2018.8576185

    A multiple cyclic-route generation method for strolling based on point-of-interests. / Nishimura, Tensei; Ishikawa, Kazuaki; Takayama, Toshinori; Yanagisawa, Masao; Togawa, Nozomu.

    2018 IEEE 8th International Conference on Consumer Electronics - Berlin, ICCE-Berlin 2018. Vol. 2018-September IEEE Computer Society, 2018. 8576185.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Nishimura, T, Ishikawa, K, Takayama, T, Yanagisawa, M & Togawa, N 2018, A multiple cyclic-route generation method for strolling based on point-of-interests. in 2018 IEEE 8th International Conference on Consumer Electronics - Berlin, ICCE-Berlin 2018. vol. 2018-September, 8576185, IEEE Computer Society, 8th IEEE International Conference on Consumer Electronics - Berlin, ICCE-Berlin 2018, Berlin, Germany, 18/9/2. https://doi.org/10.1109/ICCE-Berlin.2018.8576185
    Nishimura T, Ishikawa K, Takayama T, Yanagisawa M, Togawa N. A multiple cyclic-route generation method for strolling based on point-of-interests. In 2018 IEEE 8th International Conference on Consumer Electronics - Berlin, ICCE-Berlin 2018. Vol. 2018-September. IEEE Computer Society. 2018. 8576185 https://doi.org/10.1109/ICCE-Berlin.2018.8576185
    Nishimura, Tensei ; Ishikawa, Kazuaki ; Takayama, Toshinori ; Yanagisawa, Masao ; Togawa, Nozomu. / A multiple cyclic-route generation method for strolling based on point-of-interests. 2018 IEEE 8th International Conference on Consumer Electronics - Berlin, ICCE-Berlin 2018. Vol. 2018-September IEEE Computer Society, 2018.
    @inproceedings{291fa83116cf4860994c0666b83f1268,
    title = "A multiple cyclic-route generation method for strolling based on point-of-interests",
    abstract = "With the spread of map applications, route generation has become a familiar function. Most of route generation methods search a rapidly movable route to a destination, but more enjoyable route generation is recently focused on. Particularly, cyclic-route generation for strolling requires to suggest to a user more than one route passing through several POIs (Point-of-Interests), to satisfy the user's preferences as much as possible. In this paper, we propose a multiple cyclic-route generation method for strolling based on POIs. Firstly, our proposed method finds out a set of reference points based on the route length constraint. Secondly, we search a non-cyclic route from one reference point to the next one and finally generate a cyclic route by connecting these non-cyclic routes. Compared with previous methods, our proposed method generates a cyclic route closer to the route length constraint, reduces the number of the same points passing through by more than 80{\%}, and increases the number of passing through POIs to approximately 1.24 times.",
    keywords = "cyclic-route generation, multiple routes, Point-of-Interests, the route length constraint",
    author = "Tensei Nishimura and Kazuaki Ishikawa and Toshinori Takayama and Masao Yanagisawa and Nozomu Togawa",
    year = "2018",
    month = "12",
    day = "13",
    doi = "10.1109/ICCE-Berlin.2018.8576185",
    language = "English",
    volume = "2018-September",
    booktitle = "2018 IEEE 8th International Conference on Consumer Electronics - Berlin, ICCE-Berlin 2018",
    publisher = "IEEE Computer Society",

    }

    TY - GEN

    T1 - A multiple cyclic-route generation method for strolling based on point-of-interests

    AU - Nishimura, Tensei

    AU - Ishikawa, Kazuaki

    AU - Takayama, Toshinori

    AU - Yanagisawa, Masao

    AU - Togawa, Nozomu

    PY - 2018/12/13

    Y1 - 2018/12/13

    N2 - With the spread of map applications, route generation has become a familiar function. Most of route generation methods search a rapidly movable route to a destination, but more enjoyable route generation is recently focused on. Particularly, cyclic-route generation for strolling requires to suggest to a user more than one route passing through several POIs (Point-of-Interests), to satisfy the user's preferences as much as possible. In this paper, we propose a multiple cyclic-route generation method for strolling based on POIs. Firstly, our proposed method finds out a set of reference points based on the route length constraint. Secondly, we search a non-cyclic route from one reference point to the next one and finally generate a cyclic route by connecting these non-cyclic routes. Compared with previous methods, our proposed method generates a cyclic route closer to the route length constraint, reduces the number of the same points passing through by more than 80%, and increases the number of passing through POIs to approximately 1.24 times.

    AB - With the spread of map applications, route generation has become a familiar function. Most of route generation methods search a rapidly movable route to a destination, but more enjoyable route generation is recently focused on. Particularly, cyclic-route generation for strolling requires to suggest to a user more than one route passing through several POIs (Point-of-Interests), to satisfy the user's preferences as much as possible. In this paper, we propose a multiple cyclic-route generation method for strolling based on POIs. Firstly, our proposed method finds out a set of reference points based on the route length constraint. Secondly, we search a non-cyclic route from one reference point to the next one and finally generate a cyclic route by connecting these non-cyclic routes. Compared with previous methods, our proposed method generates a cyclic route closer to the route length constraint, reduces the number of the same points passing through by more than 80%, and increases the number of passing through POIs to approximately 1.24 times.

    KW - cyclic-route generation

    KW - multiple routes

    KW - Point-of-Interests

    KW - the route length constraint

    UR - http://www.scopus.com/inward/record.url?scp=85060312946&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=85060312946&partnerID=8YFLogxK

    U2 - 10.1109/ICCE-Berlin.2018.8576185

    DO - 10.1109/ICCE-Berlin.2018.8576185

    M3 - Conference contribution

    AN - SCOPUS:85060312946

    VL - 2018-September

    BT - 2018 IEEE 8th International Conference on Consumer Electronics - Berlin, ICCE-Berlin 2018

    PB - IEEE Computer Society

    ER -