An augmented beam search-based algorithm for the circular open dimension problem

Authors:
Hakim Akeb;Mhand Hifi;Stéphane Negre
Affiliations:
ISC Paris School of Management, 22 boulevard du Fort de Vaux, 75017 Paris, France;Université de Picardie Jules Verne, Equipe ROAD, MIS, 5 rue du Moulin Neuf, 80000 Amiens, France;Université de Picardie Jules Verne, Equipe ROAD, MIS, 5 rue du Moulin Neuf, 80000 Amiens, France
Venue:
Computers and Industrial Engineering
Year:
2011

Citing 7
Cited 2

Order Allocation for Stock Cutting in the Paper Industry

Operations Research
Approximate algorithms for constrained circular cutting problems

Computers and Operations Research
Approximation Algorithms for Problems Combining Facility Location and Network Design

Operations Research
Minimizing the object dimensions in circle and sphere packing problems

Computers and Operations Research
A beam search algorithm for the circular packing problem

Computers and Operations Research
An improved energy landscape paving algorithm for the problem of packing circles into a larger containing circle

Computers and Industrial Engineering
New and improved results for packing identical unitary radius circles within triangles, rectangles and strips

Computers and Operations Research

Solving the circular open dimension problem by using separate beams and look-ahead strategies

Computers and Operations Research
A coarse-to-fine quasi-physical optimization method for solving the circle packing problem with equilibrium constraints

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we discuss the circular open dimension problem (CODP); that is a problem of the cutting/packing family. In CODP, we are given an initial strip of fixed width W and unlimited length, as well as a finite set N of n circular pieces C"i of known radius r"i,i@?N. The objective is to search for a global optimum corresponding to the minimum length of the initial strip containing the n pieces. We propose an augmented algorithm for solving the CODP which combines a beam search, a binary search and the well-known multi-start strategy. In addition, in order to increase the efficiency of the algorithm, we incorporate a strategy based on the separate beams instead of the pooled ones. The performance of the proposed algorithm is evaluated on a set of benchmark instances composed of a group taken from the literature and another group of randomly generated instances. The results show that the proposed algorithm is able to improve several best known solutions of the literature and it remains competitive for the new generated ones.