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.
|Tilldelningsdatum||19 sep 2017|
|Status||Publicerad - 19 sep 2017|
|MoE-publikationstyp||G2 Masteruppsats, polyteknisk masteruppsats|
Tilläggsuppgifter om doktorsavhandlingFull scholarship award from the European Commission.
- 111 Matematik