Programme
Sunday May 22, 2022
19:30 – 21:00 Welcome reception
Monday May 23, 2022
08:30 – 09:15 Registration
08:30 – 09:15 Opening session
09:00 – 10:30 Session MO1 Chair: Isaac Plana (Spain)
Demetrio Laganà (Italy): A two-phase hybrid algorithm for the periodic rural postman problem with irregular services on mixed graphs
Jiří Fink (Czech Republic): District Division in Arc-Routing
Georg E. A. Fröhlich (Austria): Dynamic snow ploughing on a rolling horizon basis
11:00 – 11:30 Coffee break
11:30 – 13:00 Session MO2 Chair: Sanne Wøhlk (Denmark)
Vahid Akbari (UK): An online optimization approach to post-disaster road restoration
Matheus Diógenes Andrade (Brazil): Heuristic approach for routing vehicles for Dengue control
Isaac Plana (Spain): A formulation and an exact algorithm for the Disaster-Recovery Graphical Traveling Salesman Problem
13:00 – 14:30 Lunch
14:30 – 16:00 Session MO3 Chair: M. Cândida Mourão (Portugal)
José María Sanchis (Spain): New results on the K-Drones Arc Routing Problem
Paula Segura (Spain): The multi-purpose K-drones general routing problem
Teresa Corberán (Spain): The Multi-Depot Drone General Routing Problem
18:00 – 20:00 Social event: visit to the city
20:00 Workshop dinner in the port of Valencia
Tuesday May 24, 2022
09:30 – 11:00 Session TU1 Chair: José Manuel Belenguer (Spain)
Chenge Wei (China): A Capacitated Multi-Level Arc Routing problem with Intermediate Facilities in Waste Collection
Sanne Wøhlk (Denmark): A Districting-Based Heuristic for the Coordinated Capacitated Arc Routing Problem
Leonor Santiago Pinto (Portugal): A Matheuristic for Attractive Arc Routing
11:00 – 11:30 Coffee break
11:30 – 13:00 Session TU2 Chair: José María Sanchis (Spain)
Juliana Castaneda (Spain): Biased Randomized Algorithms and Simheuristics for Large Scale and Stochastic Arc Routing Problems
Thu Huong Dang (UK): Fast Upper and Lower Bounds for a Large-Scale Real-World Arc Routing Problem
Rafael Martinelli (Brazil): The Electric Capacitated Arc Routing Problem with Time-Dependent and nonlinear Energy Consumption
13:00 – 14:30 Lunch
14:30 – 16:00 Session TU3 Chair: Demetrio Laganà (Italy)
Miguel Reula (Spain): The Min-Max Close-Enough Arc Routing Problem
Inmaculada Ventura (Spain): Online Algorithms for Tree Coverage
José Manuel Belenguer (Spain): New improvements in the cutting plane for the Capacitated Arc Routing Problem
16:00 Closing session