الگوریتم هیوریستیک کارآمد برای مسئله مستطیل بسته بندی شده
|کد مقاله||سال انتشار||تعداد صفحات مقاله انگلیسی||ترجمه فارسی|
|7990||2007||10 صفحه PDF||سفارش دهید|
نسخه انگلیسی مقاله همین الان قابل دانلود است.
هزینه ترجمه مقاله بر اساس تعداد کلمات مقاله انگلیسی محاسبه می شود.
این مقاله تقریباً شامل 4347 کلمه می باشد.
هزینه ترجمه مقاله توسط مترجمان با تجربه، طبق جدول زیر محاسبه می شود:
- تولید محتوا با مقالات ISI برای سایت یا وبلاگ شما
- تولید محتوا با مقالات ISI برای کتاب شما
- تولید محتوا با مقالات ISI برای نشریه یا رسانه شما
پیشنهاد می کنیم کیفیت محتوای سایت خود را با استفاده از منابع علمی، افزایش دهید.
Publisher : Elsevier - Science Direct (الزویر - ساینس دایرکت)
Journal : Simulation Modelling Practice and Theory, Volume 15, Issue 10, November 2007, Pages 1356–1365
Rectangle-packing problem involves many industrial applications, such as shipping, timber cutting, very large scale integration (VLSI) floor planning, and so on. This problem has shown to be NP hard, and many algorithms such as genetic algorithm, simulated annealing and other heuristic algorithms are presented to solve it. Based on the wisdom and experience of human being, an efficient heuristic algorithm is proposed in this paper. Two group benchmarks are used to test the performance of the produced algorithm, 19 instances of first group and 3 instances of second group having achieved optimal solutions. The experimental results demonstrate that the presented algorithm is rather efficient for solving the rectangle-packing problem.
Rectangle-packing problem involves many industrial applications. For example, in shipping industry, various size boxes have to be loaded as many as possible in a larger container. In wood or glass industries, rectangular components have to be cut from large sheets of material. In very large scale integration (VLSI) floor planning, various chips have to be laid on the chip board, and so on. The rectangle-packing problem belongs to a subset of classical cutting and packing problems and has shown to be NP hard . For more extensive and detailed descriptions of packing problem, please refer to  and . Various algorithms based on different strategies have been suggested to solve this problem. In general, these algorithms can be classified into two major categories: non-deterministic algorithms and deterministic algorithms. The key aspect of non-deterministic algorithms, such as simulated annealing and genetic algorithm  and , is to design data structure that can represent the topological relations among the rectangles. The key aspect of deterministic algorithms is to determine the packing rules, such as less flexibility first principle . Optimal algorithm for orthogonal two-dimensional cutting is proposed in , but it might not be practical for large problems. In order to improve the quality of solution, some scholars combine genetic algorithm or simulated annealing with deterministic method and obtain hybrid algorithms  and . Some heuristic and meta-heuristic algorithms are presented in , ,  and . In recent years, some people began to formalize the wisdom and experience of human being and obtain the quasi-human heuristic algorithms , , ,  and . The “quasi-human” tries to simulate the behavior of human being in related special work such as bricklaying. In , the authors presented a heuristic algorithm based on two important concepts, namely, the corner-occupying action and caving degree. Based on , an efficient heuristic algorithm (HA) for rectangle-packing problem is proposed on the basis of the wisdom and experience of human being in this paper. The objective is to maximize the area usage of the box. The key point of this algorithm is that the rectangle packed into the box always occupies a corner, even a cave, if possible. Furthermore, the rectangle should occupy as many corners and overlap as many edges with other previously packed rectangles as possible. In this way, the rectangles will be close to each other wisely, and the spare space is decreased. As compared with reviewed literatures, the results from HA are much improved. For 21 rectangle-packing test instances taken from , optimal solutions of 19 instances are achieved by HA, and two and three ones by the algorithm in  and , respectively. For each of 13 random instances taken from , the container height obtained by HA is smaller than that by best fit (BF) heuristic . Furthermore, optimal solutions of three instances are achieved by HA. Experimental results show that HA is rather efficient for solving the rectangle-packing problem.
نتیجه گیری انگلیسی
In this paper, an efficient heuristic algorithm (HA) for rectangle-packing problem is proposed. High area usage of the box can be obtained by this algorithm. Optimal solutions of 19 of 21 test instances taken from  and 3 of 13 instances taken from  are achieved by HA. The experimental results demonstrate that HA is rather efficient for solving the rectangle-packing problem.