An improved nature inspired meta-heuristic algorithm for 1-D bin packing problems

被引:46
作者
Abdel-Basset, Mohamed [1 ]
Manogaran, Gunasekaran [2 ]
Abdel-Fatah, Laila [1 ]
Mirjalili, Seyedali [3 ]
机构
[1] Zagazig Univ, Fac Comp & Informat, Dept Operat Res, Zagazig, Egypt
[2] Univ Calif Davis, Davis, CA 95616 USA
[3] Griffith Univ, Inst Integrated & Intelligent Syst, Nathan Campus, Brisbane, Qld 4111, Australia
关键词
Bin packing problem; Whale optimization algorithm; Best fit algorithm; Meta-heuristic; OPTIMIZATION; BEHAVIOR; SEARCH; COLONY; WHALE;
D O I
10.1007/s00779-018-1132-7
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Bin packing problem(BPP) is a classical combinatorial optimization problem widely used in a wide range of fields. The main aim of this paper is to propose a new variant of whale optimization algorithm named improved Levy-based whale optimization algorithm (ILWOA). The proposed ILWOA adapts it to search the combinatorial search space of BPP problems. The performance of ILWOA is evaluated through two experiments on benchmarks with varying difficulty and BPP case studies. The experimental results confirm the prosperity of the proposed algorithmin proficiency to find the optimal solution and convergence speed. Further, the obtained results are discussed and analyzed according to the problem size.
引用
收藏
页码:1117 / 1132
页数:16
相关论文
共 63 条
  • [1] WORST-CASE ANALYSIS OF HEURISTICS FOR THE BIN PACKING PROBLEM WITH GENERAL COST STRUCTURES
    ANILY, S
    BRAMEL, J
    SIMCHILEVI, D
    [J]. OPERATIONS RESEARCH, 1994, 42 (02) : 287 - 298
  • [2] [Anonymous], THESIS
  • [3] [Anonymous], 1995, COMPUTERS THOUGHT
  • [4] [Anonymous], J GLOB RES COMPUT SC
  • [5] [Anonymous], 2016, ROBOTICS CLOUD COMPU
  • [6] [Anonymous], 2011, INT ENCY STAT SCI, DOI [DOI 10.1007/978-3-642-04898-2_420, 10.1007/978-3-642-04898-2_420]
  • [7] [Anonymous], TECH REP
  • [8] [Anonymous], P 65 ISERD INT C
  • [9] [Anonymous], IFAC P
  • [10] [Anonymous], 1998, COMBINATORIAL OPTIMI