The ALNS metaheuristic for the maintenance scheduling problem

1Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Transmission maintenance scheduling (TMS) is an important optimization problem in the electricity distribution industry, with numerous variants studied and methods proposed over the last three decades. The ROADEF challenge 2020 addresses a novel version of the TMS problem, which stands out by having multiple time-dependent properties, constraints, and a risk-based aggregate objective function. Therefore, the problem is more complex than the previous formulations, and the existing methods are not directly applicable. This paper presents a method based on the Adaptive Large Neighborhood Search metaheuristic. The method is compared with the best-known solutions from the challenge qualification phase, in which more than 70 teams participated. The result shows that the method yields consistent performance over the whole dataset, as the method finds the best-known solutions for half of the dataset and finds solutions consistently within 5h gap.

Cite

CITATION STYLE

APA

Woller, D., & Kulich, M. (2021). The ALNS metaheuristic for the maintenance scheduling problem. In Proceedings of the 18th International Conference on Informatics in Control, Automation and Robotics, ICINCO 2021 (pp. 156–164). SciTePress. https://doi.org/10.5220/0010552101560164

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free