.png){kind=icon}
Return
A parallel algorithm for constrained two-staged two-dimensional cutting problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2011.09.005.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we solve the two-staged two-dimensional cutting problem using a parallel algorithm. The proposed approach combines two main features: beam search (BS) and strip generation solution procedures (SGSP). BS employs a truncated tree-search, where a selected subset of generated nodes are retuned for further search. SGSP, a constructive procedure, combines a (sub)set of strips for providing both partial lower and complementary upper bounds. The algorithm explores in parallel a subset of selected nodes following the master-slave paradigm. The master processor serves to guide the search-resolution and each slave processor develops its proper way, trying a global convergence. The aim of such an approach is to show how the parallelism is able to efficiently solve large-scale instances, by providing new solutions within a consistently reduced runtime. Extensive computational testing on instances, taken from the literature, shows the effectiveness of the proposed approach. (C) 2011 Elsevier Ltd. All rights reserved.
Keywords:
Beam-search
Dynamic programming
Heuristics
Knapsack
Master-slave paradigm
Optimization
Journal
IF:
6.5
Papers:
1.0W
Citations:
3.8W
Organization
Cited Papers
ShareSaveShareSaveShareSavePhylogeny, novel bacterial lineage and enzymatic potential of haloalkaliphilic bacteria from the saline coastal desert of Little Rann of Kutch, Gujarat, India.png)
3 Biotech
OAAI
3 BiotechIF0
OAAIShareSave
View more