ROUTE RECOMMENDATION BASED ON LOCAL USERS’ TRAJECTORIES

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

SHUROUNI ROYA; MALEK MOHAMMAD REZA

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: ENGINEERING JOURNAL OF GEOSPATIAL INFORMATION TECHNOLOGY Year:2017 | Volume:4 | Issue:4 Page(s): 53-67

Download Full-Text

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Persian Verion

View:

553

Download:

Cites:

Information Journal Paper

Title

ROUTE RECOMMENDATION BASED ON LOCAL USERS’ TRAJECTORIES

Author(s)

SHUROUNI ROYA | MALEK MOHAMMAD REZA | Issue Writer Certificate

Keywords

RECOMMENDATION SYSTEMQ2

ROUTE PLANNINGQ2

TRAJECTORY COLLECTIONQ2

RANKINGQ2

Abstract

Large amount of users’ trajectories, is an emerging source of inexpensive data that can be used to provide an opportunity to present route recommendation service to the unfamiliar users within the area. In this study, with the aim of finding the optimal route, we first extract both local users and local road segments data sets by RANKING them via HITS algorithm. In this model, a hub is a user who many time has crossed many road segments of a region, and an authority is a road segment that has been crossed by many users. Therefore, users’ travel experiences (hub scores) and the interests of road segments (authority scores) have a mutual reinforcement relation. We also propose a novel approach in which the basic unit of routing is separate road segment instead of GPS trajectory segment. Moreover, to provide the approximate routing, we create a local graph. The center of the local road segments are considered as nodes and are based on local streets sequence arrange the pieces obtained from the trajectory of the user as edges of local graph. According to this graph, two steps of routing are used to obtain the optimal path. Then using Dijkstra's algorithm on the main road network and obtained an approximate route, shortest route between two local road segments based on this graph is used to obtain the optimal route. To implement and test, used data, from the trajectories of moving users in Tehran, has been gathered for 3 months on daily basis. To evaluate performance of the two-step routing, we experimentally compared the travel time in proposed routeto Dijkstra’s shortest path for different lengths and users with different levels of regional knowledge. The travel time in the proposed method was decreased 60 percent compare to shortest route.

Cites

No record.

References

No record.

Cite

APA: Copy

SHUROUNI, ROYA, & MALEK, MOHAMMAD REZA. (2017). ROUTE RECOMMENDATION BASED ON LOCAL USERS’ TRAJECTORIES. ENGINEERING JOURNAL OF GEOSPATIAL INFORMATION TECHNOLOGY, 4(4), 53-67. SID. https://sid.ir/paper/230093/en

Vancouver: Copy

SHUROUNI ROYA, MALEK MOHAMMAD REZA. ROUTE RECOMMENDATION BASED ON LOCAL USERS’ TRAJECTORIES. ENGINEERING JOURNAL OF GEOSPATIAL INFORMATION TECHNOLOGY[Internet]. 2017;4(4):53-67. Available from: https://sid.ir/paper/230093/en

IEEE: Copy

ROYA SHUROUNI, and MOHAMMAD REZA MALEK, “ROUTE RECOMMENDATION BASED ON LOCAL USERS’ TRAJECTORIES,” ENGINEERING JOURNAL OF GEOSPATIAL INFORMATION TECHNOLOGY, vol. 4, no. 4, pp. 53–67, 2017, [Online]. Available: https://sid.ir/paper/230093/en

Related Journal Papers