Solving 0-1 knapsack problems by a discrete binary version of differential evolution

Proceedings - 2008 2nd International Symposium on Intelligent Information Technology Application, IITA 2008

Volumn 2, Issue , 2008, Pages 513-516

  Chen, Peng ^a   Li, Jian ^b   Liu, Zhiming ^b  

^a CHINA THREE GORGES UNIVERSITY   (China)

^b HUBEI UNIVERSITY OF EDUCATION   (China)

Author keywords

[No Author keywords available]

Indexed keywords

0-1 KNAPSACK PROBLEMS; BINARY DECISIONS; CONTINUOUS SPACES; CROSSOVER AND MUTATIONS; DIFFERENTIAL EVOLUTIONS; DISCRETE BINARIES; NP-HARD PROBLEMS; PARALLEL SEARCHES; PARTICLE SWARMS; RAPID CONVERGENCES; VECTOR COMPONENTS;

INFORMATION TECHNOLOGY; INTEGER PROGRAMMING; MULTIOBJECTIVE OPTIMIZATION; PARALLEL ALGORITHMS; PARTICLE SWARM OPTIMIZATION (PSO);

GLOBAL OPTIMIZATION;

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

References (7)

1. Peiyi Zhao, Peixin Zhao, and Xin Zhang(2006). "A New Ant Colony Optimization for the Knapsack Problem," Proceedings of 7th International Conference on Computer- Aided Industrial Design and Conceptual Design, Nov 17- 19, pp 1-3.
2. Xianjun Shen, Yuanxiang Li, Wei Wang, et al(2006). "A Dynamic Adaptive Particle Swarm Optimization Optimization for Knapsack Problem," Proceedings of the 6th World Congress on Intelligent Control and Automation, June 21-23, Dalian, China, pp 3183- 3187.
3. Masatoshi Sakawa, Kosuke Kato(2003). "Genetic algorithms with double strings for 0-1 programming problems," European Journal of Operational Research, Vol.144,pp 581-597.
4. Storn Rainer, Price(1995). "Differential evolution- a simple and efficient adaptive scheme for global optimization over continuous spaces ," Technical Report TR-95-012, ICSI, 1995.
5. Kennedy, J., and Eberhart, R. C(1997). "A discrete binary version of the particle swarm algorithm," Proceedings of the 1997 Conference on Systems, Man, and Cybernetics, pp. 4104-4109.
6. Ye yong-chun, Che Lin-xian, He Bing(2006). " 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.
7. Liu Jian-qin, He Yi-chao, Gu Qian-qian(2007). "Solving knapsack problem based on discrete particle swarm optimization," Computer Engineering and Design, 2007, Vol.28, No. 13, pp 3189-3191, 3204.