Algorithm For Bin Packing Problem Research Articles

Overview

4 Articles

Published in last 50 years

Articles published on Algorithm For Bin Packing Problem

4 Search results

Fast Non-dominated Sorting in Multi Objective Genetic Algorithm for Bin Packing Problem

The bin packing problem is a problem where goods with different volumes and dimensions are put into a container so that the volume of goods inserted is maximized. The problem of multi-objective bin packing is a problem that is more commonly found in everyday life, because what is considered in packing is usually not only volume.In this research, a multi-objective genetic algorithm is proposed to solve the multi-objective bin packing problem. The proposed genetic algorithm uses non-dominated sorting and crowding distance methods to get the best solution for each objective and to avoid bias. The algorithm is then tested with several test classes that represent different combinations of item and container sizes.From the results of the tests carried out, it was found that the proposed algorithm can find several solutions which are the best candidate solutions for each objective. Also found how the correlation of each objective in the population.

Open Access

IJCCS (Indonesian Journal of Computing and Cybernetics Systems)

Jan 31, 2022
Muhammad Bintang Bahy + 1

Read Paper

Bin Packing Problem: A Linear Constantspace 3/2 - Approximation Algorithm

Since the Bin Packing Problem (BPP) is one of the main NP-hard problems, a lot of approximation algorithms have been suggested for it. It has been proven that the best algorithm for BPP has the approximation ratio of 3/2 and the time order of O(n), unless P=NP. In the current paper, a linear 3/2-approximation algorithm is presented. The suggested algorithm not only has the best possible theoretical factors, approximation ratio, space order, and time order, but also outperforms the other approximation algorithms according to the experimental results, therefore, we are able to draw the conclusion that the algorithms is the best approximation algorithm which has been presented for the problem until now. Key words: Approximation Algorithm, Bin Packing Problem, Approximation Ratio, NP-hard.

Open Access

International Journal on Computational Science & Applications

Dec 31, 2015
Abdolahad Noori Zehmakan

Read Paper

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.

Open Access