Cyber-based Intelligent Route Planning with Multi-constraints

摘要

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.