Paper Info
Title
Cyber-based Intelligent Route Planning with Multi-constraints
Abstract
Nowadays, due to the increasing user requirements of efficient and personalized services, an intelligent route planning is urgently needed. In this paper we propose a cyber-based intelligent route planning with multi-constraints, such as distance, weight, visiting time, personal profiles, etc. Our goal is to provide the intelligent route for users, which passes through as many chosen nodes as possible with the minimum distance and the maximum weight within limited travel time. Finding the intelligent route planning that maximizes users experiences within a given time constraint is an NP-hard problem and previous solutions do not consider these practical and important constraints. In this paper, we prove the NP-hard problem and propose an approximate algorithm to mine intelligent route planning. Finally, we use real datasets in Flickr to evaluate the proposed algorithms.
Year
DOI
Venue
2020
10.1109/DASC-PICom-CBDCom-CyberSciTech49142.2020.00038
2020 IEEE Intl Conf on Dependable, Autonomic and Secure Computing, Intl Conf on Pervasive Intelligence and Computing, Intl Conf on Cloud and Big Data Computing, Intl Conf on Cyber Science and Technology Congress (DASC/PiCom/CBDCom/CyberSciTech)
Keywords
DocType
ISBN
cyber-based,intelligent route planning,multi-constraints,personalized,NP-hard problem
Conference
978-1-7281-6610-0
Citations 
PageRank 
References 
0
0.34
11
Authors
4
Name
Order
Citations
PageRank
Chunjie Zhou17920.11
Ali Li201.69
Zhenxing Zhang3776.07
Zhiwang Zhang48111.15