.png){kind=icon}
Return
An augmented beam search-based algorithm for the circular open dimension problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2011.02.009.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we discuss the circular open dimension problem (CODP); that is a problem of the cutting/packing family. In COOP, 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 is an element of 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 COOP 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. (C) 2011 Elsevier Ltd. All rights reserved.
Keywords:
Beam search
Binary search
Cutting and packing
Minimum local-distance position
Multi-start strategy
Journal
IF:
6.5
Papers:
1.0W
Citations:
3.8W
Organization
Cited Papers
.png){kind=icon}
Light-dependent toxicity of α-terthienyl and anthracene toward late embryonic stages ofRana pipiens
PREAI
ShareSave
ShareSaveShareSaveShareSaveFUNCTIONAL CHARACTERIZATION OF THE ADRENOLEUKODYSTROPHY PROTEIN (ALDP) AND DISEASE PATHOGENESIS
PREAI
ShareSave
View more