Venue
Sala d'Actes, Castelldefels building
Av. Carl Friedrich Gauss, 5
08860 Castelldefels
Espanya
When
03/04/2019 11.00h
Organized by
Universitat Oberta de Catalunya, ICSO research group of the IN3
Program
This seminar will discuss about the Time Capacitated Arc Routing Problem (TCARP) and will try to introduce a heuristic and a metaheuristic algorithm for solving large-size instances of it. The TCARP is a realistic extension of the Capacitated Arc Routing Problem in which edge-servicing and edge-traversing costs, as well as vehicle capacities, are all time-based—i.e., given in time units. Accordingly, the TCARP goal is to minimise the total time employed in servicing the required edges, for which other edges might need to be traversed too. According to the numerical experiments carried out, the proposed heuristic is able to provide real-time results of high quality even for the largest instances considered. Likewise, the proposed metaheuristic outperforms other existing approaches, both in quality as well as in computing times.