Greedy Like Algorithms for the Traveling Salesman and Multidimensional Assignment Problems
Gregory Gutin, Daniel Karapetyan · InTech eBooks · 2008
Unfortunately, no formal definition exists for the wide family of greedy like algorithms and one can understand the difficulty to formally classify such algorithms by, for example, considering local search algorithms which find the best solution in each neighborhood they search.Intuitively, it is clear that such local search algorithms are not greedy yet their every search is greedy in a sense.In the next section, we give most of terminology and notation used in this chapter.Several results on theoretical performance of greedy like algorithms for the Traveling Salesman and Multidimensional Assignment Problems are discussed in Sections 3 and 4, respectively.Experimental results on greedy like algorithms for the Traveling Salesman and Multidimensional Assignment Problems are given and analyzed in Sections 5 and 6, respectively.