Skip to main content

A Cooperative Learning Approach for the Quadratic Knapsack Problem

  • Conference paper
  • First Online:
Learning and Intelligent Optimization (LION 12 2018)

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

Included in the following conference series:

Abstract

The Quadratic Knapsack Problem (QKP) is a well-known optimization problem aimed to maximize a quadratic objective function subject to linear capacity constraints. It has several applications in different fields such as telecommunications, graph theory, logistics, hydrology and data allocation, among others. In this paper, we propose the application of a novel population-based metaheuristic referred to as Multi-leader Migrating Birds Optimization (MMBO), which exploits the concepts of cooperation and communication along the search leading to a collective learning, to solve a wide range of well-known QKP instances.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and 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. Billionnet, A., Soutif, É.: An exact method based on lagrangian decomposition for the 0–1 quadratic knapsack problem. Eur. J. Oper. Res. 157(3), 565–575 (2004)

    Article  MathSciNet  Google Scholar 

  2. Caprara, A., Pisinger, D., Toth, P.: Exact solution of the quadratic knapsack problem. INFORMS J. Comput. 11(2), 125–137 (1999)

    Article  MathSciNet  Google Scholar 

  3. Cunha, J.O., Simonetti, L., Lucena, A.: Lagrangian heuristics for the quadratic knapsack problem. Comput. Optim. Appl. 63, 97–120 (2016)

    Article  MathSciNet  Google Scholar 

  4. Fomeni, F., Letchford, A.: A dynamic programming heuristic for the quadratic knapsack problem. INFORMS J. Comput. 26(1), 173–182 (2013)

    Article  MathSciNet  Google Scholar 

  5. Gallo, G., Hammer, P.L., Simeone, B.: Quadratic knapsack problems. In: Padberg, M.W. (ed.) Combinatorial Optimization, pp. 132–149. Springer, Berlin (1980). https://doi.org/10.1007/BFb0120892

    Chapter  Google Scholar 

  6. Lalla-Ruiz, E., de Armas, J., Expósito-Izquierdo, C., Melián-Batista, B., Moreno-Vega, J.M.: Multi-leader migrating birds optimisation: a novel nature-inspired metaheuristic for combinatorial problems. Int. J. Bio-Inspired Comput. 10, 89–98 (2017)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Stefan Voß .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Lalla-Ruiz, E., Segredo, E., Voß, S. (2019). A Cooperative Learning Approach for the Quadratic Knapsack Problem. In: Battiti, R., Brunato, M., Kotsireas, I., Pardalos, P. (eds) Learning and Intelligent Optimization. LION 12 2018. Lecture Notes in Computer Science(), vol 11353. Springer, Cham. https://doi.org/10.1007/978-3-030-05348-2_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-05348-2_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-05347-5

  • Online ISBN: 978-3-030-05348-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics