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...
Main Author: | Najla Al-Saati |
---|---|
Format: | Article |
Language: | Arabic |
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 |
Similar Items
-
Metaheuristic algorithms for one-dimensional bin-packing problems: A survey of recent advances and applications
by: Munien Chanaleä, et al.
Published: (2021-04-01) -
Material Requirements Planning Using Variable-Sized Bin-Packing Problem Formulation with Due Date and Grouping Constraints
by: Dejan Gradišar, et al.
Published: (2020-10-01) -
Rectangular Bin-Packing Problem: a computational evaluation of 4 heuristics algorithms
by: Duarte Nuno Gonçalves Ferreira
Published: (2015-10-01) -
A Construction Heuristic for the Bin-Packing Problem with Time Windows: A Case Study in Thailand
by: Wisute Ongcunaruk, et al.
Published: (2021-04-01) -
Harmony search algorithm with adaptive parameter setting for solving large bin packing problems
by: Amol C. Adamuthe, et al.
Published: (2020-09-01)