WARP2.
Lisboa, Portugal
SCHEDULE.
Sunday - ISEG
18:00-20:00
Registration and Welcome reception at ISEG - entrance Rua das Francesinhas.
Monday - Room Novo Banco, Floor 4, Quelhas building
9:00 - Welcome
9:15–10:15 Section M1 – Chair: Cândida Mourão
M1.1 Enrique Benavent · Experiments with different formulations for the Capacitated Arc Routing Problem
M1.2 Jessica Rodríguez-Pereira · Formulation and exact solution of the Multi-Depot Rural Postman Problem10:15
10:15 Coffee Break
10:45-12:15 Section M2 - Chair: Renata Mansini
M2.1 Hani Zbib · Optimizing Street Cleaning: the Case of Copenhagen
M2.2 Lu Chen · Stochastic optimization of road network maintenance problem
M2.3 Juan P. Riquelme-Rodríguez · Street cleaning after mudslide in the Atacama desert
14:00 – 15:30 Section M3 – Chair: Ángel Corberán
M3.1 Stefan Voss · The Orienteering Arc Routing Problem with Variable Profits
M3.2 Renata Mansini · Introducing incompatibility constraints in a Directed Profitable Rural Postman Problem
M3.3 F. Siebel Salman · Multi-vehicle Synchronized Prize Collecting Arc Routing for Connectivity Problem
12:15 Lunch
16:00 –17:30 Section M4 – Chair: Gilbert Laporte
M4.1 José María Sanchis · The Chinese Postman Problem with Load-dependent costs
M4.2 Demetrio Laganà · Solving the mixed capacitated general routing problem with time windows
M4.3 Lone Kiilerich · Large-Scale Instances for CARP and New Variations of the CARP
15:30 Coffee Break
20:00 Workshop Dinner - Clube do Fado (http://www.clube-de-fado.com/eng/contactos.html)
Tuesday - Room Novo Banco, Floor 4, Quelhas building
9:00-10:30 Section T1 – Chair: Geir Hasle
T1.1 Manuel Sorge · An approximation algorithm for Mixed and Windy Capacitated Arc Routing: Theory and Experiments
T1.2 Oliver Lum · A Hybrid Heuristic for the Windy Rural Postman Problem with a Time-Dependent Zigzag Option
T1.3 Michel Gendreau · A general robust optimization model for arc routing problems with uncertain service times
11:00-12:30 Section T2 – Chair: Sanne Wøhlk
T2.1 Leonor Pinto · Mixed arc routing and waste collection – a case study
T2.2 Geir Hasle · A Memetic Algorithm for the Mixed Capacitated General Routing Problem with Route Balancing
T2.3 Marcos Negreiros · The Heterogeneous Sector Routing Problem
10:30 Coffee Break
12:30 Lunch
14:00-15:30 Section T3 – Chair: Richard Eglese
T3.1 Isaac Plana · Aesthetic Constraints for the Min-Max K-Windy Rural Postman Problem
T3.2 M.João Cortinhal · A sectoring-routing algorithm for the mixed capacitated arc routing problem with attractive service areas
T3.3 Thibaut Vidal · Arc Routing Problems -- Neighborhood search with implicit service orientations
16:00 – 17:00 Section T4 – Chair: Leonor S. Pinto
T4.1 M. Cândida Mourão · Dissimilar routine routing problems
T4.2 Ángel Corberán · On the Hierarchical Mixed Rural Postman Problem
17:00 Closing Sssion - Ángel Corberán
15:30 Coffee Break