VRP 2013 – Computational aspects of vehicle routing

I  taught a workshop on computational aspects of vehicle routing during the VRP 2013 spring school in Angers, France. The course attempts to answer the following questions:

  • What is time and space complexity? Why is it important?
  • How to represent a solution efficiently?
  • What are the main bottlenecks and how to avoid them?
  • How do parallel computing work? Why, when, and how to parallelize?
  • How to design flexible and reusable code?
  • How to avoid reinventing the wheel?

More information here.


A parallel matheuristic for the technician routing and scheduling problem

We published a paper presenting a parallel matheuristic to tackle a technician routing and scheduling problem:

V. Pillac, C. Guéret, A. Medaglia
A parallel matheuristic for the technician routing and scheduling problem
Optimization Letters, Accepted manuscript, doi:10.1007/s11590-012-0567-4.

Continue reading