Skip to main content
SpringerLink
Log in

Analysis of a Parallel MOEA Solving the Multi-objective Quadratic Assignment Problem

  • Conference paper
Genetic and Evolutionary Computation – GECCO 2004 (GECCO 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3103))

Included in the following conference series:

Abstract

The Quadratic Assignment Problem (QAP) is an NP-Complete problem [1]. The multiobjective Quadratic Assignment Problem (mQAP) is the multiobjective version of the QAP and was formalized in 2002 [2]. The QAP has had extensive research, but mQAP research is still in its infancy. The mQAP has been been used to optimize communication for formations of heterogenous unmanned aerial vehicles (UAVs) through the use of the Multi-Objective Messy Genetic Algorithm – II (MOMGA-II) [3]. This research extends that research by using a parallelized version of MOMGA-II and comparing the speedup and efficiency of the parallel results to the serial results.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

References

  1. Çela, E.: The Quadratic Assignment Problem - Theory and Algorithms. Kluwer Academic Publishers, Boston (1998)

    MATH  Google Scholar 

  2. Knowles, J., Corne, D.: Instance generators and test suites for the multiobjective quadratic assignment problem. In: Fonseca, C.M., Fleming, P.J., Zitzler, E., Deb, K., Thiele, L. (eds.) EMO 2003. LNCS, vol. 2632, pp. 295–310. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  3. Day, R.O., Kleeman, M.P., Lamont, G.B.: Solving the Multi-objective Quadratic Assignment Problem Using a fast messy Genetic Algorithm. In: Congress on Evolutionary Computation (CEC 2003), Piscataway, New Jersey, IEEE Service Center, vol. 4, pp. 2277–2283 (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Air Force Institute of Technology, Dept of Electrical and Computer Engineering, Graduate School of Engineering & Management, Wright-Patterson AFB (Dayton), OH, 45433, USA

    Mark P. Kleeman, Richard O. Day & Gary B. Lamont

Authors
  1. Mark P. Kleeman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Richard O. Day
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Gary B. Lamont
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Indian Institute of Technology Kanpur, Department of Mechanical Engineering, Kanpur Genetic Algorithms Laboratory (KanGAL), Kanpur, 208016, Uttar Pradesh, India

    Kalyanmoy Deb

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kleeman, M.P., Day, R.O., Lamont, G.B. (2004). Analysis of a Parallel MOEA Solving the Multi-objective Quadratic Assignment Problem. In: Deb, K. (eds) Genetic and Evolutionary Computation – GECCO 2004. GECCO 2004. Lecture Notes in Computer Science, vol 3103. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24855-2_44

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24855-2_44

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22343-6

  • Online ISBN: 978-3-540-24855-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation