Skip to main content

New Starting Point of the Continuous Hopfield Network

  • Conference paper
  • First Online:

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 872))

Abstract

In recent years, the continuous Hopfield network has become the most required tool to solve quadratic problems (QP). But, it suffers from some drawbacks, such as, the initial states. This later affect the convergence to the optimal solution and if a bad starting point is arbitrarily specified, the infeasible solution is generated. In this paper, we examine this issue and try to provide a new technique to choose a good starting point in order to give a good optimal solution for any quadratic problems (QP). Numerical simulations are provided to demonstrate the performance of this new technique applied to task assignment problems.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Elloumi, S.: The task assignment problem, a library of instances (2004). http://cedric.cnam.fr/oc/TAP/TAP.html

  2. Ettaouil, M., Loqman, C., Hami, Y., Haddouch, K.: Task assignment problem solved by continuous Hopfield network. IJCSI Int. J. Comput. Sci. Issues 9(2), 206–212 (2012)

    Google Scholar 

  3. Hopfield, J.J., Tank, D.W.: Neural computation of decisions in optimization problems. Biol. Cybern. 52, 1–25 (1985)

    Article  Google Scholar 

  4. Talavàn, P.M., Yànez, J.: A continuous Hopfield network equilibrium points algorithm. Comput. Oper. Res. 32, 2179–2196 (2005)

    Article  MathSciNet  Google Scholar 

  5. Talavàn, P.M., Yànez, J.: The generalized quadratic knapsack problem. A neuronal network approach. Neural Netw. 19, 416–428 (2006)

    Article  Google Scholar 

  6. Wen, U.P., Lan, K.M., Shih, H.S.: A review of Hopfield neural networks for solving mathematical programming problems. Eur. J. Oper. Res. 198, 675–687 (2009)

    Article  MathSciNet  Google Scholar 

  7. Takahashi, Y.: Mathematical improvement of the Hopfield model for TSP feasible solutions by synapse dynamic systems. IEEE Trans. Syst. Man. Cybern. Part B 28, 906–919 (1998)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Khalid Haddouch .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Haddouch, K., El Moutaouakil, K. (2018). New Starting Point of the Continuous Hopfield Network. In: Tabii, Y., Lazaar, M., Al Achhab, M., Enneya, N. (eds) Big Data, Cloud and Applications. BDCA 2018. Communications in Computer and Information Science, vol 872. Springer, Cham. https://doi.org/10.1007/978-3-319-96292-4_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-96292-4_30

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-96291-7

  • Online ISBN: 978-3-319-96292-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics