Optimization of Maintenance Planning and Routing Problems
| Autor: | Rachid Benmansour, Abdeslam Kadrani, Lamiaa Dahite, Rym Nesrine Guibadj, Cyril Fonlupt |
|---|---|
| Přispěvatelé: | Laboratoire d'Informatique Signal et Image de la Côte d'Opale (LISIC), Université du Littoral Côte d'Opale (ULCO), Institut National de Statistique et d’Economie Appliquée [Rabat] (INSEA), Rachid Benmansour, Angelo Sifaleras, Nenad Mladenović |
| Rok vydání: | 2020 |
| Předmět: |
0209 industrial biotechnology
021103 operations research Operations research Random failures Computer science Heuristic (computer science) Variable Neighborhood Search 0211 other engineering and technologies Variable Neighborhood Descent [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO] 02 engineering and technology Service provider Constructive 020901 industrial engineering & automation Vehicle routing problem Service level Heuristics Routing (electronic design automation) Time based maintenance Variable neighborhood search |
| Zdroj: | Variable Neighborhood Search ISBN: 9783030449315 ICVNS Variable Neighborhood Search. ICVNS 2019. Rachid Benmansour, Angelo Sifaleras, Nenad Mladenović. Variable Neighborhood Search. ICVNS 2019., vol 12010, Springer, Cham., pp.95-111, 2020, Lecture Notes in Computer Science, ⟨10.1007/978-3-030-44932-2_7⟩ |
| DOI: | 10.1007/978-3-030-44932-2_7 |
| Popis: | International audience; This paper addresses a problem that maintenance service providers often face: determining the best routing-maintenance policy for all technicians and machines. It consists of defining for each technician the sequence of the maintenance operations to perform so that the total expected costs are minimized while maintaining a high service level on machines availability. We propose in this paper a mathematical model with different objective functions which integrates both routing and maintenance considerations. To solve the problem, we propose constructive and improvement heuristics and a Variable Neighborhood Search that uses sequentially different neighborhood structures. The performance of our algorithms is evaluated using new generated instances. Results provide strong evidence of the effectiveness of our heuristic approach. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|