Dynamic generating algorithm on path selection and optimisation in travel planning
by Lanhua Zhang; Hua Ma; Jing Sun; Wuli Song; Peng Zheng; Shaowei Xue
International Journal of Computer Applications in Technology (IJCAT), Vol. 48, No. 3, 2013

Abstract: In order to provide efficient path selecting solution in complex and dynamic transport path selections on travel planning, we put forward a new network generating algorithm to change the dynamic travel planning requirement to static network graph on basis of the complex system theory. By the detailed constructing demonstrations of the algorithm and complex network topology characters applications, path selecting and optimising solution gave new methods for traveller to make plan on travel by their requirements. Theoretical analysis and experimental simulation imply that it is feasible for travellers to make path selection and optimisation with complex network characters statistics and analysis by the dynamic generating algorithm.

Online publication date: Tue, 01-Oct-2013

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computer Applications in Technology (IJCAT):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com