(+36) 88 424 483

   Egyetem str. 10, Building I, 9th floor, Veszprém H-8200

  

Thesis

Description: From theoretical point of view the vehicle route planning (VRP) is a variant of the travelling sales person (TSP) problem known to be NP-complete, i.e., computationally difficult. Practical importance of VRP motivates the development of practically effective methods. There exist alternative mathematical programming formulations of the problems leading to different computational needs. Model generation and solution software is to be developed to evaluate practical effectiveness of alternative formulations over a test base.

Supervisor: Botond Bertók

Contact: