Optimization Model of Maintenance Scheduling Problem for Heritage Buildings with Constraint Programming

Abstract

The preservation and maintenance of ancient buildings, particularly heritage buildings, is a complex process that requires careful consideration of several aspects, including maintenance plans and budget availability. An effective long-term maintenance plan is crucial for preserving the historical value and condition of these buildings. The primary purpose of such a plan is to limit building deterioration, maintain optimal building performance, minimize operational costs and ensure budget constraints are met. This study introduces an innovative methodology to optimize maintenance strategies for heritage buildings in various scenarios, including normal conditions and the aftermath of possible catastrophic events. The proposed methodology compares different parameters, such as building conditions, building service life and various types of maintenance interventions. However, budget availability poses a significant challenge in many case studies, and addressing budgetary constraints is notoriously difficult. Limited budgets may hinder the implementation of desired maintenance activities, necessitating optimization of the maintenance plan to overcome these issues. To address these challenges, this study utilizes constraint programming (CP) as an optimization tool. Constraint programming is a powerful optimization methodology that addresses combinatorial problems by formulating them as mathematical models and handling the associated constraints. By representing the problem as one or more instances of the Constraint Satisfaction Problem (CSP), constraint programming enables efficient and effective problem solving. The proposed CP model proves to be a valuable tool in solving maintenance scheduling problems for heritage buildings. The results of this study are intended to assist decision makers in developing long-term maintenance plans for heritage building preservation.