A Discrete Adaptive Stochastic Neural Model for Constrained Optimization

  • Giuliano Grossi
Conference paper

DOI: 10.1007/11840817_67

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4131)
Cite this paper as:
Grossi G. (2006) A Discrete Adaptive Stochastic Neural Model for Constrained Optimization. In: Kollias S.D., Stafylopatis A., Duch W., Oja E. (eds) Artificial Neural Networks – ICANN 2006. ICANN 2006. Lecture Notes in Computer Science, vol 4131. Springer, Berlin, Heidelberg

Abstract

The ability to map and solve combinatorial optimization problems with constraints on neural networks has frequently motivated a proposal for using such a model of computation.

We introduce a new stochastic neural model, working out for a specific class of constraints, which is able to choose adaptively its weights in order to find solutions into a proper subspace (feasible region) of the search space.

We show its asymptotic convergence properties and give evidence of its ability to find hight quality solution on benchmark and randomly generated instances of a specific problem.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Giuliano Grossi
    • 1
  1. 1.Dipartimento di Scienze dell’InformazioneUniversità degli Studi di MilanoMilanoItaly

Personalised recommendations