On the Dynamic Technician Routing and Scheduling Problem - Archive ouverte HAL Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2012

On the Dynamic Technician Routing and Scheduling Problem

Résumé

The Technician Routing and Scheduling Problem (TRSP) consists in routing staff to serve requests for service, taking into account time windows, skills, tools, and spare parts. Typical applications include maintenance operations and staff routing in telecoms, public utilities, and in the health care industry. In this paper we tackle the Dynamic TRSP (D-TRSP) in which new requests appear over time. We propose a fast reoptimization approach based on a parallel Adaptive Large Neighborhood Search (pALNS) and a Multiple Plan Approach (MPA). Finally, we present computational experiments on randomly generated instances.
Fichier principal
Vignette du fichier
Pillac_DTRSP_tech.pdf (866.7 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00739781 , version 1 (09-10-2012)

Identifiants

  • HAL Id : hal-00739781 , version 1

Citer

Victor Pillac, Christelle Guéret, Andrés Medaglia. On the Dynamic Technician Routing and Scheduling Problem. [Research Report] Ecole des Mines de Nantes. 2012. ⟨hal-00739781⟩
727 Consultations
734 Téléchargements

Partager

Gmail Facebook X LinkedIn More