Skip to main content

The Charged System Search Algorithm for Adaptive Node Moving Refinement in Discrete Least-Squares Meshless Method

  • Chapter
  • First Online:
Metaheuristic Optimization Algorithms in Civil Engineering: New Applications

Part of the book series: Studies in Computational Intelligence ((SCI,volume 900))

  • 537 Accesses

Abstract

Discrete Least Squares Meshless (DLSM) method has been used for the solution of different problems ranging from solid to fluid mechanics problems. In the DLSM method, the locations of discretization points are random. Therefore, the error of the initial solution is rather high. In this chapter, an adaptive node moving refinement in the DLSM method is presented using the Charged System Search (CSS) for optimum analysis of elasticity problems. The CSS Physics inspired algorithm is effectively utilized to obtain suitable locations of the nodes. To demonstrate the effectiveness of the proposed method, some benchmark examples with available analytical solutions are used. The results show an excellent performance of the CSS for adaptive refinement in the meshless method.

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

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. Firoozjaee, A. R., & Afshar, M. H. (2009). Discrete least squares meshless method with sampling points for the solution of elliptic partial differential equations. Engineering Analysis with Boundary Elements, 33(1), 83–92. https://doi.org/10.1016/j.enganabound.2008.03.004.

    Article  MathSciNet  MATH  Google Scholar 

  2. Arzani, H., Kaveh, A., & Dehghan, M. (2014). Adaptive node moving refinement in discrete least squares meshless method using charged system search. Scientia Iranica, 21(5), 1529–1538.

    Google Scholar 

  3. Kaveh, A., & Talatahari, S. (2010). A novel heuristic optimization method: Charged system search. Acta Mechanica, 213(3), 267–289. https://doi.org/10.1007/s00707-009-0270-4.

    Article  MATH  Google Scholar 

  4. Kaveh, A., & Talatahari, S. (2009). Particle swarm optimizer, ant colony strategy and harmony search scheme hybridized for optimization of truss structures. Computers & Structures, 87(5), 267–283. https://doi.org/10.1016/j.compstruc.2009.01.003.

    Article  Google Scholar 

  5. Kaveh, A. (2013). Optimal analysis of structures by concepts of symmetry and regularity. Wien: Springer.

    Book  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ali Kaveh .

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Kaveh, A., Dadras Eslamlou, A. (2020). The Charged System Search Algorithm for Adaptive Node Moving Refinement in Discrete Least-Squares Meshless Method. In: Metaheuristic Optimization Algorithms in Civil Engineering: New Applications. Studies in Computational Intelligence, vol 900. Springer, Cham. https://doi.org/10.1007/978-3-030-45473-9_7

Download citation

Publish with us

Policies and ethics