A discrete water cycle algorithm for solving the symmetric and asymmetric traveling salesman problem.
Eneko OsabaJavier Del SerAli SadollahMiren Nekane BilbaoDavid CamachoPublished in: Appl. Soft Comput. (2018)
Keyphrases
- cost function
- experimental evaluation
- convergence rate
- computational complexity
- matching algorithm
- detection algorithm
- preprocessing
- convex hull
- high accuracy
- objective function
- improved algorithm
- combinatorial optimization
- energy function
- optimization algorithm
- theoretical analysis
- worst case
- computational cost
- dynamic programming
- k means
- optimal solution
- probabilistic model
- significant improvement
- times faster
- evolutionary algorithm
- similarity measure