Applying Gene Expression Programming for Solving One-Dimensional Bin-Packing Problems
This work aims to study and explore the use of Gene Expression Programming (GEP) in solving 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 consid...
Saved in:
| Main Author: | Najla Al-Saati |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Mosul University
2013-12-01
|
| Series: | Al-Rafidain Journal of Computer Sciences and Mathematics |
| Subjects: | |
| Online Access: | https://csmj.mosuljournals.com/article_163549_1b5d0590c28a530965983ab6407d6a78.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A steady state micro genetic algorithm for hyper-heuristic generation in one-dimensional bin packing
by: Julio Juárez, et al.
Published: (2025-07-01) -
Solution of Bin Packing Instances in Falkenauer T Class: Not So Hard
by: György Dósa, et al.
Published: (2025-02-01) -
An off-line dual maximum resource bin packing model for solving the maintenance problem in the aviation industry
by: George Cristian Gruia, et al.
Published: (2013-05-01) -
A three-stage layer-based heuristic to solve the 3D bin-packing problem under balancing constraint
by: Youssef Harrath
Published: (2022-09-01) -
An Experimental Study of Strategies to Control Diversity in Grouping Mutation Operators: An Improvement to the Adaptive Mutation Operator for the GGA-CGT for the Bin Packing Problem
by: Stephanie Amador-Larrea, et al.
Published: (2025-03-01)