A new heuristic algorithm for a class of two-dimensional bin-packing problems

被引：0
|
作者：
Ya Liu
Chengbin Chu
Kanliang Wang
机构：
[1] UTT-LOSI,Department of Management Science & Engineering, School of Business
[2] Ecole Centrale Paris-LGI,undefined
[3] Renmin University of China,undefined
来源：
The International Journal of Advanced Manufacturing Technology | 2011年 / 57卷
关键词：
Bin packing; Dynamic programming; Set partitioning;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Due to the diversification of customer’ demands, cutting and packing enterprises need to arrange production plans flexibly. This paper proposes a heuristic algorithm to help enterprises make cutting or packing plans. With this algorithm, a class of different customer demands are considered, such as orientation of items and cutting style. The idea of this heuristic algorithm is from the dynamic programming idea by aggregating states to avoid the explosion of the number of states. The advantages of this algorithm are its flexibility, competitive computation time, and performance with respect to metaheuristics.
引用
收藏
页码：1235 / 1244
页数：9
相关论文
共 50 条
  • [1] A new heuristic algorithm for a class of two-dimensional bin-packing problems
    Liu, Ya
    Chu, Chengbin
    Wang, Kanliang
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2011, 57 (9-12): : 1235 - 1244
  • [2] Sequential heuristic for the two-dimensional bin-packing problem
    Cui, Yi-Ping
    Cui, Yaodong
    Tang, Tianbing
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2015, 240 (01) : 43 - 53
  • [3] New resolution algorithm and pretreatments for the two-dimensional bin-packing problem
    El Hayek, Joseph
    Moukrim, Aziz
    Negre, Stephane
    COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (10) : 3184 - 3201
  • [4] A New Memetic Algorithm for the Two-Dimensional Bin-Packing Problem with Rotations
    Fernandez, A.
    Gil, C.
    Marquez, A. L.
    Banos, R.
    Montoya, M. G.
    Alcayde, A.
    DISTRIBUTED COMPUTING AND ARTIFICIAL INTELLIGENCE, 2010, 79 : 541 - 548
  • [5] Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems
    Lodi, A
    Martello, S
    Vigo, D
    INFORMS JOURNAL ON COMPUTING, 1999, 11 (04) : 345 - 357
  • [6] New heuristic algorithm for the one-dimensional bin-packing problem
    Gupta, Jatinder N. D.
    Ho, Johnny C.
    Production Planning and Control, 1999, 10 (06): : 598 - 603
  • [7] A new heuristic algorithm for the one-dimensional bin-packing problem
    Gupta, JND
    Ho, JC
    PRODUCTION PLANNING & CONTROL, 1999, 10 (06) : 598 - 603
  • [8] TWO-DIMENSIONAL FINITE BIN-PACKING ALGORITHMS
    BERKEY, JO
    WANG, PY
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1987, 38 (05) : 423 - 429
  • [9] A Memetic Algorithm for the Two-Dimensional Bin-Packing Problem with Partial Conflicts
    Hamdi-Dhaoui, Khaoula
    Labadie, Nacima
    Yalaoui, Alice
    PROCEEDINGS OF INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND SYSTEMS MANAGEMENT (IESM'2011): INNOVATIVE APPROACHES AND TECHNOLOGIES FOR NETWORKED MANUFACTURING ENTERPRISES MANAGEMENT, 2011, : 371 - 379
  • [10] A two-dimensional bin-packing problem with conflict penalties
    Li, Kunpeng
    Liu, Hailan
    Wu, Yong
    Xu, Xianhao
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2014, 52 (24) : 7223 - 7238
12345