An effective resolution algorithm for the two dimensional bin packing problem

被引：0
|
作者：
Zhou, Yuyu [1 ]
Rao, Yunqing [1 ]
Zhang, Chaoyong [1 ]
Zhang, Guojun [1 ]
机构：
[1] Jinan Univ, Inst Intellectual Property Rights & Rule Law, Guangzhou, Guangdong, Peoples R China
来源：
MATERIALS PROCESSING TECHNOLOGY, PTS 1-4 | 2011年 / 291-294卷
关键词：
two dimensional bin packing problem; Genetic algorithm; Tabu search; Hybrid;
D O I：
10.4028/www.scientific.net/AMR.291-294.2574
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
We address a two dimensional bin packing problem in this paper. Firstly, we adopt and improve bottom left placement method, which is presented as bottom left corner-occupying (BLCO). Secondly, borrowing from the respective advantages of the two algorithms, a hybrid of genetic algorithm (GA) and tabu search (TS), is developed to solve the problem. Thirdly, using a new neighborhood structure combined with the appropriate move evaluation strategy, we propose TS to re-intensify search from the promising solutions. The hybrid OATS is tested on a set of instances taken from the literature and the computation results validate the quality of the solutions.
引用
收藏
页码：2574 / 2578
页数：5
相关论文
共 50 条
  • [1] 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
  • [2] An effective heuristic for the two-dimensional irregular bin packing problem
    Eunice López-Camacho
    Gabriela Ochoa
    Hugo Terashima-Marín
    Edmund K. Burke
    Annals of Operations Research, 2013, 206 : 241 - 264
  • [3] An effective heuristic for the two-dimensional irregular bin packing problem
    Lopez-Camacho, Eunice
    Ochoa, Gabriela
    Terashima-Marin, Hugo
    Burke, Edmund K.
    ANNALS OF OPERATIONS RESEARCH, 2013, 206 (01) : 241 - 264
  • [4] Genetic Algorithms for Two Dimensional Bin Packing Problem
    Volna, Eva
    PROCEEDINGS OF THE INTERNATIONAL CONFERENCE OF NUMERICAL ANALYSIS AND APPLIED MATHEMATICS 2014 (ICNAAM-2014), 2015, 1648
  • [5] The Two Dimensional Bin Packing Problem with Side Constraints
    Seizinger, Markus
    OPERATIONS RESEARCH PROCEEDINGS 2017, 2018, : 45 - 50
  • [6] 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
  • [7] 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
  • [8] 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
  • [9] 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
  • [10] 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
12345