Name
Abstract | ||
|---|---|---|
One-dimensional cutting-stock is one of the classic NP-hard problems in combinatorial optimization. It is widely applied in engineering technology and industrial production. In this paper, an improved ant colony optimization is proposed based on the optimized one-dimensional cutting-stock model. Aiming at the specific characteristics of the problem, a series of improvement strategies are proposed, including part encoding, solution path, state transition probability and pheromone updating rules. Then the concrete steps of algorithm are described. Through the analysis and comparison of experimental results, this method is proved high efficiency. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1109/NCM.2009.233 | NCM |
Keywords | Field | DocType |
ant colony optimization,engineering technology,optimized one-dimensional cutting-stock model,improvement strategy,concrete step,one-dimensional cutting-stock problem,high efficiency,classic np-hard problem,one-dimensional cutting-stock,combinatorial optimization,improved ant colony optimization,linear programming,mathematical model,np hard problem,algorithm design and analysis,optimization,genetic algorithms,cutting stock problem,industrial production,data mining,bin packing,state transition | Ant colony optimization algorithms,Mathematical optimization,Extremal optimization,Computer science,Meta-optimization,Algorithm,Combinatorial optimization,Cutting stock problem,Optimization problem,Bin packing problem,Metaheuristic | Conference |
Citations | PageRank | References |
2 | 0.40 | 3 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bin Yang | 1 | 2 | 0.40 |
| Chunyang Li | 2 | 167 | 6.04 |
| Huang Lan | 3 | 10 | 13.31 |
| Ying Tan | 4 | 2 | 0.40 |
| Chunguang Zhou | 5 | 543 | 52.37 |