Intensification, diversification, and learning via relaxation adaptive memory programming: a case study on resource constrained project scheduling

• Published in: Journal of heuristics 2019-10, Vol.25 (4-5), p.793-807
• Main Authors: Riley, R. Christopher L., Rego, Cesar
• Format: Article
• Language: English
• Subjects: Amplification; Artificial Intelligence; Calculus of Variations and Optimal Control; Optimization; Diversification; Heuristic methods; Learning; Management Science; Mathematics; Mathematics and Statistics; Operations Research; Operations Research/Decision Theory; Production scheduling; Programming; Project management; Resource scheduling; Search algorithms; Tabu search
• ISSN: 1381-1231; 1572-9397
• DOI: 10.1007/s10732-018-9368-y

Learning , clearly, can only occur in the presence of memory. Moreover, intensification and diversification strategies are widely recognized for their importance in the metaheuristics literature as the building blocks for adaptive memory programming (AMP). It is safe to say that any metaheuristic approach that isn’t blindly mechanistic uses some sort of adaptive memory to guide the search beyond local optimality, during which intensification and diversification always take place explicitly or implicitly. From this perspective, adaptive memory lies in the heart of what may be generally called the intensification, diversification, and learning (IDL) triangle. This paper focuses on the importance of solution landscape information in the design of AMP structures based on the IDL triangle. More specifically, we argue that a metaheuristic algorithm can only perform as good as the quality of information it is provided about the search space. To illustrate, we consider the computationally intractable Resource Constrained Project Scheduling Problem as a benchmark and take the approach of adding Lagrangian dual information to a rudimentary tabu search approach and integrate the two approaches via the Relaxation Adaptive Memory Programming (RAMP) framework. We show that while our simple tabu search component alone is not competitive with the best performing tabu search algorithms of the literature, when dual information is added to the procedure the resulting integrated RAMP algorithm outperforms all of them, thus supporting our premise.