Skip to main content
SpringerLink
Log in

Neural Meta-Memes Framework for Combinatorial Optimization

  • Conference paper
Swarm, Evolutionary, and Memetic Computing (SEMCCO 2010)

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

Included in the following conference series:

Abstract

In this paper, we present a Neural Meta-Memes Framework (NMMF) for combinatorial optimization. NMMF is a framework which models basic optimization algorithms as memes and manages them dynamically when solving combinatorial problems. NMMF encompasses neural networks which serve as the overall planner/coordinator to balance the workload between memes. We show the efficacy of the proposed NMMF through empirical study on a class of combinatorial problem, the quadratic assignment problem (QAP).

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 119.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 159.00
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. Burkard, R.E., Karisch, S.E., Rendl, F.: QAPLB A quadratic assignment problem i-brary. Journal of Global Optimization 10, 391–403 (1997), http://www.opt.math.tu-graz.ac.at/qaplib/ , http://qaplib.uwaterloo.ca/inst.html

    Article  MATH  Google Scholar 

  2. Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proc. of the IEEE Int. Conf. on Neural Networks, Piscataway, NJ, pp. 1942–1948 (1995)

    Google Scholar 

  3. Koopmans, T.C., Beckmann, M.J.: Assignment problems and the location of economic activities. Econometrica 25, 53–76 (1957)

    Article  MathSciNet  MATH  Google Scholar 

  4. Laursen, P.S.: Simulated annealing for the QAP—Optimal tradeoff between simulation time and solution quality. European Journal of Operational Research 69, 238–243 (1993)

    Article  Google Scholar 

  5. Lim, M.H., Yuan, Y., Omatu, S.: Efficient genetic algorithms using simple genes ex-change local search policy for the quadratic assignment problem. Computational Optimization and Applications 15, 249–268 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  6. Lim, M.H., Yuan, Y., Omatu, S.: Extensive testing of a hybrid genetic algorithm for qua-dratic assignment problem. Computational Optimization and Applications 23, 47–64 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  7. Lim, M.H., Gustafson, S., Krasnogor, N., Ong, Y.S.: Editorial to the first issue. Memetic Computing 1, 1–2 (2009)

    Article  Google Scholar 

  8. Meuth, R., Lim, M.H., Ong, Y.S., Wunsh, D.C.: A proposition on memes and meta-memes in computing for higher-order learning. Memetic Computing 1(2), 85–100 (2009)

    Article  Google Scholar 

  9. Taillard, E.D.: Robust taboo search for the quadratic assignment problem. Parallel Compu-ting 17, 443–455 (1991)

    Article  MathSciNet  Google Scholar 

  10. Tang, J., Lim, M.H., Ong, Y.S., Er, M.J.: Parallel memetic algorithm with selective local search for large scale quadratic assignment problems. Int’l Journal of Innovative Computing, Information and Control 2(6), 1399–1416 (2006)

    Google Scholar 

  11. Stützle, T.: Iterated local search for the quadratic assignment problem. European Journal of Operational Research 174(3), 1519–1539 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  12. Song, L.Q., Lim, M.H., Suganthan, P.N.: Ensemble of optimization algorithms for solv-ing quadratic assignment problems. International Journal of Innovative Computing, Information and Control 6(9) (2010)

    Google Scholar 

  13. Vollmann, T.E., Buffa, E.S.: The facilities layout problem in perspective. Management Science 12(10), 450–468 (1966)

    Article  Google Scholar 

  14. Wolpert, D.H., Macready, W.G.: No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation 1(1), 67–82 (1997)

    Article  Google Scholar 

  15. Werbos, P.J.: Beyond regression: New tools for prediction and analysis in the behavioural sciences, Ph.D. Thesis, Harvard University, Cambridge, MA (1974)

    Google Scholar 

  16. Rumelhart, D.E., Hinton, G.E., Williams, R.J.: Learning internal representation by error propagation. In: Parallel Distributed Processing: Exploration in the Microstructure of Cognition, vol. 1, ch. 8. MIT Press, Cambridge (1986)

    Google Scholar 

  17. Brierley, P.: Appendix A in Some practical applications of neural networks in the electricity industry, Eng. D. Thesis, Cranfield University, UK (1998)

    Google Scholar 

  18. Brierley, P., Batty, B.: Data mining with neural networks - an applied example in understanding electricity consumption patterns. Knowledge Discovery and Data Mining ch. 12, 240–303 (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Electrical & Electronic Engineering, Nanyang Technological University, Singapore, 639798

    Li Qin Song & Meng Hiot Lim

  2. School of Computer Engineering, Nanyang Technological University, Singapore, 639798

    Yew Soon Ong

Authors
  1. Li Qin Song
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Meng Hiot Lim
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yew Soon Ong
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering, Indian Institute of Technology, New Delhi, India

    Bijaya Ketan Panigrahi

  2. Department of Electronics and Communication Engineering, Jadavpur University, 700032, Kolkata, West Bengal, India

    Swagatam Das

  3. School of Electrical and Electronic Engineering, Nanyang Technological University, 639798, Singapore

    Ponnuthurai Nagaratnam Suganthan

  4. Department of Electrical and Electronics Engineering, SRM University, Chennai, Tamil Nadu, India

    Subhransu Sekhar Dash

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Song, L.Q., Lim, M.H., Ong, Y.S. (2010). Neural Meta-Memes Framework for Combinatorial Optimization. In: Panigrahi, B.K., Das, S., Suganthan, P.N., Dash, S.S. (eds) Swarm, Evolutionary, and Memetic Computing. SEMCCO 2010. Lecture Notes in Computer Science, vol 6466. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17563-3_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-17563-3_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-17562-6

  • Online ISBN: 978-3-642-17563-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation