Solving 0-1 knapsack problems via a hybrid differential evolution

3rd International Symposium on Intelligent Information Technology Application, IITA 2009

Volumn 3, Issue , 2009, Pages 134-137

  Shu, Jun ^a   Li, Jian ^b  

^a HUBEI UNIVERSITY   (China)

^b HUBEI UNIVERSITY OF EDUCATION   (China)

Author keywords

Differential evolution; Knapsack problem; Local search

Indexed keywords

0-1 KNAPSACK PROBLEM; BINARY DECISION; CONTINUOUS FUNCTION OPTIMIZATION; DIFFERENTIAL EVOLUTION; DISCRETE BINARY; HYBRID DIFFERENTIAL EVOLUTION; KNAPSACK PROBLEMS; LOCAL SEARCH; NP-HARD PROBLEM; PARALLEL SEARCH; VECTOR COMPONENTS;

INFORMATION TECHNOLOGY; INTEGER PROGRAMMING; MATHEMATICAL OPERATORS; MULTIOBJECTIVE OPTIMIZATION;

EVOLUTIONARY ALGORITHMS;

EID: 77649315143     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IITA.2009.35     Document Type: Conference Paper

References (9)

1. Peiyi Zhao, Peixin Zhao, and Xin Zhang. "A New Ant Colony Optimization for the Knapsack Problem," Proc. the 7th International Conference on Computer-Aided Industrial Design and Conceptual Design, Nov 17-19, 2006, pp 1-3.
2. Xianjun Shen, Yuanxiang Li, Wei Wang, et al. "A Dynamic Adaptive Particle Swarm Optimization Optimization for Knapsack Problem," Proc. the 6th World Congress on Intelligent Control and Automation, June 21-23, 2006, Dalian, China, pp 3183- 3187.
3. Masatoshi Sakawa, Kosuke Kato. "Genetic algorithms with double strings for 0-1 programming problems," European Journal of Operational Research 144, 2003, pp 581-597.
4. Storn Rainer, Price. "Differential evolution- a simple and efficient adaptive scheme for global optimization over continuous spaces ," Technical Report TR-95-012, ICSI, 1995.
5. Chen Peng, Li Jian, and Liu Zhiming, "Solving 0-1 Knapsack Problems by a Discrete Binary Version of Differential Evolution," Proc. Second International Symposium on Intelligent Information Technology Application, 2008. Shanghai, China, Dec 20-22, 513-516.
6. Kennedy, J., and Eberhart, R. C. "A discrete binary version of the particle swarm algorithm," Proc. the 1997 Conference on Systems, Man, and Cybernetics, 1997, pp 4104-4109.
7. Chen-hsiung Chan, Sheng-An Lee, and Cheng-Yan Kao. "Improving EAX with Restricted 2-opt,". Proc. GECCO2005. Washington, DC, USA: ACM Press. 1471-1476.
8. Ye yong-chun, Che Lin-xian, He Bing. "A kind of hybrid particle swarm optimization algorithm for solving 0-1 knapsack problems," Journal of Changsha University of Electric power (Natural Science). 2006, 21(4), pp 87-90.
9. Liu Jian-qin, He Yi-chao, Gu Qian-qian. "Solving knapsack problem based on discrete particle swarm optimization," Computer Engineering and Design, 2007, 28(13), pp 3189-3191, 3204.