A Novel Quantum Inspired Cuckoo Search Algorithm for Bin Packing Problem

The Bin Packing Problem (BPP) is one of the most known combinatorial optimization problems. This problem consists to pack a set of items into a minimum number of bins. There are several variants of this problem; the most basic problem is the one- dimensional bin packing problem (1-BPP). In this paper, we present a new approach based on the quantum inspired cuckoo search algorithm to deal with the 1- BPP problem. The contribution consists in defining an appropriate quantum representation based on qubit representation to represent bin packing solutions. The second contribution is proposition of a new hybrid quantum measure operation which uses first fit heuristic to pack no filled objects by the standard measure operation. The obtained results are very encouraging and show the feasibility and effectiveness of the proposed approach.