Skip to main content

Quantification-Based Ant Colony System for TSP

  • Conference paper
Genetic and Evolutionary Computing

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

Abstract

Ant Colony Optimization (ACO) is one of the swarm intelligent methods for solving computational problems, especially in finding the optimal paths through graphs. In the past, floating point is widely used to represent the pheromone in ACO, thus requiring large amounts of memory to find the optimal solutions. In this paper, the quantification-based ACS (QACS) is thus proposed to reduce the space complexity. New updating rules of pheromone with no decay parameters are also designed in the proposed QACS for simplifying the updating processing of pheromone. Based on the experimental results of proposed QACS, the convergence rate can be improved with less memory space for solving Traveling Salesman Problem (TSP).

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Colorni, A., Dorigo, M., Maniezzo, V.: Distributed optimization by ant colonies. In: Proceedings of the European Conference on Artificial Life, Paris, France, pp. 134–142 (1991)

    Google Scholar 

  2. Bullnheimer, B., Hartl, R., Strauss, C.: An Improved Ant System Algorithm for the Vehicle Routing Problem. Annals of Operations Research 89, 319–328 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bullnheimer, B., Hartl, R., Strauss, C.: A new rank-based version of the ant system: a computational study. Central European Journal for Operations Research and Economics 7(1), 25–38 (1999)

    MathSciNet  MATH  Google Scholar 

  4. Nezamabadi-pour, H., Rashedi, S.: Edge detection using ant algorithms. Soft Computing 10(7), 623–628 (2006)

    Article  Google Scholar 

  5. Yan, H., Shen, X.Q., Li, X., Wu, M.H.: An improved ant algorithm for job scheduling in grid computing. Machine Learning and Cybernetics, 2957–2961 (2005)

    Google Scholar 

  6. http://elib.zib.de/pub/mp-testdata/tsp/tsplib/tsplib.html

  7. Zhang, J., Chen, W.-N., Zhong, J.-H., Tan, X., Li, Y.: Continuous Function Optimization Using Hybrid Ant Colony Approach with Orthogonal Design Scheme. In: Wang, T.-D., Li, X., Chen, S.-H., Wang, X., Abbass, H.A., Iba, H., Chen, G.-L., Yao, X. (eds.) SEAL 2006. LNCS, vol. 4247, pp. 126–133. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  8. Abbaspour, K.C., Schulin, R., Van Genuchten, M.T.: Estimating unsaturated soil hydraulic parameters using ant colony optimization. Advances In Water Resources 24(8), 827–841 (2001)

    Article  Google Scholar 

  9. Wang, L., Wu, Q.D.: Linear system parameters identification based on ant system algorithm. In: Proceedings of the IEEE Conference on Control Applications, Mexico, pp. 401–406 (2001)

    Google Scholar 

  10. Dorigo, M.: Optimization, learning, and natural algorithms. Ph.D. Thesis, Dip. Elettronica, Politecnico di Milano, Italy (1992)

    Google Scholar 

  11. Dorigo, M., Luca Gambardella, M.: Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation 1(1), 53–66 (1997)

    Article  Google Scholar 

  12. Dorigo, M., Stutzle, T.: Ant colony optimization. The MIT Press, London (2004)

    Book  MATH  Google Scholar 

  13. Dorigo, M., Maniezzo, V.: Ant system for job-shop scheduling. Belgian Journal of Operations Research, Statistics and Computer Science 34, 39–53 (1994)

    MATH  Google Scholar 

  14. Luca Gambardella, M., Dorigo, M.: Ant-Q: A Reinforcement Learning approach to the traveling salesman problem. In: Proceedings of the International Conference on Machine Learning, Tahoe, California, pp. 252–260 (1995)

    Google Scholar 

  15. Luca Gambardella, M., Taillard, E., Agazzi, G.: A multiple ant system for vehicle routing problem with time windows. New Ideas on Optimization, 285–296 (1999)

    Google Scholar 

  16. David, P., Matthieu, C., Arnaud, R.: Image Retrieval over Networks: Active Learning using Ant Algorithm. IEEE Transactions on Multimedia 10(7), 1356–1365 (2008)

    Article  Google Scholar 

  17. Stützle, T., Hoosb, H.: MAX–MIN Ant System and Local search for the traveling salesman problem. In: Proceedings of the IEEE International Conference on Evolutionary Computation, Pistcataway, USA, pp. 309–314 (1997)

    Google Scholar 

  18. Stützle, T., Hoosb, H.: MAX–MIN Ant System. Future Generation Computer Systems 16(8), 927–935 (2000)

    Article  Google Scholar 

  19. Hu, X.M., Zhang, J., Xiao, J., Li, Y.: Protein Folding in Hydrophobic-Polar Lattice Model: A Flexible Ant-Colony Optimization Approach. Protein and Peptide Letters 15(5), 469–477 (2008)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ming Zhao .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Zhao, M., Pan, JS., Lin, CW., Yan, L. (2014). Quantification-Based Ant Colony System for TSP. In: Pan, JS., Krömer, P., Snášel, V. (eds) Genetic and Evolutionary Computing. Advances in Intelligent Systems and Computing, vol 238. Springer, Cham. https://doi.org/10.1007/978-3-319-01796-9_36

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-01796-9_36

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-01795-2

  • Online ISBN: 978-3-319-01796-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics