Séminaire conjoint CRT-Chaire de recherche du Canada en distributique-Chaire de recherche du Canada en logistique et en transport
TITRE : A variable neighborhood descent for arc routing problems with time-dependent service costs
CONFÉRENCIÈRE : Mariam Tagmouti, DIRO, Université de Montréal
DATE et ENDROIT : 14 janvier, 10h30, salle 5441, Pavillon André-Aisenstadt, Campus de l’Université de Montréal
RESPONSABLE : Gilbert Laporte (514-343-6143)
RÉSUMÉ : We propose a variable neighborhood descent for solving a capacitated arc routing problem (CARP) with time-dependent service costs. This problem is motivated by winter gritting applications where the timing of each intervention is crucial. Service cost on each required arc depends on the time of starting service on the arc. The variable neighborhood descent heuristic is based on neighborhood structures that manipulate arcs or sequences of arcs. Computational results are reported on derived instances from classical CARP instances. We also compare results with an alternative approach proposed by Ibaraki et al. by transforming the arc routing problem into an equivalent node routing problem.