Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

The Presentation of an Exploratory Algorithm for the Rectangle Packing Problem on the Basis of the Best Fit Algorithm and the Lowest Front-Line Strategy

Version 1 : Received: 26 January 2020 / Approved: 27 January 2020 / Online: 27 January 2020 (13:53:21 CET)
Version 2 : Received: 23 November 2020 / Approved: 25 November 2020 / Online: 25 November 2020 (14:45:28 CET)

How to cite: Bozorgi, M.; Mohammadi Zanjireh, M. The Presentation of an Exploratory Algorithm for the Rectangle Packing Problem on the Basis of the Best Fit Algorithm and the Lowest Front-Line Strategy. Preprints 2020, 2020010329 (doi: 10.20944/preprints202001.0329.v1). Bozorgi, M.; Mohammadi Zanjireh, M. The Presentation of an Exploratory Algorithm for the Rectangle Packing Problem on the Basis of the Best Fit Algorithm and the Lowest Front-Line Strategy. Preprints 2020, 2020010329 (doi: 10.20944/preprints202001.0329.v1).

Abstract

Nowadays, the wasting of resources is one of the fundamental challenges of the industrial sector. The rectangle packing problem can be very effective in this context. Practical applications of this issue in the timing and designing of the industries and businesses are very remarkable. The purpose of this issue is to arrange a set of rectangles with specific dimensions in a rectangular page with a specific width and unlimited height without overlapping. The fundamental challenge in this issue is that this is an NP-complete issue. Therefore, it is difficult to achieve the best arrangement, which has the maximum rate of resource utilization and also has a linear running time. Many algorithms have been presented to estimate a practical solution for this issue. In the past decades, the best fit method has been one of the most useful methods for this purpose. This study presents a combinatorial algorithm based on two algorithms, including the lowest front-line strategy and the best-fit algorithm. The running results indicate that the suggested algorithm performs well, despite its simplicity. The time complexity of the suggested algorithm is O(nm), in which n is the number of input rectangles and m is the number of the created front lines.

Subject Areas

rectangle packing problem; best-fit algorithm; lowest front-line strategy

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our diversity statement.

Leave a public comment
Send a private comment to the author(s)
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.