Skip to main content
SpringerLink
Log in

Approach to Find Shortest Path Using Ant Colony Algorithm

  • Conference paper
  • First Online:
Intelligent Communication, Control and Devices

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 624))

Abstract

This paper deals with Ant Colony Optimization (ACO). Our approach is to compare the run-time and accuracy of existing techniques using Ant Colony Optimization to find the shortest path. Here, we are going to study how to locate the shortest path using Dijkstra’s, Bellman–Ford and Kruskal’s algorithms, and comparisons will be done among all the algorithms. Ant lays pheromone on the path it travelled to identify the shortest path from its nest to the food source. We will also be studying what are the uses of implementing ACO algorithm on a XILINX ZYNQ-7000 PSoC (Programmable System on Chip) instead of implementing it on Arduino or Raspberry Pi.

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

Access this chapter

Log in via an institution

Institutional subscriptions

References

  1. Marco Dorigo, Thomas Stutzle, Ant Colony Optimization, ISBN 0-262- 04219-3, 2004

    Google Scholar 

  2. Michael Herrmann, Natural Computing, Lecture 10: Ant Colony Optimisation, 2010

    Google Scholar 

  3. V. S. Bagad, I. A. Dhotre, Topic-Shortest Path Algorithm, Dijkstra’s Algorithm, Page No.-4-13, 1–14, June 2012

    Google Scholar 

  4. V. S. Bagad, I. A. Dhotre, Topic-Shortest Path Algorithm, Bellman-Ford’s Algorithm, Page No.-4-16, 1–17, June 2012

    Google Scholar 

  5. An approach to parallelize Kruskal’s algorithm using Helper Threads, Anastasios Katsigiannis, Nikos Anastopoulos, Konstantinos Nikas, and Nectarios Koziris

    Google Scholar 

  6. SoPC-Based Parallel ACO Algorithm and its application to Optimal Motion Controller Design for Intelligent Omnidirectional Mobile Robots, Hsu-Chih Huang Member, IEEE

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of ECE, BVRIT-N, Hyderabad, Telangana, India

    Mudasar Basha & Vemulapalli Sai Pranav

  2. Department of ECE, K L University, Vijayawada, AP, India

    M. Siva Kumar

  3. Department of Electronics, Instrumentation & Control Engineering, University of Petroleum & Energy Studies, Dehradun, Uttarakhand, India

    B. Khaleelu Rehman

Authors
  1. Mudasar Basha
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Siva Kumar
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Vemulapalli Sai Pranav
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. B. Khaleelu Rehman
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mudasar Basha .

Editor information

Editors and Affiliations

  1. Institute of Robotics Technology (R&D), University of Petroleum and Energy Studies, Dehradun, Uttarakhand, India

    Rajesh Singh

  2. Department of Electronics & Instrumentation Engineering, University of Petroleum and Energy Studies, Dehradun, Uttarakhand, India

    Sushabhan Choudhury

  3. Department of Electronics & Instrumentation Engineering, University of Petroleum and Energy Studies, Dehradun, Uttarakhand, India

    Anita Gehlot

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Basha, M., Siva Kumar, M., Pranav, V.S., Rehman, B.K. (2018). Approach to Find Shortest Path Using Ant Colony Algorithm. In: Singh, R., Choudhury, S., Gehlot, A. (eds) Intelligent Communication, Control and Devices. Advances in Intelligent Systems and Computing, vol 624. Springer, Singapore. https://doi.org/10.1007/978-981-10-5903-2_130

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-5903-2_130

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-5902-5

  • Online ISBN: 978-981-10-5903-2

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation