The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

lars gislen

Lars Gislén

Retired, affiliated researcher

lars gislen

Teachers and Classes with Neural Networks

Author

  • 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.

Department/s

  • Computational Biology and Biological Physics - Has been reorganised

Publishing year

1989

Language

English

Pages

167-176

Publication/Series

International Journal of Neural Systems

Volume

1

Issue

2

Document type

Journal article

Publisher

World Scientific Publishing

Topic

  • Computer and Information Science

Status

Published

ISBN/ISSN/Other

  • ISSN: 0129-0657