Applying Gene Expression Programming for Solving One-Dimensional Bin-Packing Problems

01/13/2020
by   Najla Akram Al-Saati, et al.
0

This work aims to study and explore the use of Gene Expression Programming (GEP) in solving the on-line Bin-Packing problem. The main idea is to show how GEP can automatically find acceptable heuristic rules to solve the problem efficiently and economically. One dimensional Bin-Packing problem is considered in the course of this work with the constraint of minimizing the number of bins filled with the given pieces. Experimental Data includes instances of benchmark test data taken from Falkenauer (1996) for One-dimensional Bin-Packing Problems. Results show that GEP can be used as a very powerful and flexible tool for finding interesting compact rules suited for the problem. The impact of functions is also investigated to show how they can affect and influence the success of rates when they appear in rules. High success rates are gained with smaller population size and fewer generations compared to previous work performed using Genetic Programming.

READ FULL TEXT
10/10/2012

Comparing several heuristics for a packing problem

Packing problems are in general NP-hard, even for simple cases. Since no...
02/09/2019

Fast Approximation Schemes for Bin Packing

We present new approximation schemes for bin packing based on the follow...
02/25/2001

Gene Expression Programming: a New Adaptive Algorithm for Solving Problems

Gene expression programming, a genotype/phenotype genetic algorithm (lin...
02/17/2020

Density of Binary Compact Disc Packings

A disc packing in the plane is compact if its contact graph is a triangu...
11/21/2017

Approximation Algorithms for Rectangle Packing Problems (PhD Thesis)

In rectangle packing problems we are given the task of placing axis-alig...
01/23/2017

Constraint programming for planning test campaigns of communications satellites

The payload of communications satellites must go through a series of tes...
12/09/2020

COMPACT: Concurrent or Ordered Matrix-based Packing Arrangement Computation Technique

Packing optimization is a prevalent problem that necessitates robust and...