@MASTERSTHESIS\{IMM2013-06655,
    author       = "D. Loghin",
    title        = "Visualization and Comparison of Randomized Search Heuristics for Dynamic Traveling Salesperson Problems",
    year         = "2013",
    school       = "Technical University of Denmark, Department of Applied Mathematics and Computer Science / {DTU} Co",
    address      = "Matematiktorvet, Building 303B, {DK-}2800 Kgs. Lyngby, Denmark, compute@compute.dtu.dk",
    type         = "",
    note         = "{DTU} supervisor: Carsten Witt, cawi@dtu.dk, {DTU} Compute",
    url          = "http://www.compute.dtu.dk/English.aspx",
    abstract     = "The present thesis deals with implementing, analyzing and comparing randomized search heuristics for the traveling salesperson problem. Together with it, a software application was built, that implements ve choices of randomized search heuristics (Genetic Algorithm, (1+1) Evolutionary Algorithm, Randomized Local Search, Simulated Annealing and Min-Max Ant System) and the various implementation choices are discussed throughout the report.
The main goal of this Master Project is implementing and analyzing a system that allows the five algorithms to run in a dynamic environment. Four types of dynamic changes are implemented: interchanging the positions of two cities on the input map, having congested roads that get unusable from time to time, deleting and adding of cities. All these changes occur without restarting the algorithms, and the application's results on various tests are discussed in the latter stages of the report."
}