The Vehicle Routing Problem - An Application and Proposed Heuristics

Forskningsoutput: AvhandlingMagisteruppsats

Sammanfattning

The thesis deals with the study of the Vehicle Routing Problem (VRP) for an application in the industry. Specifically, the objective is the optimization of pickup and delivery requests in a microchip production line with a one-dimensional geometry. First, a classification scheme for the VRP is presented in order to more accurately introduce the problem at hand. A full mixed integer linear programming (MILP) formulation is proposed together with a two-phase heuristic method that remarkably decreases the computation times and moderately compromises the accuracy of the solution. Afterwards, an additional heuristic that seeks to improve running times is outlined. Both heuristics break the routing problem into an assignation and a routing problem.
Originalspråkengelska
Tilldelande institution
  • University of L'Aquila
Handledare
  • Arbib, Claudio, Handledare, Extern person
  • Smriglio, Stefano, Handledare, Extern person
Tilldelningsdatum19 sep 2017
StatusPublicerad - 19 sep 2017
Externt publiceradJa
MoE-publikationstypG2 Masteruppsats, polyteknisk masteruppsats

Tilläggsuppgifter om doktorsavhandling

Full scholarship award from the European Commission.

Vetenskapsgrenar

  • 111 Matematik

Citera det här