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 条
  • [21] Hybrid flower pollination algorithm approach for the two-dimensional bin packing problem
    Gezici, Harun
    Livatyali, Haydar
    JOURNAL OF THE FACULTY OF ENGINEERING AND ARCHITECTURE OF GAZI UNIVERSITY, 2022, 37 (03): : 1523 - 1534
  • [22] 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
  • [23] 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
  • [24] 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
  • [25] TWO-DIMENSIONAL FINITE BIN-PACKING ALGORITHMS
    BERKEY, JO
    WANG, PY
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1987, 38 (05) : 423 - 429
  • [26] New Approximability Results for Two-Dimensional Bin Packing
    Klaus Jansen
    Lars Prädel
    Algorithmica, 2016, 74 : 208 - 269
  • [27] New Approximability Results for Two-Dimensional Bin Packing
    Jansen, Klaus
    Praedel, Lars
    ALGORITHMICA, 2016, 74 (01) : 208 - 269
  • [28] New Approximability Results for Two-Dimensional Bin Packing
    Jansen, Klaus
    Praedel, Lars
    PROCEEDINGS OF THE TWENTY-FOURTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA 2013), 2013, : 919 - 936
  • [29] Approximation algorithms for the two-dimensional bin packing problem
    Lodi, A
    Martello, S
    Vigo, D
    FIRST INTERNATIONAL CONFERENCE ON OPERATIONS AND QUANTITATIVE MANAGEMENT, VOL 1 AND 2, 1997, : 177 - 184
  • [30] Just-in-time two-dimensional bin packing *
    Polyakovskiy, Sergey
    M'Hallah, Rym
    OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2021, 102
12345