@MASTERSTHESIS\{IMM2006-04660,
    author       = "S. B. Nielsen",
    title        = "Transport Optimization at Danisco: Routing of Pack Machines",
    year         = "2006",
    keywords     = "Distribution Problems, Vehicle Routing Problem, Time Windows, Simulated Annealing, Steepest Descent",
    school       = "Informatics and Mathematical Modelling, Technical University of Denmark, {DTU}",
    address      = "Richard Petersens Plads, Building 321, {DK-}2800 Kgs. Lyngby",
    type         = "",
    note         = "Jesper Larsen and Jens Clausen, {IMM,} {DTU} and Allan Larsen {CTT,} {DTU} were supervisors on the project. The thesis was carried out in co-operation with the Danish Sugar Firm Danisco.",
    url          = "http://www2.compute.dtu.dk/pubdb/pubs/4660-full.html",
    abstract     = "The main purpose of the thesis is to solve the two real-life distribution problems, that is the pack machine problem and the limited pack machine problem. Well known problems from operational research are used as approaches to formulate the problems, these are the Vehicle Routing Problem, the Vehicle Routing Problem with Time Windows and the Travelling Salesman Problem (with Time Windows). Mathematical models of the approaches are presented, and it is described how they could be applied on the pack machine problem and the limited pack machine problem.

Solution methods based on the local search method Steepest Descent and the metaheuristic Simulated Annealing are developed and implemented. Initial solutions are obtained with a nearest neighbour construction heuristic and an insertion heuristic. Results obtained with Simulated Annealing and Steepest Descent is presented. 

Finally an exact method for solving the pack machine problem is presented. The method is based on column generation and branch \& bound."
}