Genetic programming: on the programming of computers by means of natural selection
Genetic programming: on the programming of computers by means of natural selection
BISON: a fast hybrid procedure for exactly solving the one-dimensional bin packing problem
Computers and Operations Research
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Heuristic Solution of Open Bin Packing Problems
Journal of Heuristics
Hyper-heuristics: Learning To Combine Simple Heuristics In Bin-packing Problems
GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
A Hyperheuristic Approach to Scheduling a Sales Summit
PATAT '00 Selected papers from the Third International Conference on Practice and Theory of Automated Timetabling III
A Self Organizing Bin Packing Heuristic
ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
Cooperative Coevolution: An Architecture for Evolving Coadapted Subcomponents
Evolutionary Computation
On the Sum-of-Squares algorithm for bin packing
Journal of the ACM (JACM)
High performance ATP systems by combining several AI methods
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
Evolving bin packing heuristics with genetic programming
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Automating the packing heuristic design process with genetic programming
Evolutionary Computation
A new, node-focused model for genetic programming
EuroGP'12 Proceedings of the 15th European conference on Genetic Programming
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part II
Single node genetic programming on problems with side effects
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part I
Hi-index | 0.00 |
Novel deterministic heuristics are generated using Single Node Genetic Programming for application to the One Dimensional Bin Packing Problem. First a single deterministic heuristic was evolved that minimised the total number of bins used when applied to a set of 685 training instances. Following this, a set of heuristics were evolved using a form of cooperative co-evolution that collectively minimise the number of bins used across the same set of problems. Results on an unseen test set comprising a further 685 problem instances show that the single evolved heuristic outperforms existing deterministic heuristics described in the literature. The collection of heuristics evolved by cooperative co-evolution outperforms any of the single heuristics, including the newly generated ones.