The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Com a disseminação dos aplicativos de mapas, a geração de rotas tornou-se uma função familiar. A maioria dos métodos de geração de rotas busca uma rota de um ponto de partida até um ponto de destino com o menor tempo ou menor comprimento, mas recentemente a geração de rotas mais agradável tem sido focada. Particularmente, a geração de rotas cíclicas para passear requer sugerir ao usuário mais de uma rota passando por vários POIs (Pontos de Interesse), para satisfazer ao máximo as preferências do usuário. Neste artigo, propomos um método de geração de múltiplas rotas cíclicas com uma restrição de comprimento de rota considerando POIs. Em primeiro lugar, o nosso método proposto descobre um conjunto de pontos de referência com base na restrição de comprimento da rota. Em segundo lugar, procuramos uma rota não cíclica de um ponto de referência para o próximo e finalmente geramos uma rota cíclica conectando essas rotas não cíclicas. Comparado com os métodos anteriores, nosso método proposto gera uma rota cíclica mais próxima da restrição de comprimento da rota, reduz o número dos mesmos pontos que passam em aproximadamente 80% e aumenta o número de POIs passados em aproximadamente 1.49 vezes.
Tensei NISHIMURA
Waseda University
Kazuaki ISHIKAWA
Zenrin DataCom Co., LTD.
Toshinori TAKAYAMA
Zenrin DataCom Co., LTD.
Masao YANAGISAWA
Waseda University
Nozomu TOGAWA
Waseda University
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
Tensei NISHIMURA, Kazuaki ISHIKAWA, Toshinori TAKAYAMA, Masao YANAGISAWA, Nozomu TOGAWA, "A Multiple Cyclic-Route Generation Method with Route Length Constraint Considering Point-of-Interests" in IEICE TRANSACTIONS on Fundamentals,
vol. E102-A, no. 4, pp. 641-653, April 2019, doi: 10.1587/transfun.E102.A.641.
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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E102.A.641/_p
Copiar
@ARTICLE{e102-a_4_641,
author={Tensei NISHIMURA, Kazuaki ISHIKAWA, Toshinori TAKAYAMA, Masao YANAGISAWA, Nozomu TOGAWA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Multiple Cyclic-Route Generation Method with Route Length Constraint Considering Point-of-Interests},
year={2019},
volume={E102-A},
number={4},
pages={641-653},
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={},
doi={10.1587/transfun.E102.A.641},
ISSN={1745-1337},
month={April},}
Copiar
TY - JOUR
TI - A Multiple Cyclic-Route Generation Method with Route Length Constraint Considering Point-of-Interests
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 641
EP - 653
AU - Tensei NISHIMURA
AU - Kazuaki ISHIKAWA
AU - Toshinori TAKAYAMA
AU - Masao YANAGISAWA
AU - Nozomu TOGAWA
PY - 2019
DO - 10.1587/transfun.E102.A.641
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E102-A
IS - 4
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - April 2019
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.
ER -