A hybrid Harmony search algorithm with variable neighbourhood search for the bin-packing problem

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

This paper proposes a hybrid Harmony Search algorithm for the bin-packing problem. The bin-packing problem is a well-known NP-Hard optimization problem. The proposed algorithm (called BPHS) combines a harmony search algorithm, that employs a tournament selection in the generation of new candidate solutions, with a variable neighbourhood search to improve the exploitation ability of the algorithm. The BPHS algorithm has been successfully applied to different instances of the bin-packing problem and it is able to find optimal or near-optimal solutions.

Original languageEnglish
Title of host publication2014 6th World Congress on Nature and Biologically Inspired Computing, NaBIC 2014
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1-6
Number of pages6
ISBN (Electronic)9781479959372
DOIs
Publication statusPublished - 12 Oct 2014
Event2014 6th World Congress on Nature and Biologically Inspired Computing, NaBIC 2014 - Porto, Portugal
Duration: 30 Jul 20141 Aug 2014

Publication series

Name2014 6th World Congress on Nature and Biologically Inspired Computing, NaBIC 2014

Conference

Conference2014 6th World Congress on Nature and Biologically Inspired Computing, NaBIC 2014
Country/TerritoryPortugal
CityPorto
Period30/07/141/08/14

Keywords

  • Bin-Packing
  • Harmony Search
  • Hybrid Algorithm
  • Variable Neighbourhood Search

Fingerprint

Dive into the research topics of 'A hybrid Harmony search algorithm with variable neighbourhood search for the bin-packing problem'. Together they form a unique fingerprint.

Cite this