An Efficient Heuristic Approach for Irregular Cutting Stock Problem in Ship Building Industry

被引:8
作者
Xu, Yan-xin [1 ]
机构
[1] Shanghai Jiao Tong Univ, Dept Automat, Shanghai 200240, Peoples R China
基金
中国国家自然科学基金;
关键词
BIN-PACKING; GENETIC ALGORITHM; TYPOLOGY;
D O I
10.1155/2016/8703782
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
This paper presents an efficient approach for solving a real two-dimensional irregular cutting stock problem in ship building industry. Cutting stock problem is a common cutting and packing problem that arises in a variety of industrial applications. A modification of selection heuristic Exact Fit is applied in our research. In the case referring to irregular shapes, a placement heuristics is more important to construct a complete solution. A placement heuristic relating to bottom-left-fill is presented. We evaluate the proposed approach using generated instance only with convex shapes in literatures and some instances with nonconvex shapes based on real problem from ship building industry. The results demonstrate that the effectiveness and efficiency of the proposed approach are significantly better than some conventional heuristics.
引用
收藏
页数:12
相关论文
共 33 条
  • [1] A Heuristic Approach Based on Shape Similarity for 2D Irregular Cutting Stock Problem
    Xu, Yanxin
    Yang, Genke
    Pan, Changchun
    INTELLIGENT COMPUTING FOR SUSTAINABLE ENERGY AND ENVIRONMENT, 2013, 355 : 275 - 283
  • [2] Column generation and sequential heuristic procedure for solving an irregular shape cutting stock problem
    Song, X.
    Bennell, J. A.
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2014, 65 (07) : 1037 - 1052
  • [3] A GRASP meta-heuristic for two-dimensional irregular cutting stock problem
    MirHassani, S. A.
    Bashirzadeh, A. Jalaeian
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2015, 81 (1-4) : 455 - 464
  • [4] An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry
    Lu, Hao-Chun
    Huang, Yao-Huei
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2015, 246 (01) : 51 - 65
  • [5] A heuristic for the Minimum Score Separation Problem, a combinatorial problem associated with the cutting stock problem
    Beeker, Kai Helge
    Appa, Gautam
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2015, 66 (08) : 1297 - 1311
  • [6] Two dimensional guillotine cutting stock and scheduling problem in printing industry
    Mostajabdaveh, Mahdi
    Salman, F. Sibel
    Tahmasbi, Nadia
    COMPUTERS & OPERATIONS RESEARCH, 2022, 148
  • [7] Modified Greedy Heuristic for the one-dimensional cutting stock problem
    Cerqueira, Goncalo R. L.
    Aguiar, Sergio S.
    Marques, Marlos
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2021, 42 (03) : 657 - 674
  • [8] Modified Greedy Heuristic for the one-dimensional cutting stock problem
    Gonçalo R. L. Cerqueira
    Sérgio S. Aguiar
    Marlos Marques
    Journal of Combinatorial Optimization, 2021, 42 : 657 - 674
  • [9] A TWO-STEP MATH HEURISTIC SOLUTION APPROACH FOR THE TWO-DIMENSIONAL CUTTING STOCK PROBLEM
    Erdem, Banu Icmen
    Kasimbeyli, Refail
    JOURNAL OF NONLINEAR AND CONVEX ANALYSIS, 2023, 24 (04) : 681 - 699
  • [10] An improved heuristic for the two-dimensional cutting stock problem with multiple sized stock sheets
    El-Bouri, Ahmed
    Rao, Jinsong
    Popplewell, Neil
    Balakrishnan, S.
    INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING-THEORY APPLICATIONS AND PRACTICE, 2006, 13 (02): : 198 - 206