A Weight Annealing Algorithm for Solving Two-dimensional Bin Packing Problems

被引：5
|
作者：
Loh, Kok-Hua [1 ]
Golden, Bruce [2 ]
Wasil, Edward [3 ]
机构：
[1] Nanyang Technol Univ, Sch Mech & Aerosp Engn, Singapore 639798, Singapore
[2] Univ Maryland, Dept Decis & Informat Technol, Robert H Smith Sch Business, College Pk, MD 20742 USA
[3] Amer Univ, Kogod Sch Business, Washington, DC 20016 USA
来源：
OPERATIONS RESEARCH AND CYBER-INFRASTRUCTURE | 2009年
关键词：
Two-dimensional bin packing; weight annealing; heuristics;
D O I：
10.1007/978-0-387-88843-9_7
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
Weight annealing is a metaheuristic that has been recently proposed in the physics literature. We develop a weight annealing-based algorithm for solving four variants of the two-dimensional bin packing problem. We apply our algorithm to 500 benchmark instances and find that it quickly produces very high-quality solutions that are comparable to the best published results.
引用
下载
收藏
页码：121 / +
页数：3
相关论文
共 50 条
  • [31] Hybrid genetic algorithm and simulated annealing for two-dimensional non-guillotine rectangular packing problems
    Soke, Alev
    Bingul, Zafer
    ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2006, 19 (05) : 557 - 567
  • [32] Two-dimensional Bin Packing Problem in batch scheduling
    Koblasa, Frantisek
    Vavrousek, Miroslav
    Manlig, Frantisek
    33RD INTERNATIONAL CONFERENCE MATHEMATICAL METHODS IN ECONOMICS (MME 2015), 2015, : 354 - 359
  • [33] HEURISTICS WITH STOCHASTIC NEIGHBORHOOD STRUCTURES FOR TWO-DIMENSIONAL BIN PACKING AND CUTTING STOCK PROBLEMS
    Chan, T. M.
    Alvelos, Filipe
    Silva, Elsa
    Valerio De Carvalho, J. M.
    ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2011, 28 (02) : 255 - 278
  • [34] Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem
    Pisinger, David
    Sigurd, Mikkel
    INFORMS JOURNAL ON COMPUTING, 2007, 19 (01) : 36 - 51
  • [35] Heuristic algorithm for three-dimensional bin packing problems
    Tang, Xiao-Jun
    Cha, Jian-Zhong
    Tiedao Xuebao/Journal of the China Railway Society, 2003, 25 (06):
  • [36] Two-dimensional bin packing with one-dimensional resource augmentation
    Bansal, Nikhil
    Sviridenko, Maxim
    DISCRETE OPTIMIZATION, 2007, 4 (02) : 143 - 153
  • [37] A heuristic for solving large bin packing problems in two and three dimensions
    Mack, Daniel
    Bortfeldt, Andreas
    CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH, 2012, 20 (02) : 337 - 354
  • [38] A heuristic for solving large bin packing problems in two and three dimensions
    Daniel Mack
    Andreas Bortfeldt
    Central European Journal of Operations Research, 2012, 20 : 337 - 354
  • [39] A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem
    Leung, Stephen C. H.
    Zhang, Defu
    Zhou, Changle
    Wu, Tao
    COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (01) : 64 - 73
  • [40] A hybrid simulated-annealing algorithm for two-dimensional strip packing problem
    Dereli, Turkay
    Das, Guiesin Sena
    ADAPTIVE AND NATURAL COMPUTING ALGORITHMS, PT 1, 2007, 4431 : 508 - +
12345