Beta 1


Title Technician Routing and Scheduling
Author Uldall Pedersen, Christian
Taarnhøj, Erik Schmidt
Vorts, Søren
Supervisor Stidsen, Thomas K. (Operations Research, Department of Informatics and Mathematical Modeling, Technical University of Denmark, DTU, DK-2800 Kgs. Lyngby, Denmark)
Institution Technical University of Denmark, DTU, DK-2800 Kgs. Lyngby, Denmark
Thesis level Master's thesis
Year 2008
Abstract This thesis introduces and examines the Technician Routing and Scheduling Problem (TRSP). TRSP is a problem arising within companies dealing with service technician scheduling. The thesis is written in collaboration with Microsoft who is interested in providing companies with a piece of software being able to automate the scheduling of service technicians. This thesis seek to please the potential clients of such software. This is done by providing a solver based on metaheuristics. Heuristics have been chosen since it is shown that commercial solvers are unable to solve TRSP on real life instances of TRSP. TRSP is also proven to be NP-complete. The metaheuristic is based on a wide range of concepts taken from the general literature. These concepts include Tabu search, Genetic algorithms, diversification methods, Hill climbing, semi-greedy construction heuristics and basic intensification ideas. The metaheuristic is implemented in an easy-to-use and extendable solver. The solver has been integrated with Microsoft Dynamics AX. The results obtained on both randomly generated data as well as real world data indicate that the provided solver is capable of creating better solutions to TRSP than what is possible through human dispatching. The solver is compared to a realized plan by comparing a set of key performance indicators set by the company providing the data. The solver is shown to improve all these key performance indicators.
Series IMM-M.Sc.-2008-11
Fulltext
Original PDF ep08_11.pdf (4.35 MB)
Admin Creation date: 2008-03-07    Update date: 2008-07-15    Source: dtu    ID: 211562    Original MXD