Evolutionary Algorithms for Knapsack Problems
Author:
Affiliation:

Clc Number:

Fund Project:

National Natural Science Foundation of China (71371063); Basic Research Project of Knowledge Innovation Program in Shenzhen (JCYJ20150324140036825); Natural Science Foundation of Hebei Province (F2016403055); Scientific Research Project Program of Colleges and Universities in Hebei Province (ZD2016005)

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    Knapsack problem (KP) is a well-known combinatorial optimization problem which includes 0-1 KP, bounded KP, multi-constraint KP, multiple KP, multiple-choice KP, quadratic KP, dynamic knapsack KP, discounted KP and other types of KPs. KP can be considered as a mathematical model extracted from variety of real fields and therefore has wide applications. Evolutionary algorithms (EAs) are universally considered as an efficient tool to solve KP approximately and quickly. This paper presents a survey on solving KP by EAs over the past ten years. It not only discusses various KP encoding mechanism and the individual infeasible solution processing but also provides useful guidelines for designing new EAs to solve KPs.

    Reference
    Related
    Cited by
Get Citation

王熙照,贺毅朝.求解背包问题的演化算法.软件学报,2017,28(1):1-16

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:September 22,2016
  • Revised:October 24,2016
  • Adopted:
  • Online: November 26,2016
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063