C-Sets-based sequential heuristic procedure for the one-dimensional cutting stock problem with pattern reduction

doi:10.1080/10556780903420531

	C-Sets-based sequential heuristic procedure for the one-dimensional cutting stock problem with pattern reduction
	Cui, Yaodong 1; Liu, Zhiyong 2
	2011
发表期刊	OPTIMIZATION METHODS & SOFTWARE
ISSN	1055-6788
卷号	26 期号:1 页码:155-167
摘要	This paper presents a sequential heuristic procedure (SHP) for the 1D cutting stock problem with pattern reduction, where a set of items are cut from stock bars of the same length to minimize the bar cost, with a secondary objective being to reduce the pattern count of the cutting plan. The SHP generates the current pattern to produce some items, and continues until all items are fulfilled. The algorithm uses two candidate sets (C-Sets). The first is the set of the candidate items for generating the current pattern. The second is the set of candidate patterns from which the current pattern is selected. The algorithm generates candidate patterns using the candidate items, determines the estimated cutting-plan cost (ECP-cost) of each pattern using a look-ahead strategy, and selects the pattern of the minimum ECP-cost as the current pattern. The computational results indicate that the algorithm is efficient.
关键词	cutting stock one-dimensional cutting pattern reduction look-ahead strategy
DOI	10.1080/10556780903420531
收录类别	SCI
语种	英语
资助项目	Special Foundation for Improving Science Research Conditions of Guizhou Province of China ; National Natural Science Foundation[60763011] ; National Natural Science Foundation[60752001]
WOS研究方向	Computer Science ; Operations Research & Management Science ; Mathematics
WOS类目	Computer Science, Software Engineering ; Operations Research & Management Science ; Mathematics, Applied
WOS记录号	WOS:000282171700008
出版者	TAYLOR & FRANCIS LTD
引用统计	被引频次：19[WOS] [WOS记录] [WOS相关记录]
文献类型	期刊论文
条目标识符	http://119.78.100.204/handle/2XEOYT63/13218
专题	中国科学院计算技术研究所期刊论文_英文
通讯作者	Cui, Yaodong
作者单位	1.Guangxi Univ, Sch Comp Elect & Informat, Nanning 530004, Peoples R China 2.Chinese Acad Sci, Inst Comp Technol, Beijing, Peoples R China
推荐引用方式 GB/T 7714	Cui, Yaodong,Liu, Zhiyong. C-Sets-based sequential heuristic procedure for the one-dimensional cutting stock problem with pattern reduction[J]. OPTIMIZATION METHODS & SOFTWARE,2011,26(1):155-167.
APA	Cui, Yaodong,&Liu, Zhiyong.(2011).C-Sets-based sequential heuristic procedure for the one-dimensional cutting stock problem with pattern reduction.OPTIMIZATION METHODS & SOFTWARE,26(1),155-167.
MLA	Cui, Yaodong,et al."C-Sets-based sequential heuristic procedure for the one-dimensional cutting stock problem with pattern reduction".OPTIMIZATION METHODS & SOFTWARE 26.1(2011):155-167.