Solving the Traveling Salesman Problem with EDAs
2002; Springer Nature; Linguagem: Inglês
10.1007/978-1-4615-1539-5_10
ISSN1568-2587
AutoresVı́ctor Robles, Pedro Miguel, Pedro Larrañaga,
Tópico(s)Optimization and Mathematical Programming
ResumoIn this chapter we present an approach for solving the Traveling Sales man Problem using Estimation of Distribution Algorithms (EDAs). This approach is based on using discrete and continuous EDAs to find the best possible solution. We also present a method in which domain knowledge (based on local search) is combined with EDAs to find better solutions. We show experimental results obtained on several standard examples for discrete and continuous EDAs both alone and combined with a heuristic local search.
Referência(s)