Skip to main content
SpringerLink
Log in

Modeling and Algorithm of Optimal Traveling Route

  • Conference paper
  • First Online:
Proceedings of the 2012 International Conference on Cybernetics and Informatics

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 163))

  • 172 Accesses

Abstract

It is important to design the optimal travel route for the traveler. In this paper, based the on Google Earth, the undirected graph of Tangshan tourist sites are established, optimal traveling rout are explored by Prim algorithm and improved Prim algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 429.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 549.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Jorgen Bang-Jensen, Gregory Gutin (2001) Digraphs: theory algorithms and applications. Springer 34:181–189

    Google Scholar 

  2. Seth Pettie, Vijaya Ramachandran (2002) An optimal minimum spanning tree algorithm. J Assoc Comput Mach 49(1):16–34

    Article  MathSciNet  Google Scholar 

  3. Fredman ML, Willard DE (1994) Trans-dichotomous algorithms for minimum spanning trees and shortest paths. J Comput Syst Sci 48(3):533–551

    Article  MATH  MathSciNet  Google Scholar 

  4. Cherition D, Tarjan RE (1976) Finding minimum spanning trees. SIAM J Comput 5:724–741

    Article  MathSciNet  Google Scholar 

  5. Cormen TH, Leiserson CE, Rivest RL, Stein C (2009) Introduction to algorithms, 3rd edn. MIT Press. ISBN 0-262-03384-4. Section 23.2: The algorithms of Kruskal and Prim 20:631–638

    Google Scholar 

Download references

Acknowledgements

This work was supported by grants from The National Natural Science Foundation of China (No. 30971611 and 31100913) and Research project of science and technology for higher education institutions in Hebei Province of China (No. Z2011126 and No. SZ2011158) and the Startup Foundation for Docotors of Hebei Polytechnic University (No.35377601).

Author information

Authors and Affiliations

  1. College of Science, Heibei United University, Tangshan, 063009, China

    Yanmei Yang, Jianyong Di & Feifei Li

Authors
  1. Yanmei Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jianyong Di
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Feifei Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yanmei Yang .

Editor information

Editors and Affiliations

  1. College of Elementary Education, Chongqing Normal University, Chongqing, People's Republic of China

    Shaobo Zhong

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer Science+Business Media New York

About this paper

Cite this paper

Yang, Y., Di, J., Li, F. (2014). Modeling and Algorithm of Optimal Traveling Route. In: Zhong, S. (eds) Proceedings of the 2012 International Conference on Cybernetics and Informatics. Lecture Notes in Electrical Engineering, vol 163. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-3872-4_217

Download citation

  • DOI: https://doi.org/10.1007/978-1-4614-3872-4_217

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4614-3871-7

  • Online ISBN: 978-1-4614-3872-4

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation