Skip to main content

Using Long and Short Term Memories in Solving Optimization Problems

  • Conference paper
Neural Information Processing (ICONIP 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5864))

Included in the following conference series:

Abstract

In this paper, we propose an optimization method which is based on the Lagrangian method. Experimental results show that the search can effectively find the feasible solutions. We also introduce long and short term memories to the Lagrangian method. There are several possible ways of integrating the long and short term memories. We examine some of basic ways of integration in the experiments, and decide the effective one. When we use this effective way of integration, we can improve the efficiency of the Lagrangian method furthermore.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Glover, F.: Tabu Search Part I. ORSA Journal on Computing 1(3), 109–206 (1989)

    Google Scholar 

  2. Glover, F.: Tabu Search Part II. ORSA Journal on Computing 2(1), 4–32 (1990)

    MATH  Google Scholar 

  3. Voudouris, C.: Guided Local Search for Combinatorial Optimization Problems. PhD Thesis, Department of Computer Science, University of Essex, Colchester, UK (1997)

    Google Scholar 

  4. Nagamatu, M., Yanaru, T.: Solving SAT by Lagrange Programming Neural Network with Long and Short Term Memories. In: Kawaguchi, E., et al. (eds.) Information Modeling and Knowledge Bases XI, pp. 289–301. IOS Press, Amsterdam (2000)

    Google Scholar 

  5. Nagamatu, M.: Controlling the Diversive and Specific Exploration in Solving Disjunctive Linear Constraint Satisfaction Problem. International Journal of Biomedical Soft Computing and Human Sciences 13(2), 35–41 (2008)

    Google Scholar 

  6. Nakano, T., Nagamatu, M.: A Continuous Valued Neural Network with a New Evaluation Function of Degree of Unsatisfaction for Solving CSP. IEICE Transactions on Information and Systems E89-D(4), 1555–1562 (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nagamatu, M., Weerasinghe, J. (2009). Using Long and Short Term Memories in Solving Optimization Problems. In: Leung, C.S., Lee, M., Chan, J.H. (eds) Neural Information Processing. ICONIP 2009. Lecture Notes in Computer Science, vol 5864. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10684-2_51

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-10684-2_51

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-10682-8

  • Online ISBN: 978-3-642-10684-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics