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
N1 - Funding Information:
This work was supported in part by JST CREST Grant Number JPMJCR18K5, Japan.
Publisher Copyright:
Copyright © 2019 The Institute of Electronics, Information and Communication Engineers.
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
AN - SCOPUS:85064009774
SN - 0916-8508
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
IS - 4
ER -