An improved nature inspired meta-heuristic algorithm for 1-D bin packing problems
Author(s)
Abdel-Basset, Mohamed
Manogaran, Gunasekaran
Abdel-Fatah, Laila
Mirjalili, Seyedali
Griffith University Author(s)
Year published
2018
Metadata
Show full item recordAbstract
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 Lévy-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 algorithm in proficiency to find the optimal solution and convergence speed. Further, the ...
View more >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 Lévy-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 algorithm in proficiency to find the optimal solution and convergence speed. Further, the obtained results are discussed and analyzed according to the problem size.
View less >
View more >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 Lévy-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 algorithm in proficiency to find the optimal solution and convergence speed. Further, the obtained results are discussed and analyzed according to the problem size.
View less >
Journal Title
Personal and Ubiquitous Computing
Note
This publication has been entered into Griffith Research Online as an Advanced Online Version.
Subject
Design