臺灣人文及社會科學引文索引資料庫系統

:::

詳目顯示

回上一頁
第 1 筆 / 總合 1 筆   第一頁 上一頁 下一頁 最後一頁
/1頁
題名：多尺寸方形排列問題啟發式解法之研究
書刊名：工業工程學刊
作者：吳泰熙 引用關係／駱景堯 引用關係／林東養
作者(外文)：Wu, Tai-hsi／Low, Chinyao／Lin, Tong-young
出版日期：2000
卷期：17:1
頁次：頁75-85
主題關鍵詞：方形排列問題；切割問題；Rectangular packing；Cutting problem
原始連結：連回原系統網址new window
相關次數：
  • 被引用次數被引用次數:期刊(0) 博士論文(1) 專書(0) 專書論文(0)
  • 排除自我引用排除自我引用:0
  • 共同引用共同引用:0
  • 點閱點閱:219
　　　　　切割/排列問題在工業界中出現頻繁，如紡織業、玻璃業、製鞋/皮革業、傢俱業及鋼鐵/造船業等。業者莫不絞盡腦汁，發展出快速的解決之道。本研究以過去文獻中所提出之左下優先演算法(Bottom Up Left Justified, BL)為基礎，提出更精細之演算法，IBLA(Improved BL Algorithm)。期望IBLA能在方形排列問題中迅速地找到「好的」或「近似最佳」的切割/排列方式以節省成本及提昇原物料使用率。本研究除了探討單一物料原片排列之問題外，亦延伸至多張物料原片排列問題之分析。最後，並與文獻中出現之最佳化數學模式及數個啟發式解法在解題時效及解答品質上之表現加以比較。
　　　　　This paper proposes an improved algorithm, IBLA, based on the BL (Bottom-Up Left-Justified) heuristic appeared in the literature for packing boxes with different sizes in a single material plate. This algorithm can be easily revised and hence applied to the cases involving multiple material plates. Examples adopted from literature were used to compare the proposed algorithm with the results from both exact model and other heuristics in terms of the solution quality. The corresponding running time information-was also provided.
期刊論文
1.Gilmore, P. C.、Gomory, R. E.(1961)。A Linear Programming Approach to the Cutting Stock Problem (Part 1)。Operation Research，9(6)，849-859。  new window
2.Gilmore, P. C.、Gomory, R. E.(1963)。A linear programming approach to the cutting stock problem。Operations Research，11(6)，863-888。  new window
3.Beasley, J. E.(1985)。Algorithms for Unconstrained Two-Dimensional Guillotine Cutting。Journal of the Operational Research Society，36(4)，297-306。  new window
4.Israni, S. S.、Sanders, J. L.(1985)。Performance Testing of Rectangular Parts-Nesting Heuristics。International Journal of Production Research，23(2)，437-456。  new window
5.Goulimis, C.(1990)。Optimal solutions for the cutting stock problem。European Journal of Operational Research，44，197-208。  new window
6.Dowsland, K. A.(1987)。An exact algorithm for the pallet loading problem。European Journal of Operational Research，31，78-84。  new window
7.Dowsland, K. A.、Dowsland, W. B.(1992)。Packing problems。European Journal of Operational Research，56，2-14。  new window
8.Bagchi, A.、Viswanathan, K. V.(1993)。Best-first search methods for constrained two-dimensional cutting stock problems。Operations Research，41，768-776。  new window
9.Rosenberg, O.、Rode, M.(1987)。An analysis of heuristic trim-loss algorithm。Engineering Costs and Production Economy，12，71-78。  new window
10.Arenales, M. N.、Morabito, R. N.(1992)。An and-or-graph approach for two-dimensional cutting stock problems。European Journal of Operational Research，58，263-271。  new window
11.Jacobs, S.(1996)。On genetic algorithm for the packing of polygons。European Journal of Operational Research，88，165-181。  new window
12.Sanders, J. L.、Israni, S. S.(1982)。Two-dimensional cutting stock problem research: A review and a new rectangular layout algorithm。Journal of Manufacturing Systems，1，169-182。  new window
13.Hifi, M.(1997)。The DH/ KD algorithm: a hybrid approach for unconstrained two-dimensional cutting problems。European Journal of Operational Research，97，41-52。  new window
14.Gilmore, P. C.、Gomory, R. E.(1966)。The theory and computation of knapsack functions。Operations Research，14(6)，1045-1074。  new window
15.Gilmore, P. C.、Gomory, R. E.(1965)。Multistage cutting problems of two and more dimensions。Operations Research，13，94-120。  new window
16.Eilon, S.、Christofides, N.(1971)。The loading problem。Management Science，17，259-268。  new window
17.Alfa, A. S.、Balakrishman, S.、El-Bouri, A.、Popplewell, N.(1994)。A search-based heuristic for the two-dimensional bin-packing problem。INFOR，32，265-274。  new window
18.De Cani, P.(1978)。A note on the two-dimensional rectangular cutting-stock problem。Journal of the Operational Research Society，41，141-150。  new window
19.Dagli, C. H.(1987)。An approach to two-dimensional cutting stock problems。International Journal of Production Research，25，175-190。  new window
20.Whitlock, C.、Christofides, N.(1977)。An algorithm for two dimensional cutting problems。Operations Research，25，30-44。  new window
21.Ram, B.、Sarin, S.、Chen, C. S.(1991)。The pallet packing for non-uniform box sizes。International Journal of Production Research，29，1963-1968。  new window
22.Chazelle, B.(1983)。The bottom-left bin-packing heuristic: an efficient implementation。IEEE Transactions on Computers，C-32，697-707。  new window
23.Soumis, F.、Sadones, R.、Loulou, R.、Chauny, F.(1991)。A two phase heuristic for the two-dimensional cutting stock problem。Journal of the Operational Research Society，42，39-47。  new window
24.Brown, D. J.(1980)。An improved b1 lower bound。Information Processing Letters，11，37-39。  new window
25.Biro, M.、Boros, E.(1984)。Network flows and non-guillotine cutting patterns。European Journal of Operational Research，16，215-221。  new window
26.Beasley, J. E.(1985)。An exact two-dimensional non-guillotine cutting tree search procedure。Operations Research，33，49-64。  new window
27.Zhang, J.、Vate, J. H.、Bartholdi, J. J.(1989)。Expected performance of the shelf heuristic for 2 dimensional packing。Operations Research Letter，8，11-16。  new window
28.Rivest, R.、Baker, B.、Coffman, E. G., Jr.(1980)。Orthogonal packings in two dimensions。SIAM Journal on Computing，9，846-855。  new window
圖書
1.Garey, Michael R.、Johnson, David S.(1979)。Computers and Intractability: A Guide to the theory of NP-Completeness。W. H. Freeman and Company。  new window
2.Johnson, D. S.、Garey, M. R.、Coffman, E. G.(1984)。Approximation Algorithms for Bin-Packing - An Updated Survey。Algorithm Design for Computer System Design。Vienna, Austria。  new window
3.Beasley, J. E.(1984)。An algorithm for the two-dimensional assortment problem。An algorithm for the two-dimensional assortment problem。London, UK。  new window
 
 
 
 
第一頁 上一頁 下一頁 最後一頁 top
QR Code
QRCODE

臺灣人文及社會科學引文索引資料庫

目前上線人數：1752（臺灣：1723，外國：29） ／ 本年度總使用人次：1586744 ／ 訪客人次（自102年09月）：67402564
國家圖書館著作權聲明 Copyright © 2013 All rights reserved.
本館地址: 100201臺北市中山南路20號． 本館地圖及交通資訊．
總機：(02)23619132．最佳瀏覽解析度為1024x768以上