Art

J-GLOBAL ID：201602213586422090   Reference number：16A0215219

A PARTITION-BASED HEURISTIC ALGORITHM FOR THE RECTILINEAR BLOCK PACKING PROBLEM

直線ブロックパッキング問題に関する分割に基づく発見的アルゴリズム

Author (5)： HU Yannan (Nagoya Univ.) ,  HASHIMOTO Hideki (Tokyo Univ. of Marine Sci. and Technol.) ,  IMAHORI Shinji (Chuo Univ.) ,  UNO Takeaki (National Inst. of Informatics) ,  YAGIURA Mutsunori (Nagoya Univ.)
Material： Journal of the Operations Research Society of Japan  (日本オペレーションズ・リサーチ学会論文誌)
Volume： 59  Issue： 1  Page： 110-129 (J-STAGE)  Publication year： 2016 
JST Material Number： G0402A  ISSN： 0453-4514  Document type： Article
Article type： 原著論文  Country of issue： Japan (JPN)  Language： ENGLISH (EN)

Thesaurus term： *combinatorial optimization problem ,  *packing problem ,  packaging ,  *heuristics ,  algorithm ,  benchmark ,  performance analysis ,  feasibility ,  *decomposition method ,  numerical calculation ,  C language
Semi thesaurus term： strip packaging ,  heuristic

JST classification (1)： Other methods of operations research  (KA03070E)

Reference (17)：

• [1] R.C. Art: An approach to the two dimensional irregular cutting stock problem. IBM Cambridge Science Center, 36 (1966), Y08.
• [2] B.S. Baker, E.G. Coffman Jr. and R.L. Rivest: Orthogonal packings in two dimensions. SIAM Journal on Computing, 9 (1980), 846-855.
• [3] E.K. Burke, G. Kendall and G. Whitwell: A new placement heuristic for the orthogonal stock-cutting problem. Operations Research, 52 (2004), 655-671.
• [4] D. Chen, J. Liu, Y. Fu and M. Shang: An efficient heuristic algorithm for arbitrary shaped rectilinear block packing problem. Computers & Operations Research, 37 (2010), 1068-1074.
• [5] K. Fujiyoshi and H. Murata: Arbitrary convex and concave rectilinear block packing using sequence-pair. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 19 (2000), 224-233.

Terms in the title (3)： 直線 ,  パッキング問題 ,  発見的アルゴリズム