Ant Colony Optimization Algorithm for the 0-1 Knapsack Problem Based on Genetic Operators

Zhi Jun Hu; Rong Li

doi:10.4028/www.scientific.net/AMR.230-232.973

Paper Titles

Applications of Neural Networks in Modeling and Forecasting Volatility of Crude Oil Markets: Evidences from US and China
p.953

An Experimental Study of Atomization Characteristics of the Ultrasonic Spray Nozzle
p.958

Simulation and Analysis of Hybrid Electric Vehicle Powertrain
p.964

A Matching Algorithm and Error Analysis on the Basis of Triangle Mesh
p.968

Ant Colony Optimization Algorithm for the 0-1 Knapsack Problem Based on Genetic Operators
p.973

Assembly Sequence Generation and Optimization for Compliant Assemblies Based on Genetic Algorithm
p.978

Joining Phenomena of Resistance Spot Welded Joint between Titanium and Aluminum Alloy
p.982

Study on Physics Properties of ESPCP Stator Rubber with Oil Erosion
p.987

Preparation of Rare Earth Doped ZnO Nano Particles and Investigation on their Optical Properties
p.992

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 230-232Ant Colony Optimization Algorithm for the 0-1...

Ant Colony Optimization Algorithm for the 0-1 Knapsack Problem Based on Genetic Operators

Abstract:

0-1 knapsack problem is a typical combinatorial optimization question in the design and analysis of algorithms. The mathematical description of the knapsack problem is given in theory. The 0-1 knapsack problem is solved by ant colony optimistic algorithm that is improved by introducing genetic operators. To solve the 0-1 knapsack problem with the improved ant colony algorithm, experimental results of numerical simulations, compared with greedy algorithm and dynamic programming algorithm, have shown obvious advantages in efficiency and accuracy on the knapsack problem.

You might also be interested in these eBooks

Frontiers of Manufacturing Science and Measuring Technology

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 230-232)

Pages:

973-977

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.230-232.973

Citation:

Cite this paper

Online since:

May 2011

Authors:

Zhi Jun Hu, Rong Li

Keywords:

Ant Colony Optimistic Algorithm, Genetic Operators, Knapsack Problem

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Chang-shou Deng, Bing-yan Zhao Chang-yong Liang. Computer Engineering and Design Vol. 31 (2010), p.1795–1798, in Chinese.

Google Scholar

[2] OLAI F, REZAEEM J, RABBANIM J, et al . Mathemat ics and Comput ation Vol. 194( 2007) , p.544–551, in Chinese.

Google Scholar

[3] Lian-hong Wang, Jing Zhang, Gu-feng Gong, Zhao-hui He. Journal of Hunan University(Natural Sciences)Vol. 36 (2009), p.81–84, in Chinese.

Google Scholar

[4] Hui-ying Wang, Rui-yu Jia. Computer Technology and Development Vol. 17 (2007), p.104–074, in Chinese.

Google Scholar

[5] Yi-chao He, Kun-qi Liu. Computer Engineering and Design Vol. 28 (2007), p.2655–2657, in Chinese.

Google Scholar

[6] Dorigo M, Maniezzo V, Colorni A. Man and Cybernetics Vol. 26(1996), p.29–41.

Google Scholar

[7] Zhi Zeng, Xiao-fan Yang, Jing Chen, Wen-bin Chen, Rong-wang Tang . Computer Science Vol. 33 (2006), p.220–223, in Chinese.

Google Scholar

[8] Liang Ma, Long-de Wang. Computer Applications Vol. 21 (2001), p.4–5, in Chinese.

Google Scholar

[9] Xiao-hu Luo, Lei Zhao. Journal of Suzhou Institute of Silk Textile Technology Vol. 24 (2004), p.41–44, in Chinese.

Google Scholar