A simulated annealing-based approach for the optimization of routine maintenance interventions

TitleA simulated annealing-based approach for the optimization of routine maintenance interventions
Publication TypeBook Chapter
Year of Publication2015
AuthorsLongo, F., A. Lotronto, M. Scarpa, and A. Puliafito
Book TitleLecture Notes in Business Information Processing
Volume241
Pagination256-279
PublisherSpringer Verlag
ISBN Number9783319291321
ISBN18651348
KeywordsCost of transportation, Industrial use case, Information systems, Maintenance, Meta-heuristic approach, Optimization, Optimization problems, parameter estimation, Physical phenomena, Problem solving, Routine maintenance, Scheduling, Scheduling problem, Simulated annealing, Solution algorithms
Abstract

Metaheuristics are often adopted to solve optimization problems where some requests need to be scheduled among a finite number of resources, i. e., the so called scheduling problems. Such techniques approach the optimization problems by taking inspiration from a certain physical phenomenon. Simulated annealing is a metaheuristic approach inspired to the controlled cooling of a material from a high temperature to a state in which internal defects of the crystals are minimized. In this paper, we use a simulated annealing-based approach to solve the problem of the scheduling of geographically distributed routine maintenance interventions. Each intervention has to be assigned to a maintenance team and the choice among the available teams and the order in which interventions are performed by each team are based on team skills, cost of overtime work, and cost of transportation. We compare our solution algorithm versus an exhaustive approach. First, we consider a real industrial use case and show several numerical results to analyze the effect of the parameters of the simulated annealing on the accuracy of the solution and on the execution time of the algorithm. Then, we provide results varying the parameters and dimension of the considered problem highlighting how they affect reliability and efficiency of our algorithm. © Springer International Publishing Switzerland 2015.

URLhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84958970833&doi=10.1007%2f978-3-319-29133-8_13&partnerID=40&md5=38ef9117d84652f8dfd7526db0dba19c
DOI10.1007/978-3-319-29133-8_13