The Traveling Salesman Problem
In the next chapter, we present several examples of evolution programs tailored to specific applications (graph drawing, partitioning, scheduling). The traveling salesman problem (TSP) is just one of such applications; however, we treat it as a special problem — the mother of all problems — and discuss it in a separate chapter. What are the reasons?
KeywordsTravel Salesman Problem Travel Salesman Problem Crossover Point Local Search Algorithm Conjunctive Normal Form
Unable to display preview. Download preview PDF.