تعداد نشریات | 418 |
تعداد شمارهها | 10,005 |
تعداد مقالات | 83,629 |
تعداد مشاهده مقاله | 78,549,999 |
تعداد دریافت فایل اصل مقاله | 55,683,685 |
An ACO algorithm for one-dimensional cutting stock problem | ||
Journal of Industrial Engineering International | ||
مقاله 2، دوره 1، شماره 1، آذر 2005، صفحه 10-19 اصل مقاله (146.11 K) | ||
نویسندگان | ||
K Eshghi1؛ H Javanshir* 2 | ||
1Department of Industrial Engineering, Sharif University of Technology, Tehran, Iran | ||
2Islamic Azad University, Science and Research Branch, Tehran, Iran | ||
چکیده | ||
The one-dimensional cutting stock problem, has so many applications in lots of industrial processes and during the past few years has attracted so many researchers’ attention all over the world. In this paper a meta-heuristic method based on ACO is presented to solve this problem. In this algorithm, based on designed probabilistic laws, artificial ants do select various cuts and then select the best patterns. Also because of the problem framework, effective improvements has been made to problem solving process. The results of that algorithm in sample problems, show high efficiency of the algorithm in different levels of problems. | ||
کلیدواژهها | ||
One-dimensional cutting stock problem؛ Ant colony optimization؛ Trim loss | ||
آمار تعداد مشاهده مقاله: 1,061 تعداد دریافت فایل اصل مقاله: 951 |