Skip to main content

2017 | OriginalPaper | Buchkapitel

Research on the Shortest Path of Two Places in Urban Based on Improved Ant Colony Algorithm

verfasst von : Yanjuan Hu, Luquan Ren, Hongwei Zhao, Yao Wang

Erschienen in: Challenges and Opportunity with Big Data

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Based on the GIS electronic map and traffic control information database, a shortest path algorithm based on GIS technology is proposed, the A and B geographic information of the monitoring points are extracted, and the shortest path algorithm is used to solve the shortest path between A and B. Using the improved ant colony algorithm to calculate the shortest distance from the start node to the target node. In view of the phenomenon of ant colony algorithm convergence speed is slow and easy to fall into premature defects, and the effective measures for improvement was put forward, and take the simplifying road network as an example, a simulation of the algorithm was conducted. The satisfactory results of the simulation verify the effectiveness of the algorithm.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat He, M., Liang, W., Chen, G., Chen, Q.: Topology of mobile underwater wireless sensor networks. Control Decis. 28(12), 1761–1770 (2013) He, M., Liang, W., Chen, G., Chen, Q.: Topology of mobile underwater wireless sensor networks. Control Decis. 28(12), 1761–1770 (2013)
2.
Zurück zum Zitat Cai, W., Zhao, H., Wang, J., Lin, C.: A unifying network topological model of the energy internet macro-scope structure. Proc. CSEE 35(14), 3503–3510 (2015) Cai, W., Zhao, H., Wang, J., Lin, C.: A unifying network topological model of the energy internet macro-scope structure. Proc. CSEE 35(14), 3503–3510 (2015)
3.
Zurück zum Zitat Wang, S., Xing, J., Zhang, Y., Bai, B.: Ellipse-based shortest path algorithm for typical urban road networks. Syst. Eng. Theory Prac. 31(6), 1158–1164 (2011) Wang, S., Xing, J., Zhang, Y., Bai, B.: Ellipse-based shortest path algorithm for typical urban road networks. Syst. Eng. Theory Prac. 31(6), 1158–1164 (2011)
4.
Zurück zum Zitat Bi, F.: Application of the Optimal Path Planning in the Supervision of Land Enforcement System. China University of Mining and Technology (2014) Bi, F.: Application of the Optimal Path Planning in the Supervision of Land Enforcement System. China University of Mining and Technology (2014)
5.
Zurück zum Zitat Lu, F., Lu, D., Cui, W.: Time shortest path algorithm for restricted searching area in transportation networks. J. Image Graph. 4(10), 849–853 (1999) Lu, F., Lu, D., Cui, W.: Time shortest path algorithm for restricted searching area in transportation networks. J. Image Graph. 4(10), 849–853 (1999)
6.
Zurück zum Zitat Manish, M., Vimal, B.: A low-complexity hybrid algorithm based on particle swarm and ant colony optimization for large-MIMO detection. Exp. Syst. Appl. 50, 66–74 (2016)CrossRef Manish, M., Vimal, B.: A low-complexity hybrid algorithm based on particle swarm and ant colony optimization for large-MIMO detection. Exp. Syst. Appl. 50, 66–74 (2016)CrossRef
7.
Zurück zum Zitat Li, Q., Zhang, C., Chen, P., Yin, Y.: Improved ant colony optimization algorithm based on particle swarm optimization. Control Decis. 28(6), 873–883 (2013)MATH Li, Q., Zhang, C., Chen, P., Yin, Y.: Improved ant colony optimization algorithm based on particle swarm optimization. Control Decis. 28(6), 873–883 (2013)MATH
8.
Zurück zum Zitat Song, D., Zhang, J.: Batch scheduling problem of hybrid flow shop based on ant colony algorithm. Comput. Integr. Manuf. Syst. 19(7), 1640–1647 (2013) Song, D., Zhang, J.: Batch scheduling problem of hybrid flow shop based on ant colony algorithm. Comput. Integr. Manuf. Syst. 19(7), 1640–1647 (2013)
9.
Zurück zum Zitat Zhang, J., Zhang, P., Liu, G.: Two-stage ant colony algorithm based job shop scheduling with unrelated parallel machines. J. Mech. Eng. 49(6), 136–144 (2013)CrossRef Zhang, J., Zhang, P., Liu, G.: Two-stage ant colony algorithm based job shop scheduling with unrelated parallel machines. J. Mech. Eng. 49(6), 136–144 (2013)CrossRef
10.
Zurück zum Zitat Enxiu, S., Minmin, C., Jun, L., Yumei, H.: Research on method of global path-planning for mobile robot based on ant-colony algorithm. Trans. Chin. Soc. Agric. Mach. 45(6), 53–57 (2014) Enxiu, S., Minmin, C., Jun, L., Yumei, H.: Research on method of global path-planning for mobile robot based on ant-colony algorithm. Trans. Chin. Soc. Agric. Mach. 45(6), 53–57 (2014)
Metadaten
Titel
Research on the Shortest Path of Two Places in Urban Based on Improved Ant Colony Algorithm
verfasst von
Yanjuan Hu
Luquan Ren
Hongwei Zhao
Yao Wang
Copyright-Jahr
2017
DOI
https://doi.org/10.1007/978-3-319-61994-1_13