单规格一刀切矩形排样问题的启发式搜索算法.PDFVIP

ISSN 1000-9825, CODEN RUXUEW E-mail: jos@ Journal of Software ,2017,28(7):16401654 [doi: 10.13328/ki.jos.005100] ©. Tel: +86-10   1,2 1 1 , , 1((), 510006) 2( , 510430) : , E-mail: kfedward@163.com : ,,(bigitem smallitem divide-and-conquer best-fit,BSDBF)., ,,.,, .,,, .,,BSDBF .Benchmark ,BSDBF . : ;;;; : TP301 : ,,.. ,2017,28(7):1640–1654. http:// /1000-9825/5100.htm : Wang L, Liu Q, Chen X. Heuristic search algorithm for the rectangular fixed-size guillotine bin packing problem. Ruan Jian Xue Bao/Journal of Software, 2017,28(7):1640–1654 (in Chinese). /1000-9825/5100.htm Heuristic Search Algorithm for the Rectangular Fixed-Size Guillotine Bin Packing Problem 1,2 1 1 WANG Lei , LIU Qiang , CHEN Xin 1(Guangdong Provincial Key Laboratory of Computer Integrated Manufacturing System (Guangdong University of Technology), Guangzhou 510006, China) 2(Department of Information Engineering, Guangdong Polytechnic of Science and Trade, Guangzhou 510430, China) Abstract : This paper proposes a novelty heuristic search algorithm, called BSDBF (bigitem smallitem divide-and-conquer best-fit), to solve the two-dimensional rectangular fixed-size guillotine bin packing problem. First, based on group rules, this algorithm implements big item smalltime divide-and-conquer strategy and efficient group recommendation scheme which are key points to improve the group strategy. Then, the best-fit group is selected for recursive packing, and packing solution is achieved greedily for all bins. Finally, an initial s