IDEAS home Printed from https://ideas.repec.org/a/spr/opsear/v61y2024i3d10.1007_s12597-024-00746-4.html
   My bibliography  Save this article

Optimizing hyperparameters in Hopfield neural networks using evolutionary search

Author

Listed:
  • Safae Rbihou

    (Sidi Mohamed Ben Abdellah University)

  • Khalid Haddouch

    (Sidi Mohamed Ben Abdellah University)

  • Karim El moutaouakil

    (Sidi Mohamed Ben Abdellah University of Fez)

Abstract

The major problem facing users of Hopfield neural networks is the automatic choice of hyperparameters depending on the optimisation problem. This work introduces an automatic method to overcome this problem based on an original mathematical model minimizing the energy function. This methods ensures the feasibility of optimal solution obtained by decomposing the set of the feasible solutions. We illustrate the proposed model in the context of six well-known NP-hard problems: meeting scheduling problem, Kohonen network problem, portfolio selection problem, traveling salesman problem, task assignment problem, and max-stable problem. To show the effectiveness of our model, we use particle swarm and genetic algorithms to solve several instances of the last three problems. Numerical results show the good performance of the proposed approach compared to random tuning hyperparameters methods. Indeed, our approach permits an improvement of 49.75% for traveling salesman problem, 5.92% for task assignment problem, and 29.41% for max-stable problem.

Suggested Citation

  • Safae Rbihou & Khalid Haddouch & Karim El moutaouakil, 2024. "Optimizing hyperparameters in Hopfield neural networks using evolutionary search," OPSEARCH, Springer;Operational Research Society of India, vol. 61(3), pages 1245-1273, September.
    • Handle: RePEc:spr:opsear:v:61:y:2024:i:3:d:10.1007_s12597-024-00746-4
    DOI: 10.1007/s12597-024-00746-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12597-024-00746-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s12597-024-00746-4?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:opsear:v:61:y:2024:i:3:d:10.1007_s12597-024-00746-4. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.