A multiple cyclic-route generation method with route length constraint considering point-of-interests

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

Research output: Contribution to journalArticle

Abstract

With the spread of map applications, route generation has become a familiar function. Most of route generation methods search a route from a starting point to a destination point with the shortest time or shortest length, 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 with a route length constraint considering 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 approximately 80%, and increases the number of POIs passed approximately 1.49 times.

Original languageEnglish
Pages (from-to)641-653
Number of pages13
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE102A
Issue number4
DOIs
Publication statusPublished - 2019 Apr 1

Fingerprint

Reference Point
User Preferences
Search Methods

Keywords

  • Cyclic-route generation
  • Multiple routes
  • Point-of-Interests
  • The route length constraint

ASJC Scopus subject areas

  • Signal Processing
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering
  • Applied Mathematics

Cite this

A multiple cyclic-route generation method with route length constraint considering point-of-interests. / Nishimura, Tensei; Ishikawa, Kazuaki; Takayama, Toshinori; Yanagisawa, Masao; Togawa, Nozomu.

In: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E102A, No. 4, 01.04.2019, p. 641-653.

Research output: Contribution to journalArticle

@article{e1878839065c4fc19c22eb25c1056d31,
title = "A multiple cyclic-route generation method with route length constraint considering point-of-interests",
abstract = "With the spread of map applications, route generation has become a familiar function. Most of route generation methods search a route from a starting point to a destination point with the shortest time or shortest length, 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 with a route length constraint considering 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 approximately 80{\%}, and increases the number of POIs passed approximately 1.49 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 = "2019",
month = "4",
day = "1",
doi = "10.1587/transfun.E102.A.641",
language = "English",
volume = "E102A",
pages = "641--653",
journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",
issn = "0916-8508",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "4",

}

TY - JOUR

T1 - A multiple cyclic-route generation method with route length constraint considering point-of-interests

AU - Nishimura, Tensei

AU - Ishikawa, Kazuaki

AU - Takayama, Toshinori

AU - Yanagisawa, Masao

AU - Togawa, Nozomu

PY - 2019/4/1

Y1 - 2019/4/1

N2 - With the spread of map applications, route generation has become a familiar function. Most of route generation methods search a route from a starting point to a destination point with the shortest time or shortest length, 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 with a route length constraint considering 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 approximately 80%, and increases the number of POIs passed approximately 1.49 times.

AB - With the spread of map applications, route generation has become a familiar function. Most of route generation methods search a route from a starting point to a destination point with the shortest time or shortest length, 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 with a route length constraint considering 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 approximately 80%, and increases the number of POIs passed approximately 1.49 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=85064009774&partnerID=8YFLogxK

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

U2 - 10.1587/transfun.E102.A.641

DO - 10.1587/transfun.E102.A.641

M3 - Article

VL - E102A

SP - 641

EP - 653

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

SN - 0916-8508

IS - 4

ER -