Skip to main content
SpringerLink
Log in

Competition based neural networks for assignment problems

  • Regular Papers
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

Competition based neural networks have been used to solve the generalized assignment problem and the quadratic assignment problem. Both problems are very difficult and are ε approximation complete. The neural network approach has yielded highly competitive performance and good performance for the quadratic assignment problem. These neural networks are guaranteed to produce feasible solutions.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. S. Abe, Theories on the Hopfield Neural Networks Int. Joint Conf. Neural Network, Vol.1 (June 1989) Washington D. C., 557–564.

    Article  Google Scholar 

  2. P. Bourret, S. Goodall and M. Samuelides, Optimal Scheduling by Competitive Activation: Application to the Satellite Antennae Scheduling Problem. Int, Joint Conf. Neural Networks, Vol.1 (June 1989) Washington D. C., 565–572.

    Article  Google Scholar 

  3. M. Cohen and S. Grossberg, Absolute stability of global pattern formation and parallel memory storage by competitive neural networks.IEEE Trans. Systems, Man and Cybernetics., SMC-13 (Sep./Oct. 1983), 815–826.

    MATH  MathSciNet  Google Scholar 

  4. L-Y. Fang, Design of Computational Neural Networks. Ph. D. thesis submitted to the Flinders University of South Australia, March 1990.

  5. J. J. Hopfield, Neural networks and physical systems with emergent collective computational abilities. Proc. Natl. Acad. Sci. USA, Vol.79 (April 1982), 2553–2558.

    Article  MathSciNet  Google Scholar 

  6. J. J. Hopfield, Neurons with graded response have collective computational properties like those of two-state neurons. Proc. Natl. Acad. Sci. USA, Vol.81 (May 1984), 3088–3092.

    Article  Google Scholar 

  7. J. J. Hopfield and D. W. Tank, ‘Neural’, computation of decisions in optimization problems.Biological Cybernetics,52 (1985), 141–152.

    MATH  MathSciNet  Google Scholar 

  8. J. J. Hopfield and D. W. Tank, Computing with neural circuits: A model.Science,233: 4767 (Aug. 1986) 625–633.

    Article  Google Scholar 

  9. Sahni, S. and Gonzalez, T., P-Complete approximation problems.Journal of the Association for Computing Machinery,23: 3 (1976), 555–565.

    MATH  MathSciNet  Google Scholar 

  10. A. B. Kahng, Traveling Salesman Heuristics and Embedding Dimension in the Hopfield Model, Int. Joint Conf. Neural Networks, Vol.1 (June 1989) Washington D.C. 513–520.

    Article  Google Scholar 

  11. Y. Peng, A Connectionist Solution for Vertex Cover Problems. Int. Joint Conf. Neural Networks, Vol.2, (June 1989) Washington D. C., 590.

    Article  Google Scholar 

  12. Y. Peng and J. Reggia, A connectionist model for diagnostic problem solving.IEEE Trans. Syst. Man and Cybernetics, SMC-19 (1989).

  13. C. Peterson and J. R. Anderson, Neural Networks and NP-Complete Optimization Problems: A Performance Study on the Graph Bisection Problem. Complex Systems2 (1988), 59.

    MATH  MathSciNet  Google Scholar 

  14. C. Peterson and B. Soderberg, A new method for mapping optimization problems onto neural networks.Int. Journal of Neural Systems,1: 1 (1989), 3–22.

    Article  Google Scholar 

  15. J. Reggia, Methods for deriving competitive activation mechanisms. Int Joint Conf. Neural Networks, (June 1989) Washington D. C., 357–363.

  16. J. Reggia and G. Sutton, Self-Processing Networks and Their Biomedical Implications. Proc. of IEEE, Vol.76 (1988) 680–692.

    Article  Google Scholar 

  17. D. W. Tank and J. J. Hopfield, Simple ‘Neural’ optimization networks: An A/D converter, signal decision circuit, and a linear programming circuit.IEEE Transactions on Circuit Systems, CAS-33 (May 1986), 533–541.

    Article  Google Scholar 

  18. P. Wang, S. Seidman and J. Reggia, Analysis of competition-based spreading activation in connectionist models.Int. J. Man-Machine Studies,28 (1988), 77–97.

    Article  Google Scholar 

  19. G. V. Wilson and G. S. Pawley, On the Stability of the Traveling Salesman Problem Algorithm of Hopfield and Tank.Biological Cybernetics,58 (1988), 63–70.

    Article  MATH  MathSciNet  Google Scholar 

  20. D. E. Van den Bout and T. K. Miller, Graph Partitioning Using Annealed Neural Networks. Int. Joint Conf. Neural Networks, Vol.1 (June 1989) Washington D. C., 521–528.

    Article  Google Scholar 

  21. T. Li and L-Y Fang, Parallel approximate solution of 0/1 knapsack optimization on competitive neural network. to appear inAdvances in Parallel Computing, Vol. 3, 1990, North-Holland.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Monash University, 3168, Clayton, VIC, Australia

    Li Tao

  2. Department of Computer Science, Flinders University of South Australia, 5042, Bedford Park, S.A., Australia

    Luyuan Fang

Authors
  1. Li Tao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Luyuan Fang
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Li, T., Fang, L. Competition based neural networks for assignment problems. J. of Comput. Sci. & Technol. 6, 305–315 (1991). https://doi.org/10.1007/BF02948390

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02948390

Keywords

Search

Navigation