skip to main content
10.1145/1276958.1277247acmconferencesArticle/Chapter ViewAbstractPublication PagesgeccoConference Proceedingsconference-collections
Article

A comparison of GAs using penalizing infeasible solutions and repairing infeasible solutions on restrictive capacity knapsack problem

Published: 07 July 2007 Publication History

Abstract

No abstract available.

References

[1]
Z. Michalewicz. Genetic Algorithms + Data Structure = Evolution Program. Springer Verlag, New York, third edition, 1996.
[2]
Y. Zhou and J. He. A runtime analysis of evoluionary algorithms for constrained optimization problems. IEEE Transactions on Evolutionary Computation. (in press).

Cited By

View all
  • (2023)How SonarQube-identified technical debt is prioritizedInformation and Software Technology10.1016/j.infsof.2023.107147156:COnline publication date: 1-Apr-2023
  • (2019)Technical Debt Prioritization: A Search-Based Approach2019 IEEE 19th International Conference on Software Quality, Reliability and Security (QRS)10.1109/QRS.2019.00060(434-445)Online publication date: Jul-2019
  • (2013)Usefulness of infeasible solutions in evolutionary search: An empirical and mathematical study2013 IEEE Congress on Evolutionary Computation10.1109/CEC.2013.6557723(1363-1370)Online publication date: Jun-2013
  • Show More Cited By

Index Terms

  1. A comparison of GAs using penalizing infeasible solutions and repairing infeasible solutions on restrictive capacity knapsack problem

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM Conferences
      GECCO '07: Proceedings of the 9th annual conference on Genetic and evolutionary computation
      July 2007
      2313 pages
      ISBN:9781595936974
      DOI:10.1145/1276958

      Sponsors

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 07 July 2007

      Permissions

      Request permissions for this article.

      Check for updates

      Author Tags

      1. computation time
      2. constrained optimization
      3. knapsack problem

      Qualifiers

      • Article

      Conference

      GECCO07
      Sponsor:

      Acceptance Rates

      GECCO '07 Paper Acceptance Rate 266 of 577 submissions, 46%;
      Overall Acceptance Rate 1,669 of 4,410 submissions, 38%

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)1
      • Downloads (Last 6 weeks)0
      Reflects downloads up to 16 Feb 2025

      Other Metrics

      Citations

      Cited By

      View all
      • (2023)How SonarQube-identified technical debt is prioritizedInformation and Software Technology10.1016/j.infsof.2023.107147156:COnline publication date: 1-Apr-2023
      • (2019)Technical Debt Prioritization: A Search-Based Approach2019 IEEE 19th International Conference on Software Quality, Reliability and Security (QRS)10.1109/QRS.2019.00060(434-445)Online publication date: Jul-2019
      • (2013)Usefulness of infeasible solutions in evolutionary search: An empirical and mathematical study2013 IEEE Congress on Evolutionary Computation10.1109/CEC.2013.6557723(1363-1370)Online publication date: Jun-2013
      • (2008)On the usefulness of infeasible solutions in evolutionary search: A theoretical study2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence)10.1109/CEC.2008.4630893(835-840)Online publication date: Jun-2008

      View Options

      Login options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Figures

      Tables

      Media

      Share

      Share

      Share this Publication link

      Share on social media