Skip to main content
SpringerLink
Log in
Book cover

Workshops on Applications of Evolutionary Computation

EvoWorkshops 2001: Applications of Evolutionary Computing pp 30–39Cite as

Application of GRASP to the Multiconstraint Knapsack Problem⋆

  • Conference paper
  • First Online:

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

Abstract

A number of approaches based on GRASP are presented for the Multiconstraint Knapsack Problem. GRASP combines greedy construction of feasible solutions with local search. Results from applying our algorithms to standard test problems are presented and compared with results obtained by Chu and Beasley.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. J. of Global Optimization 6 (1995) 109–133

    Article  MathSciNet  MATH  Google Scholar 

  2. Weingarter, H.M.: Mathematical programming and the analysis of capital budgeting problems. Markham Publishing (1967) Chicago

    Google Scholar 

  3. Shih, W.: A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem. J. of the Operational Res. Soc. 30 (1979) 369–378

    Article  MATH  Google Scholar 

  4. Cotta, C., Troya, J.M.: A hybrid genetic algorithm for the 0-1 multiple knapsack problem. In: Artificial neural nets and genetic algorithms 3, eds. Smith, G.D., Steele, N.C., Albrecht, R.F., Springer-Verlag (1998) 251–255

    Google Scholar 

  5. Chu, P.C., Beasley, J.E.: A genetic algorithm for the multidimensional knapsack problem. J. of Heuristics 4 (1998) 63–86

    Article  MATH  Google Scholar 

  6. Pirkul, H.: A Heuristic Search Procedure for the Multiconstraint Zero-One Knapsack Problem. Naval Research Logistics 34 (1987) 161–172

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. UEA Norwich, NR4 7TJ, UK

    Jameel A. Maki

Authors
  1. Pierre Chardaire
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Geoff P. McKeown
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jameel A. Maki
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Leiden University, Niels Bohrweg1, 2333, CA, Leiden, The Netherlands

    Egbert J. W. Boers

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chardaire, P., McKeown, G.P., Maki, J.A. (2001). Application of GRASP to the Multiconstraint Knapsack Problem⋆. In: Boers, E.J.W. (eds) Applications of Evolutionary Computing. EvoWorkshops 2001. Lecture Notes in Computer Science, vol 2037. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45365-2_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-45365-2_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41920-4

  • Online ISBN: 978-3-540-45365-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation