Routing around traffic: metaheuristics for routing problems with time-dependent travel times

01 January 2012 → 01 October 2017
Regional and community funding: Special Research Fund
Research disciplines
  • Natural sciences
    • Applied mathematics in specific fields
    • Statistics and numerical methods
  • Social sciences
    • Business administration and accounting
    • Management
  • Engineering and technology
    • Automotive engineering
metaheuristics operations research vehicle routing problems
Project description

Logistic companies look for the optimal order to visit customers. However, in practice, the travel time between two customers can vary immensely during the day. Therefore, it makes perfect sense to “route around traffic”: planning visits in a way to avoid congestion whenever possible. Our goal is to develop efficient metaheuristics that can solve these “time-dependent routing problems”, in real-time.