Title
Author
Year
Volume
:
2024
Vol. 1
no. 1
Vol. 2
2023
Vol. 1
no. 1
no. 2
2022
Vol. 1
no. 1
2021
Vol. 1
no. 1
2019
Vol. 1
no. 1
no. 2
2013
Vol. 1
no. 1
Vol. 2
no. 1
2011
Vol. 1
no. 1
Vol. 2
no. 1
2010
Vol. 1
no. 1
no. 2
Vol. 2
Vol. 0
Vol. 1
Improved Algorithm for Orthogonal Rectangular Packing Problem
Pages
:
21-25
Rachid Ouafi, Isma Dahmani
In this paper, we develop a modified version of the Best First Branch and Bound algorithm (BFBB) proposed in [5] for solving exactly the Orthogonal Rectangular Packing problem (ORP). The ORP consists to pack a given set of small rectangles in an enclosing final rectangle. In our proposed version, we introduce a new upperbound in order to reduce the problem space search. We also propose new strategies that eliminate several duplicate packing patterns. Extensive computational testing onseveral randomly generated problem instances shows the effectiveness of the proposed algorithm.
Home
|
Aims and scopes
|
Editorial board
|
Published issues
|
Instruction for authors
