A two-level diploid genetic based algorithm for solving the family traveling salesman problem.
Petrica C. PopOliviu MateiCamelia-Mihaela PinteaPublished in: GECCO (2018)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- hamiltonian cycle
- ant colony optimization
- discrete particle swarm optimization
- dynamic programming
- cost function
- optimal solution
- computational complexity
- minimum spanning tree
- simulated annealing
- convex hull
- search space
- expectation maximization
- similarity search
- similarity measure
- bipartite graph
- graph coloring