A modified ant colony algorithm to solve the shortest path problem

@article{Yuan2014AMA,
  title={A modified ant colony algorithm to solve the shortest path problem},
  author={Yabo Yuan and Yi Liu and Bin Wu},
  journal={Proceedings of 2014 International Conference on Cloud Computing and Internet of Things},
  year={2014},
  pages={148-151}
}
To solve the problem that the ant colony algorithm is easy to fall into local optimal solutions in solving the shortest path problem, improvements on the classical ant colony algorithm are provided in three aspects. Firstly, direction guiding is utilized in the initial pheromone concentration to speed up the initial convergence; secondly, the idea of pheromone redistribution is added to the pheromone partial renewal process in order to prevent the optimal path pheromone concentration from being… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-3 of 3 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 12 references

Improved Ant Algorithm to Solve Shortest Path Problem[J

  • W UHu-fa, L IXue-jun, Z. Yu-long
  • Computer Simulation,
  • 2012
1 Excerpt

Shortest path approximate algorithm for complex network analysis[J

  • J TTang, T Wang, J. Wang
  • Ruanjian Xuebao/Journal of Software,
  • 2011
1 Excerpt

Similar Papers

Loading similar papers…