Improved Knapsack Problem Algorithm Based on Greedy Strategy for Tower Nesting

Li Bin Cai; Shen Wei; Jing Hua Yuan; Li Li

doi:10.4028/www.scientific.net/AMR.446-449.592

Paper Titles

Investigate the Statistical Damage Model of Transversely Isotropic Soil
p.572

On Buckling Loads of Timoshenko Columns with Elastically Supported Ends
p.578

Research on Blasting Vibration Safety Assessment Parameters
p.582

Elasto-Plastic Design of Piled Raft Foundation
p.588

Improved Knapsack Problem Algorithm Based on Greedy Strategy for Tower Nesting
p.592

Study on Numerical Analysis of Tunnel Longitudinal Uneven Settlement Base on Elastoplastic Theory
p.596

Experimental Investigation of Ductility of Reinforced High Strength Concrete T-Section Beams Retrofitted with CFRP
p.601

Simplified Calculation Method of Optimal Centre Line of the Arch
p.611

Advanced Analysis of Staggered Truss of Steel Structure
p.615

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 446-449Improved Knapsack Problem Algorithm Based on...

Improved Knapsack Problem Algorithm Based on Greedy Strategy for Tower Nesting

Abstract:

Tower nesting is a classic NP-hard problem, which is always solved in manual method or manual method combined with computer in production practice. The manual method is inefficient and impossible to process large amount of data accurately. Furthermore, the utilization rate of materials is not satisfactory. In this paper, we present a strategy based on an improved greedy algorithm to solve the nesting problem. Experimental results show that this algorithm has advantages of time efficiency and utilization rate of material.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 446-449)

Pages:

592-595

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.446-449.592

Citation:

Cite this paper

Online since:

January 2012

Authors:

Li Bin Cai, Shen Wei, Jing Hua Yuan, Li Li

Keywords:

Dynamic Programming, Greedy Strategy, Knapsack Algorithms, Tower Nesting

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Zhu Jiangzong, Yang Xiaoying, Do good efficiency and improve the utilization of steel, China Electric Power News, 2007-07-10, in Chinese.

Google Scholar

[2] Lee, How to response to Steel price increase, CNC Machine Tool Market, pp.68-70, 2004.11.

Google Scholar

[3] Cui Meng, Genetic algorithms to solve multi-knapsack problem, Computer and Network, 2005.09, in Chinese.

Google Scholar

[4] Liu Yujuan, Xiang Hai, two extended forms of 0-1 knapsack problem and its solution, Application Research Of Computers , 2006.01.

Google Scholar

[5] Lv Congying, Zhao Gangbin, Chun-Guang Zhou, Dynamic programming analysis for 0-1 Knapsack Problem, Nanyang Institute of Technology, 2011.2, in Chinese.

Google Scholar

[6] Ma Huimin, Ye Chunming,Zhang Shuang, Binary Particle Swarm Algorithm applied in the Knapsack Problem, Shanghai University of Technology, 2006. 1, in Chinese.

Google Scholar