A Study of Evolutionary Algorithm Selection Hyper-Heuristics for the One-Dimensional Bin-Packing Problem
Hyper-heuristics are aimed at providing a generalized solution to optimization problems rather than producing the best result for one or more problem instances. This paper examines the use of evolutionary algorithm (EA) selection hyper-heuristics to solve the offline one-dimensional bin-packing prob...
Main Author: | Nelishia Pillay |
---|---|
Format: | Article |
Language: | English |
Published: |
South African Institute of Computer Scientists and Information Technologists
2012-06-01
|
Series: | South African Computer Journal |
Subjects: | |
Online Access: | http://sacj.cs.uct.ac.za/index.php/sacj/article/view/87 |
Similar Items
-
Intelligent System Design Using Hyper-Heuristics
by: Nelishia Pillay
Published: (2015-07-01) -
An experimental comparison of some heuristics for cardinality constrained bin packing problem
by: Maja Remic, et al.
Published: (2012-01-01) -
Space Splitting and Merging Technique for Online 3-D Bin Packing
by: Thanh-Hung Nguyen, et al.
Published: (2023-04-01) -
An Adaptive Fitness-Dependent Optimizer for the One-Dimensional Bin Packing Problem
by: Diaa Salama Abdul-Minaam, et al.
Published: (2020-01-01) -
Optimizing Heterogeneous Vehicle Routes for Urban Distribution Considering the Three-Dimensional Bin Packing Problem of Electric Meters
by: Zhaolei He, et al.
Published: (2024-01-01)