Vehicle Routing in Time-Dependent Networks (Route)

Main funder

Funder's project number: 311036

Funds granted by main funder (€)

  • 3 000,00

Funding program

Project timetable

Project start date: 01/02/2017

Project end date: 31/12/2019


. Vehicle routing problem in time-dependent networks (TDVRP) are huge NP-hard combinatorial optimization problems. One of the important problems of finding optimal routes in this kind of models is time inconsistency of the solutions generated by many heuristics. To provide higher level of time consistency of heuristics some approaches can be applied. One of them consists in developing a procedure of heuristic adaptation. The main goal of collaboration is the discussing possible approaches and methods which could improve heuristics applied for solving TDVRP.

Principal Investigator

Primary responsible unit

Related publications

Last updated on 2022-06-07 at 11:59