A Multiple Cyclic-Route Generation Method with Route Length Constraint Considering Point-of-Interests

Tensei NISHIMURA  Kazuaki ISHIKAWA  Toshinori TAKAYAMA  Masao YANAGISAWA  Nozomu TOGAWA  

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E102-A   No.4   pp.641-653
Publication Date: 2019/04/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E102.A.641
Type of Manuscript: PAPER
Category: Intelligent Transport System
Keyword: 
cyclic-route generation,  the route length constraint,  multiple routes,  Point-of-Interests,  

Full Text: PDF(1.6MB)>>
Buy this Article




Summary: 
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.