Generating High Quality Candidate Sets by Tour Merging for the Traveling Salesman Problem.
Andrius BlazinskasAlfonsas MiseviciusPublished in: ICIST (2012)
Keyphrases
- traveling salesman problem
- generating high quality
- combinatorial optimization
- ant colony optimization
- optimization problems
- ant colony optimization algorithm
- high quality
- traveling salesman
- vehicle routing problem
- hamiltonian cycle
- neural network
- crossover operator
- subtour elimination
- domain independent planning
- discrete optimization problems
- multi objective
- genetic algorithm