Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Swarm Double-Tabu Search

  • Conference paper
Advances in Natural Computation (ICNC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3612))

Included in the following conference series:

  • 2171 Accesses

Abstract

In this work, a new heuristic algorithm, named Swarm Double-Tabu Search (SDTS), has been proposed. SDTS attempts to solve the problems of NP-hard combinatorial optimization effectively and efficiently. The particle swarm and the double-tabu strategies adopted in the SDTS algorithm have got excellent search result. Simulations on Traveling Salesman Problem (TSP) were performed, and the results compared to those obtained by neural network approaches were optimal or near optimal.

Supported by Natural Science Fund (cstc-2004bb2083) of Chongqing and the Key Science & Technology Commission of Ministry of Education(104262).

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 119.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks, Piscataway, NJ, Perth, Australia, vol. IV, pp. 1942–1948 (1995)

    Google Scholar 

  2. de Castro, L.N.: Immune, Swarm, and Evolutionary Algorithms. In: Proceedings of the 9th International Conference on Neural Information Processing, Piscataway, NJ, Singapore, vol. 3, pp. 1464–1473 (2002)

    Google Scholar 

  3. Glover, F., Laguna, M.: Tabu search. Kluwer Academic Publishers, Boston (1997)

    MATH  Google Scholar 

  4. Tang, H., Tan, K.C., Yi, Z.: A columnar competitive model for solving combinatorial optimization problems. IEEE Transactions on Neural Networks 15(6), 1568–1574 (2004)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Electronic & Information Engineering, Southwest China Normal University, Chongqing, 400715, People’s Republic of China

    Wanhui Wen & Guangyuan Liu

Authors
  1. Wanhui Wen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Guangyuan Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Electrical and Electronic Engineering, Nanyang Technological University, Block S1, Nanyang Avenue, 639798, Singapore

    Lipo Wang

  2. School of Software, Sun Yat-Sen University, 510275, Guangzhou, China

    Ke Chen

  3. School of Computer Engineering, Nanyang Technological University, BLK N4, 2b-39, Nanyang Avenue, 639798, Singapore

    Yew Soon Ong

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wen, W., Liu, G. (2005). Swarm Double-Tabu Search. In: Wang, L., Chen, K., Ong, Y.S. (eds) Advances in Natural Computation. ICNC 2005. Lecture Notes in Computer Science, vol 3612. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11539902_156

Download citation

  • DOI: https://doi.org/10.1007/11539902_156

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28320-1

  • Online ISBN: 978-3-540-31863-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation