Evolutionary based heuristic for bin packing problem

被引：37
|
作者：
Stawowy, Adam [1 ]
机构：
[1] AGH Univ Sci & Technol, Fac Management, PL-30067 Krakow, Poland
来源：
COMPUTERS & INDUSTRIAL ENGINEERING | 2008年 / 55卷 / 02期
关键词：
Bin packing; Evolutionary algorithms; Heuristics;
D O I：
10.1016/j.cie.2008.01.007
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
In this paper, we investigate the use of evolutionary based heuristic to the one-dimensional bin packing problem (BPP). Unlike other evolutionary heuristics used with optimization problems, a non-specialized and non-hybridized algorithm is proposed and analyzed for solving BPP. The algorithm uses a modified permutation with separators encoding scheme, unique concept of separators' movements during mutation, and separators removal as a technique of problem size reduction. The set of experiments confirmed that the proposed approach is comparable to much more complicated algorithms. (C) 2008 Elsevier Ltd. All rights reserved.
引用
收藏
页码：465 / 474
页数：10
相关论文
共 50 条
  • [31] An evolutionary algorithm based hyper-heuristic framework for the set packing problem
    Chaurasia, Sachchida Nand
    Kim, Joong Hoon
    [J]. INFORMATION SCIENCES, 2019, 505 : 1 - 31
  • [32] A self organizing bin packing heuristic
    Csirik, J
    Johnson, DS
    Kenyon, C
    Shor, PW
    Weber, RR
    [J]. ALGORITHM ENGINEERING AND EXPERIMENTATION, 1999, 1619 : 246 - 265
  • [33] A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts
    Charalambous, Christoforos
    Fleszar, Krzysztof
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2011, 38 (10) : 1443 - 1451
  • [34] Improvement Heuristic For Solving The One-Dimensional Bin-Packing Problem
    Abidi, Sofiene
    Krichen, Saoussen
    Alba, Enrique
    Molina, Juan M.
    [J]. 2013 5TH INTERNATIONAL CONFERENCE ON MODELING, SIMULATION AND APPLIED OPTIMIZATION (ICMSAO), 2013,
  • [35] New heuristic algorithm for the one-dimensional bin-packing problem
    Gupta, Jatinder N. D.
    Ho, Johnny C.
    [J]. Production Planning and Control, 1999, 10 (06): : 598 - 603
  • [36] Solving the one-dimensional bin packing problem with a weight annealing heuristic
    Loh, Kok-Flua
    Golden, Bruce
    Wasil, Edward
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (07) : 2283 - 2291
  • [37] A new heuristic algorithm for the one-dimensional bin-packing problem
    Gupta, JND
    Ho, JC
    [J]. PRODUCTION PLANNING & CONTROL, 1999, 10 (06) : 598 - 603
  • [38] A Greedy Heuristic Based on Corner Occupying Action for the 2D Circular Bin Packing Problem
    He, Kun
    Dosh, Mohammed
    [J]. THEORETICAL COMPUTER SCIENCE, NCTCS 2017, 2017, 768 : 75 - 85
  • [39] Evolutionary Algorithms for Bin Packing Problem with Maximum Lateness and Waste Minimization
    Quesada, Jesus
    Gil-Gala, Francisco J.
    Durasevic, Marko
    Sierra, Maria R.
    Varela, Ramiro
    [J]. BIOINSPIRED SYSTEMS FOR TRANSLATIONAL APPLICATIONS: FROM ROBOTICS TO SOCIAL ENGINEERING, PT II, IWINAC 2024, 2024, 14675 : 140 - 149
  • [40] A dynamic programming-based heuristic for the variable sized two-dimensional bin packing problem
    Liu, Ya
    Chu, Chengbin
    Wang, Kanliang
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2011, 49 (13) : 3815 - 3831
12345