An Adaptive Large Neighborhood Search for the Maintenance Scheduling and Routing Problem - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2020

An Adaptive Large Neighborhood Search for the Maintenance Scheduling and Routing Problem

Résumé

This work presents a Semi Adaptive Large Neighborhood Search (SALNS) for the Maintenance Scheduling and Routing Problem. A new removal method based on the behavior of risk in maintenance is proposed. It is combined with several destroy and repair operators. A semi adaptive mechanism that ensures effective mix between diversification and learning is proposed. We conduct a comparative analysis with the solver and with adapted algorithms schemes from the literature: classical ALNS and ALNS with learning automata (LA-ALNS). All the algorithms consider the same choices related to problem's specifications and use the same local search procedure. The proposed metaheuristic chooses the most suitable heuristics while alternating between learning and diversification to obtain high quality solutions.
Fichier non déposé

Dates et versions

hal-03106165 , version 1 (11-01-2021)

Identifiants

  • HAL Id : hal-03106165 , version 1

Citer

Lamiaa Dahite, Abdeslam Kadrani, Rachid Benmansour, Rym Nesrine Guibadj, Cyril Fonlupt. An Adaptive Large Neighborhood Search for the Maintenance Scheduling and Routing Problem. 21ème congrès annuel de la société Françise de Recherche opérationnelle et d'Aide à la Décision (ROADEF2020), Laboratoire LIRMM, Université de Montpellier, Feb 2020, Montpellier, France. ⟨hal-03106165⟩
130 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More