Providing a memory mechanism to enhance the evolutionary design of heuristics

Citation

Burke E, Hyde M & Kendall G (2010) Providing a memory mechanism to enhance the evolutionary design of heuristics. In: 2010 IEEE Congress on Evolutionary Computation, CEC 2010. 2010 IEEE Congress on Evolutionary Computation, CEC 2010, Barcelona, Spain, 18.07.2010-23.07.2010. Red Hook, NJ, USA: IEEE. http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=5586388&abstractAccess=no&userType=; https://doi.org/10.1109/CEC.2010.5586388

Abstract
Genetic programming approaches have previously been employed in the literature to evolve heuristics for various combinatorial optimisation problems. This paper presents a hyper-heuristic genetic programming methodology to evolve more sophisticated one dimensional bin packing heuristics than have been evolved previously. The heuristics have access to a memory, which allows them to make decisions with some knowledge of their potential future impact. In contrast to previously evolved heuristics for this problem, we show that these heuristics evolve to draw upon this memory in order to facilitate better planning, and improved packings. This fundamental difference enables an evolved heuristic to represent a dynamic packing strategy rather than a fixed packing strategy. A heuristic can change its behaviour depending on the characteristics of the pieces it has seen before, because it has evolved to draw upon its experience.

Keywords
bin packing; combinatorial mathematics; optimisation