{"id":2692,"date":"2016-10-23T14:12:41","date_gmt":"2016-10-23T19:12:41","guid":{"rendered":"http:\/\/hanalog.polymtl.ca\/en\/2016\/10\/23\/publication-de-larticle-the-rescheduling-arc-routing-problem\/"},"modified":"2016-10-23T14:24:18","modified_gmt":"2016-10-23T19:24:18","slug":"publication-de-larticle-the-rescheduling-arc-routing-problem","status":"publish","type":"post","link":"https:\/\/hanalog.ca\/en\/2016\/10\/23\/publication-de-larticle-the-rescheduling-arc-routing-problem\/","title":{"rendered":"Publication of the article “The rescheduling arc routing problem”"},"content":{"rendered":"

The article “The rescheduling arc routing problem” of Marcela Monroy-Licht,\u00a0Ciro Alberto Amaya,\u00a0Andr\u00e9 Langevin and Louis-Martin Rousseau has been published in the prestigious journal International Transactions in Operational Research (IFORS).<\/p>\n

Link to access to the article : \u00a0The rescheduling arc routing problem<\/a><\/p>\n

Abstr<\/span>act :<\/span><\/p>\n

\n

In<\/span> this<\/span> pa<\/span>per<\/span>,<\/span> the<\/span> r<\/span>escheduling<\/span> ar<\/span>c<\/span> r<\/span>outing<\/span> pr<\/span>ob<\/span>lem<\/span> is<\/span> intr<\/span>oduced.<\/span> This<\/span> is\u00a0<\/span>a\u00a0<\/span>d<\/span>ynamic\u00a0<\/span>r<\/span>outing\u00a0<\/span>and\u00a0<\/span>scheduling\u00a0<\/span><\/span><\/span>pr<\/span>oblem\u00a0<\/span>tha<\/span>t\u00a0<\/span>considers\u00a0<\/span>adjustments<\/span> to<\/span> an<\/span> initial<\/span> r<\/span>outing<\/span> itinerary<\/span> w<\/span>hen<\/span> one<\/span> or<\/span> more<\/span> v<\/span>ehicle<\/span> failur<\/span>es<\/span> occur\u00a0<\/span>during<\/span> the<\/span> ex<\/span>ecution<\/span> sta<\/span>ge<\/span> and<\/span> the<\/span> original<\/span> plan<\/span> m<\/span>ust<\/span> be<\/span> modi\ufb01ed.<\/span> W<\/span>e<\/span> minimiz<\/span>e<\/span> the<\/span> opera<\/span>tional<\/span> and<\/span> schedule\u00a0<\/span>disruption<\/span> costs<\/span>.<\/span> F<\/span>or<\/span>m<\/span>ula<\/span>tions<\/span> based<\/span> on<\/span> mixed-integer<\/span> pr<\/span>ogr<\/span>amming<\/span> are<\/span> pr<\/span>esented<\/span> to<\/span> compar<\/span>e<\/span> dif<\/span>fer<\/span>ent\u00a0<\/span>policies<\/span> in<\/span> the<\/span> rer<\/span>outing<\/span> phase<\/span>.<\/span> A<\/span> solution<\/span> stra<\/span>tegy<\/span> is<\/span> dev<\/span>eloped<\/span> w<\/span>hen<\/span> both<\/span> costs<\/span> are<\/span> e<\/span>v<\/span>alua<\/span>ted<\/span> and<\/span> it<\/span> is\u00a0<\/span>necessary<\/span> to<\/span> \ufb01nd<\/span> a<\/span> solution<\/span> quickl<\/span>y<\/span>.<\/span> Computa<\/span>tional<\/span> tests<\/span> on<\/span> a<\/span> lar<\/span>ge<\/span> set<\/span> of\u00a0<\/span>instances<\/span> compare<\/span> the<\/span> dif<\/span>fer<\/span>ent\u00a0<\/span>decision-mak<\/span>er<\/span> policies<\/span>.<\/span><\/span><\/p>\n

To cite the article\u00a0:<\/p>\n

Monroy-Licht, M., Amaya, C. A., Langevin, A. and Rousseau, L.-M. (2016), The rescheduling arc routing problem. International Transactions in Operational Research. doi:\u00a010.1111\/itor.12346<\/p>\n<\/div>\n

 
\n