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

Mohamed Abdel-Basset; Gunasekaran Manogaran; Laila Abdel-Fatah; Seyedali Mirjalili

doi:10.1007/s00779-018-1132-7

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

Mohamed Abdel-Basset, Gunasekaran Manogaran, Laila Abdel-Fatah, Seyedali Mirjalili

Research output: Contribution to journal › Article › peer-review

68 Citations (Scopus)

Abstract

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.

Original language	English
Pages (from-to)	1117-1132
Number of pages	16
Journal	Personal and Ubiquitous Computing
Volume	22
Issue number	5-6
DOIs	https://doi.org/10.1007/s00779-018-1132-7
Publication status	Published - 1 Oct 2018
Externally published	Yes

Keywords

Best fit algorithm
Bin packing problem
Meta-heuristic
Whale optimization algorithm

Access to Document

10.1007/s00779-018-1132-7

Cite this

@article{38a9bcf0994745e68c45842b51eaca6f,

title = "An improved nature inspired meta-heuristic algorithm for 1-D bin packing problems",

abstract = "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{\'e}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.",

keywords = "Best fit algorithm, Bin packing problem, Meta-heuristic, Whale optimization algorithm",

author = "Mohamed Abdel-Basset and Gunasekaran Manogaran and Laila Abdel-Fatah and Seyedali Mirjalili",

year = "2018",

month = oct,

day = "1",

doi = "10.1007/s00779-018-1132-7",

language = "English",

volume = "22",

pages = "1117--1132",

journal = "Personal and Ubiquitous Computing",

issn = "1617-4909",

publisher = "Springer London",

number = "5-6",

}

TY - JOUR

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

AU - Abdel-Basset, Mohamed

AU - Manogaran, Gunasekaran

AU - Abdel-Fatah, Laila

AU - Mirjalili, Seyedali

PY - 2018/10/1

Y1 - 2018/10/1

N2 - 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.

AB - 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.

KW - Best fit algorithm

KW - Bin packing problem

KW - Meta-heuristic

KW - Whale optimization algorithm

UR - http://www.scopus.com/inward/record.url?scp=85044381103&partnerID=8YFLogxK

U2 - 10.1007/s00779-018-1132-7

DO - 10.1007/s00779-018-1132-7

M3 - Article

AN - SCOPUS:85044381103

SN - 1617-4909

VL - 22

SP - 1117

EP - 1132

JO - Personal and Ubiquitous Computing

JF - Personal and Ubiquitous Computing

IS - 5-6

ER -

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

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this