Greedy Adaptive Search: A New Approach for Large-Scale Irregular Packing Problems in the Fabric Industry

doi:10.1109/ACCESS.2020.2994635

CSpace > 应用数学研究所

	Greedy Adaptive Search: A New Approach for Large-Scale Irregular Packing Problems in the Fabric Industry
	Hu, Xiaoyin 1,2; Li, Jianshu 1,2; Cui, Jinchuan1
	2020
发表期刊	IEEE ACCESS
ISSN	2169-3536
卷号	8 页码:91476-91487
摘要	The 2-dimensional irregular packing problems are important in the fabric industry. Under several restrictions, fabric packing problems require placing a given set of parts within a fixed-width rectangular sheet, aiming at a minimum length use. In textile industry production, the fabric packing problems are usually large-scale with time limits, where the total number of parts is large, and a high-utilization solution should be computed in several minutes. However, there are few existing works on large-scale packing problems. In this paper, we propose a greedy adaptive search algorithm by constructing a new evaluation function and introducing a new restricted local search strategy. In our algorithm, with a given initial sequence of parts, we iteratively search the best-fit part in succeeding several parts and place it on sheet. Moreover, we employ a two-stage heuristic searching algorithm to search over all the possible sequences for a good initial sequence with high utilization. Numerical examples involve some large-scale industrial instances, together with some large-scale instances generated from benchmarks. Numerical tests show that our algorithm outperforms existing state-of-the-art solvers in large-scale packing problems. The results show the potential of our algorithm to large-scale packing problems in industrial production.
关键词	Fabrics Search problems Industries Layout Heuristic algorithms Mathematical model Biological system modeling Evaluation function fabric no-fit polygon packing restricted local search
DOI	10.1109/ACCESS.2020.2994635
收录类别	SCI
语种	英语
资助项目	Key Laboratory of Management, Decision and Information Systems, CAS
WOS研究方向	Computer Science ; Engineering ; Telecommunications
WOS类目	Computer Science, Information Systems ; Engineering, Electrical & Electronic ; Telecommunications
WOS记录号	WOS:000538735000013
出版者	IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/51627
专题	应用数学研究所
通讯作者	Hu, Xiaoyin
作者单位	1.Chinese Acad Sci, Acad Math & Syst Sci, Beijing 100190, Peoples R China 2.Univ Chinese Acad Sci, Sch Math Sci, Beijing 100049, Peoples R China
推荐引用方式 GB/T 7714	Hu, Xiaoyin,Li, Jianshu,Cui, Jinchuan. Greedy Adaptive Search: A New Approach for Large-Scale Irregular Packing Problems in the Fabric Industry[J]. IEEE ACCESS,2020,8:91476-91487.
APA	Hu, Xiaoyin,Li, Jianshu,&Cui, Jinchuan.(2020).Greedy Adaptive Search: A New Approach for Large-Scale Irregular Packing Problems in the Fabric Industry.IEEE ACCESS,8,91476-91487.
MLA	Hu, Xiaoyin,et al."Greedy Adaptive Search: A New Approach for Large-Scale Irregular Packing Problems in the Fabric Industry".IEEE ACCESS 8(2020):91476-91487.