Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

Default user image.

Carsten Peterson

Expert

Default user image.

Teachers and Classes with Neural Networks

Författare

  • Lars Gislén
  • Carsten Peterson
  • Bo Söderberg

Summary, in English

A convenient mapping and an efficient algorithm for solving scheduling problems within the neural network paradigm is presented. It is based on a reduced encoding scheme and a mean field annealing prescription which was recently successfully applied to TSP.

Most scheduling problems are characterized by a set of hard and soft constraints. The prime target of this work is the hard constraints. In this domain the algorithm persistently finds legal solutions for quite difficult problems. We also make some exploratory investigations by adding soft constraints with very encouraging results. Our numerical studies cover problem sizes up to O(105) degrees of freedom with no parameter tuning.

We stress the importance of adding self-coupling terms to the energy functions which are redundant from the encoding point of view but beneficial when it comes to ignoring local minima and to stabilizing the good solutions in the annealing process.

Avdelning/ar

  • Computational Biology and Biological Physics

Publiceringsår

1989

Språk

Engelska

Sidor

167-176

Publikation/Tidskrift/Serie

International Journal of Neural Systems

Volym

1

Issue

2

Dokumenttyp

Artikel i tidskrift

Förlag

World Scientific Publishing

Ämne

  • Computer and Information Science

Aktiv

Published

ISBN/ISSN/Övrigt

  • ISSN: 0129-0657